Authenticating or signature method with reduced computations

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

2011-07-05

2011-07-05

Dinh, Ninh (Department: 2432)

Cryptography

Particular algorithmic function encoding

Public key

C713S168000, C713S171000, C380S282000

Reissue Patent

active

RE042517

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: 4964164 (1990-10-01), Fiat
patent: 5140634 (1992-08-01), Guillou et al.
patent: 5218637 (1993-06-01), Angebaud
patent: 5787178 (1998-07-01), Schwenk
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: 2752122 (1998-02-01), None
patent: 2716058 (1998-08-01), None
patent: 08149124 (1996-06-01), None
patent: 11008616 (1999-12-01), None
patent: 8911706 (1989-11-01), None
patent: WO 89/11706 (1989-11-01), None
patent: 9842173 (1998-10-01), None
patent: WO 98/42173 (1998-10-01), None
patent: 9851038 (1998-11-01), None
International Search Report mailed Feb. 25, 2000, for PCT App. PCT1FR00/00174.
International Preliminary Examination Report received by WIPO on Dec. 21, 2000, for PCT App. PCT/FR00/00174.
Office Action mailed Jan. 31, 2005, for U.S. Appl. No. 09/889,557.
Final Office Action mailed May 27, 2005, for U.S. Appl. No. 09/889,557.
Office Action mailed Sep. 27, 2005, for U.S. Appl. No. 09/889,557.
Final Office Action mailed Jan. 18, 2006, for U.S. Appl. No. 09/889,557.
Notice of Allowance mailed Nov. 2, 2006, for U.S. Appl. No. 09/889,557.
Schneier, “Mathematical Background: Number Theory”, Applied Cryptography— Protocols, Algorithms, and Source Code in C (Second Edition) New York: John Wiley & Sones, 1996 pp. 249-250.
Schneier, “Public Key Algorithms: RSA”, Applied Cryptography—Protocols, Algorithms, and Source Code in C (Second Edition) New York: John Wiley & Sones, 1996 pp. 470.
Brandt et al., “Zero-Knowledge Authentication Scheme with Secret Key Exchange”, Advances in Cyptology—Crypto '88 Proceedings, pp. 583-588, Aug. 21-25, 1988.
Fiat et al., “How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, Advances in Cyptology—Crypto '86 Proceedings, pp. 1806-194, Aug. 11-16, 1986.
Königs, “Cryptographic Identification Methods for Smart Cards in the Process of Standardization”, IEEE Communications Magazine, vol. 29, No. 6, pp. 42-48, Jun. 1991.
Guillou et al., “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory”, Advances in Cryptology—Eurocrypt '88 pp. 123-128, May 25-27, 1988.
Quisquater et al., “Fast Decipherment Algorithm for RSE Public-Key Cryptosystem”, Electronics Letters, vol. 18, No. 21, pp. 905-907, Oct. 14, 1982.
Preliminary Search Report dated Dec. 28, 1999 for FR App. 9900887.
Notice of Reasons for Rejection for Japanese App. 2000-596695 mailed Apr. 23, 2010.
Office Action for JP App. 2000-596695 dated Feb. 24, 2011, including Concise Explanation of Relevance (4 pgs.).
Scheiner, Bruce, Applied Cryptography—Protocvols, Algorithms, and Source Code in C(Second Edition), John Wiley & Sons, Inc(1996): pp. 249-250.
Scheiner, 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-2738288