Cryptography – Particular algorithmic function encoding
Reexamination Certificate
1998-08-05
2001-11-06
Hayes, Gail (Department: 2131)
Cryptography
Particular algorithmic function encoding
Reexamination Certificate
active
06314187
ABSTRACT:
FIELD OF INVENTION
This invention relates to a method for encrypting or decrypting a sequence of successive data words of length M in a data communications device.
BACKGROUND OF INVENTION
From Berhard Sklar, “Digital Communications” Prentice Hall, Englewood Cliffs, N.J., 1988, page 290 et seq., an encryption method is known in which encoding is performed by means of a shift register. This method has the disadvantage that the encoding technique can be easily discovered, so that the encoded data can be easily decrypted.
Furthermore, the so-called RC-4 algorithm is known, in which quasi-random encryption words are generated by performing different arithmetic operations. This algorithm has the disadvantage that a great amount of storage space is necessary for good encryption.
The object of the invention is to provide a method for encrypting or decrypting a data sequence which is difficult to decrypt, does not require much storage space, and can be implemented on silicon at low cost.
SUMMARY OF INVENTION
A method for encrypting or decrypting a sequence of successive data words of length M in a data communications device, including executing an algorithm in which a sequence of quasi-random encryption words of length M is generated from predetermined start values by performing operations in a finite group GF(2
N
), and in which a respective one of the encryption words is combined with a respective one of the data words.
REFERENCES:
patent: 4165444 (1979-08-01), Gordon
patent: 4797921 (1989-01-01), Shiraishi
patent: 4890252 (1989-12-01), Wang
Bruce Schneier, Applied Cryptology, 254-255, chapter 17, Oct. 1994.*
Robert McEliece, Finite Fields for Computer Scientist and Engineers chapter 6, 7, 8, 1987.*
Neal Koblitz, Algebraic Aspects of Cryptology, Springer-Verlag 55-64, 1991.*
Bernard Sklar, Digital Communications, Prentice Hall, pp. 290298, 1988.*
Schneier, “Angewandte kryptographie”, Addison-Wesley Publishing Company, pp. 434-435, 1996 (with Prior Art Statement attached).
Sklar, “Digital Communications”, Prentice Hall, Englewood Cliffs, New Jersey, Channel Coding: Part 1, Chap. 5, pp. 290-298, 1988.
Copy of German Search Report for 197 33 829, dated Mar. 31, 1998.
Bruche Schneier, “Applied Cryptography”, 1996, USA Chapter 17, “Other Stream Ciphers and Real Random-Sequence Generators”, pp. 397, 398,420.
Karmel M. Shaheen, “Code Bond Cipher System”, Proceedings Of The Annual International Carnahan Conference On Security Technology, USA, IEEE, Oct. 12, 1994, pp. 68-70.
D.E. Knuth, “The Art Of Computer Programming. vol. 2/Seminumerical Algorithms . . . ” 1980, USA, pp. 31,32.
M. Mihaljevic et al, “A Fast And Secure Stream Cipher Based On Cellular Automata Over GF (Q)”, IEEE Global Telecommunications Conference, USA, NY IEEE, 1998, pp. 3250-3255.
European Search Report, EP 98113474, Oct. 2, 2000.
Menkhoff Andreas
Witte Franz-Otto
Duane Morris LLP
Hayes Gail
Micronas Intermetall GmbH
Seal James
LandOfFree
Method for encryption or decryption using finite group... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for encryption or decryption using finite group..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for encryption or decryption using finite group... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2617776