Authenticating or signature method with reduced computations

Details Authenticating or signature method with reduced computations Authenticating or signature method with reduced computations

2007-02-27

2007-02-27

Barrón, Jr., Gilberto (Department: 2132)

Cryptography

Particular algorithmic function encoding

Public key

C380S282000, C713S171000

Reexamination Certificate

active

09889557

ABSTRACT:
Authentication and signature process with reduced number of calculations.The process involves a first entity called the “prover”, which possesses a public keyvand a secret key s, these keys verify the relation v=s−t(mod n), wherenis an integer called modulus andtis a parameter, and a second entity called a “verifier”, which knows the public keyv. This process implies exchange of information following a “zero-knowledge protocol” between the verifier and the prover and cryptographic calculations on this information, some calculations being carried out “modulon”. The process of the invention is characterised by the fact that the modulusnis specific to the prover that communicates this modulus to the verifier.

REFERENCES:
patent: 5218637 (1993-06-01), Angebaud et al.
patent: 0325 238 (1989-07-01), None
patent: 0325238 (1989-07-01), None
patent: 0325238 (1989-07-01), None
patent: 2 716 058 (1995-08-01), None
patent: 2 752 122 (1998-02-01), None
patent: WO 89/11706 (1989-11-01), None
patent: WO 98/42173 (1998-10-01), None
Scheiner, Bruce, Applied Cryptography- Protocvols, Algorithms, and Source Code in C(Second Edition), John Wiley & Sons, Inc(1996): pp. 249-250.
Schenier, Bruce. “Public-Key Algorithms: RSA.” Applied Cryptography: Protocols, Algorithms and Source Code in C. New York: John Wiley & Sons, 1996. pp. 470.
Schenier, Bruce. “Mathematical Background: Number Theory.” Applied Cryptography: Protocols, Algorithms and Source Code in C. New York: John Wiley & Sons, 1996. pp. 249-250.
Schneier, Bruce, Applied Cryptography, “Number Theory”. New York, NY, 1996, 244-80.
J. Brandt, et al., Advances in Cryptology—Crypto '88 Proceedings, pp. 583-588, “Zero-Knowledge Authentication Scheme with Secret Key Exchange”, Aug. 21-25, 1988.
A. Fiat, et al., Advances in Cryptology—Crypto '86 Proceedings, pp. 186-194, “How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, Aug. 11-15, 1986.
H-P. Konigs, IEEE Communications Magazine, vol. 29, No. 6, pp. 42-48, “Cryptographic Identification Methods for Smart Cards in the Process of Standardization”, Jun. 1991.
L. C. Guillou, et al., Advances in Cryptology—Eurocrypt '88, pp. 123-128, “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory”, May 25-27, 1988.
J-J. Quisquater, et al., Electronics Letters, vol. 18, No. 21, pp. 905-907, “Fast Decipherment Algorithm for RSA Public-Key Cryptosystem”, Oct. 14, 1982.

Affiliated with

Also associated with

Rating

Authenticating or signature method with reduced computations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Authenticating or signature method with reduced computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Authenticating or signature method with reduced computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3894137