Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2005-05-31
2005-05-31
Barrón, Gilberto (Department: 2132)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C713S176000, C380S030000
Reexamination Certificate
active
06901513
ABSTRACT:
A method for generating a digital signature s of a message m using a secret key including at least two large prime numbers p, q is provided. It is provided that s is the zero of the polynomial P(x)−m modulo n, P(x) being any permutation polynomial modulo n.
REFERENCES:
patent: 4625076 (1986-11-01), Okamoto et al.
patent: 4933970 (1990-06-01), Shamir
patent: 5497423 (1996-03-01), Miyaji
patent: 5787178 (1998-07-01), Schwenk
patent: 195 13 896 (1996-10-01), None
patent: 2 264 423 (1993-08-01), None
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 Barbara, 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 Crytography”, 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, “Kryptologie”, Vieweg-Verlag, 1994 (attached please find the English-language version of the Beutelspacher reference from The Mathematical Association of America).
Huber Klaus
Schwenk Jörg
Barrón Gilberto
Deutsche Telekom AG
Kenyon & Kenyon
Lanier Benjamin E.
LandOfFree
Process for generating a digital signature and process for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Process for generating a digital signature and process for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Process for generating a digital signature and process for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3457900