Electrical computers and digital processing systems: support – Data processing protection using cryptography
Reexamination Certificate
1996-02-07
2003-10-21
Hayes, Gail (Department: 2131)
Electrical computers and digital processing systems: support
Data processing protection using cryptography
C380S028000
Reexamination Certificate
active
06636970
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates to techniques for the encoding of data including character, voice, animation, still image, program, or other data, and to techniques for the decoding of these kinds of encoded data.
For software distribution, a method of encrypting character, voice, animation, still image, program or other data and storing this data on floppy disks, CD-ROMs, magneto-optical disks (MO), or other media, and selling these media, may be employed, or a method of encoding the data and delivering the data to users through a communications circuit, as well as other methods, may be employed.
In previous encoding methods of this kind, the provider has, for example, encoded a program with a single algorithm and provided it to the user, and the user has performed the decoding operation using a so-called “key” also provided to the user.
However, when the key possessed by the user is obtained by a wrongful user, there is a fear that a copy will be created based on the results of a decoding using the wrongfully obtained key. If a large amount of these copies are circulated, the provider will be forced to incur a substantial loss.
The present invention has been created bearing this problem in mind, by noting that many types of software have a special characteristic of under going an upgrade after only a brief period of time. The present invention provides an encoding combination method whereby the encoding algorithm may be changed periodically or for each software upgrade.
SUMMARY OF THE INVENTION
The present invention employs two or more basic encoding algorithms for encoding software. Conversely, for software decoding processing (the software encoding apparatus), basic decoding algorithms are prepared that correspond to these two or more encoding algorithms. Then, the software encoding apparatus transfers, along with the encoded software combination identification information identifying the encoded algorithms used for encoding to the software decoding means (the software decoding apparatus).
The above-mentioned basic encoding algorithm performs at a minimum the processing necessary to convert input data into random like data. For example, convert input data into rearranged data or replaced data. In addition, exclusive-OR of the input data and other random data can be output.
Based on the previously mentioned algorithm combination identification information, the software decoding means selects basic decoding algorithms from among those that it possesses, and decodes the previously mentioned encoded software.
Within the previously mentioned means, when the software is input into the software encoding apparatus, it is encoded with a selected basic algorithm combination (for example, A
1
and A
3
). Software that has been encoded in this way is distributed to the user in the form of a CD-ROM or via a communications circuit. The user decodes this encoded software with a decoding apparatus that he or she possesses. At this time, the user decodes the relevant encoded software based on or responsive to the encoding combination identification information (for example, A
1
¦ ¦A
3
) used by the encoding apparatus. This combination information may be delivered to the user on the same medium as the encoded software, or on a different medium, or it may be communicated to the user along with non-illustrated key information (K).
Moreover, the combination identification information may be encoded by using an algorithm.
Each of the individual algorithms are relatively easy to analyze. However, the combining of these algorithms increases the difficulty of analysis. Therefore, even though each individual algorithm may easily be grasped on its own or separately, since there is an enormous amount of possible algorithm combinations, it would require significant time and effort to analyze a combination of algorithms, making such an analysis difficult in reality. Even if there were to be a possibility of such an analysis occurring, if for every software upgrade, the software is encoded with a new combination of algorithms, the most recent software upgrade cycle will be sufficient to cover for such a possibility.
In fact, if hackers should attempt to decode the combinations of the encoded algorithms has such a large number they will likely abandon the attempt.
REFERENCES:
patent: 3962539 (1976-06-01), Ehrsam et al.
patent: 4247106 (1981-01-01), Jeffers et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 4439670 (1984-03-01), Basset et al.
patent: 4441095 (1984-04-01), Widmer et al.
patent: 4446519 (1984-05-01), Thomas
patent: 4484025 (1984-11-01), Ostermann et al.
patent: 4484217 (1984-11-01), Block et al.
patent: 4558176 (1985-12-01), Arnold et al.
patent: 4590557 (1986-05-01), Lillie
patent: 4598170 (1986-07-01), Piosenka et al.
patent: 4646234 (1987-02-01), Tolman et al.
patent: 4649510 (1987-03-01), Schmidt
patent: 4652990 (1987-03-01), Pailen et al.
patent: 4654799 (1987-03-01), Ogaki et al.
patent: 4658093 (1987-04-01), Hellman
patent: 4672554 (1987-06-01), Ogaki
patent: 4674055 (1987-06-01), Ogaki et al.
patent: 4740890 (1988-04-01), William
patent: 4771458 (1988-09-01), Citta et al.
patent: 4780905 (1988-10-01), Cruts et al.
patent: 4787050 (1988-11-01), Suzuki
patent: 4816653 (1989-03-01), Anderl et al.
patent: 4816654 (1989-03-01), Anderl et al.
patent: 4817140 (1989-03-01), Chandra et al.
patent: 4817144 (1989-03-01), Citta et al.
patent: 4853962 (1989-08-01), Brockman
patent: 4864516 (1989-09-01), Gaither et al.
patent: 4879645 (1989-11-01), Tamada et al.
patent: 4949257 (1990-08-01), Orbach
patent: 4999806 (1991-03-01), Chernow et al.
patent: 5006849 (1991-04-01), Baarman et al.
patent: 5008814 (1991-04-01), Mathur
patent: 5014234 (1991-05-01), Edwards, Jr.
patent: 5016009 (1991-05-01), Whiting et al.
patent: 5051822 (1991-09-01), Rhoades
patent: 5056009 (1991-10-01), Mizuta
patent: 5103392 (1992-04-01), Mori
patent: 5103476 (1992-04-01), Waite et al.
patent: 5166886 (1992-11-01), Molnar et al.
patent: 5179591 (1993-01-01), Hardy et al.
patent: 5181107 (1993-01-01), Rhoades
patent: 5185796 (1993-02-01), Wilson
patent: 5199066 (1993-03-01), Logan
patent: 5199069 (1993-03-01), Barrett et al.
patent: 5214697 (1993-05-01), Saito
patent: 5222134 (1993-06-01), Waite et al.
patent: 5237611 (1993-08-01), Rasmussen et al.
patent: 5239581 (1993-08-01), Hane
patent: 5245330 (1993-09-01), Wassink
patent: 5267171 (1993-11-01), Suzuki et al.
patent: 5301231 (1994-04-01), Abraham et al.
patent: 5311595 (1994-05-01), Bjerrum et al.
patent: 5343527 (1994-08-01), Moore
patent: 5343530 (1994-08-01), Viricel
patent: 5479512 (1995-12-01), Weiss
patent: 5673320 (1997-09-01), Ray et al.
patent: 60-169959 (1985-09-01), None
Bruce Schneier(Applied Cryptography, second edition book, pp. 346-354), Oct. 1995.*
G. S. Vernam, Cipher Printing Telegraph Systems, American Institute of Electrical Engineers, vol. XLV, No. 2, Feb. 26.*
Handbook of Applied Crypotography, Menezes, pp. 240-241, CRC Press, 1996.*
Schneier, Applied Cryptography, 2e, Feb. 26.*
Menezes, Handbook of Applied Cryptography p. 57, 1997.*
C. E. Shannon, Communication Theory of Secrecy Systems, Jan. 9, 1945.*
Sandra Botemps, Letter from John Wiley, date of Publication of Schneier Applied Cryptography, 1997.*
Caxton Foster, Cryptanalysis for Microcomputers, 1982,Hayden Book Company, pp. 222-223.*
Copy of the claims section of the corresponding European Patent (EP 0 727 746, May 15, 2002) of the above-identified US patent application.
Office Action issued by the Korean Patent Office in the corresponding Korean Patent Application No. 10-2000-0032044 of the above-identified application, Jun. 7, 2001, including English language translation of the Office Action.
Office Action issued by the Patent Office of the People's Republic of China in the corresponding Chinese Patent Application No. 96102014.8 of the above-identified application, Mar. 3, 2000, including English language translation of the Office Action.
Office Action from the Korean Patent Office in a corresponding foreign application, mailed Nov. 30, 2000 and Abr
Akiyama Ryota
Yoshioka Makoto
Fujitsu Limited
Hayes Gail
Song HoSuk
Staas & Halsey , LLP
LandOfFree
Software encoding using a combination of two types of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Software encoding using a combination of two types of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Software encoding using a combination of two types of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3132473