Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2000-03-16
2004-04-13
Sheikh, Ayaz (Department: 2131)
Cryptography
Particular algorithmic function encoding
Public key
C380S028000
Reexamination Certificate
active
06721421
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to a method for decrypting a first message (“c”), which is encrypted from a second message (“m”) using a public key in the form of a very large number (“n”) containing various prime numbers and of a permutation polynomial. The encrypted message is formed from c=P(m) mod n and the secret key using the product of at least two prime numbers.
REFERENCES:
patent: 4932056 (1990-06-01), Shamir
patent: 5351298 (1994-09-01), Smith
patent: 195 13 898 (1996-10-01), None
Simith LUC Public-Key Encrypton Dr. Dobb's Journal.*
Smith A Public-Key Cryptosystem and a Digital Signature System Based on the Lucas Function Analogue to Discrete Logaritms.*
Bleichenbacher, Some Remarks on Lucas-Base Cryptosystem.*
J. Schwenk et al., “Public Key Encryption And Signature Schemes Based on Polynomials Over N”, Advances in Cryptology—Eurocrypt '96 International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, May 12-16, 1996, pp. 60-71.
R. Lidl, et al., “Permutation Polynomials in RSA-Cryptsystems” Advances in Cryptology. Proceedings of Crypto 83, Santa Barabara, CA, USA, Aug. 21-24, 1983, pp. 293-301.
E. Bertekamp, “Algebraic Coding Theory”, 1984, pp. 21-29.
W. Diffie et al., “New Directions in Cryptography”, IEEE Transactions on Information Theory, vol. IT-22, Nov. 1976, pp. 644-654.
R. Rivest et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communications of the ACM, vol. 27, No. 2, Feb. 1978, pp. 120-126.
W. B. Müller et al., “Cryptanalysis of the Dickson Scheme”, Proc. Eurocrypt 8S, Lecture Notes in Computer Science, vol. 219, 1986, pp. 50-61.
I. Schur, “Arithmetisches über die Tschebyscheffschen Polynome”, Gesammelte Abhandlungen, vol. III, Springer-Verlag, Berlin, Heidelberg, New York, 1973, pp. 422-453.
V. Varadharajan: “Cryptosystems based on permutation polynomials” International Journal of Computer Mathematics, 1988, London, vol. 23, No. 3-4, pp. 237-250.
A. Beutelspacher, Cryptology, pp. 1-135.
Huber Klaus
Schwenk Jörg
Deutsche Telekom AG
Kenyon & Kenyon
Seal James
Sheikh Ayaz
LandOfFree
Method for encrypting information represented as a numerical... 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 encrypting information represented as a numerical..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for encrypting information represented as a numerical... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3210707