Cryptography – Key management – Having particular key generator
Reexamination Certificate
2007-07-24
2007-07-24
Vu, Kim (Department: 2135)
Cryptography
Key management
Having particular key generator
C380S028000, C380S030000, C380S278000, C380S282000, C380S047000, C380S286000
Reexamination Certificate
active
10449371
ABSTRACT:
In a method of determining a pair of numbers comprising a first number and a second number, in which the first number may be a first key and the second number may be a second key of an encryption system and the second number is the multiplicative inverse with respect to a modulus of the first number, said modulus being equal to the product of a first prime number and a second prime number, the first number is selected first. Thereafter, a first sub-number for the second number is computed as a multiplicative inverse of the first number with respect to a first sub-modulus that is equal to the first prime number minus 1 divided by the greatest common divisor of the first prime number minus 1 and the second prime number minus 1. Then, a second sub-number for the second number is computed as multiplicative inverse of the first number with respect to a second sub-modulus that is equal to the second prime number minus 1, with said first sub-modulus and said second sub-modulus being relatively prime. Finally, the second number is determined using the first sub-number and the second sub-number by means of the Chinese remainder theorem. By utilization of the Chinese remainder theorem, the operation of forming the multiplicative inverse is transformed to two corresponding operations with shorter numbers and a fast combination step, so that an acceleration by the factor of 4 is obtained as compared to a method without Chinese remainder theorem.
REFERENCES:
patent: 5046094 (1991-09-01), Kawamura et al.
patent: 5761310 (1998-06-01), Naciri
patent: 5905799 (1999-05-01), Ganesan
patent: 5999627 (1999-12-01), Lee et al.
patent: 6396926 (2002-05-01), Takagi et al.
patent: 6473508 (2002-10-01), Young et al.
patent: 6952476 (2005-10-01), Mao
patent: 7054444 (2006-05-01), Paillier
patent: 7123717 (2006-10-01), Coron et al.
patent: 2001/0036267 (2001-11-01), Paillier
patent: 0 872 795 (1998-10-01), None
patent: 08251155 (1996-09-01), None
Schneier, Bruce: Applied Cryptography, Second Edetion, 1996, pp. 245-251.
Wu et al. RSA Cryptosystem Design Based on the Chinese Remainder Theorem, IEEE, 2001.
Grobschadl, Johann, The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip, Graz University of Technology.
Desmedt, Y. et al.: “Multi-Receiver / Multi-Sender Network Security: Efficient Authenticated Multicast / Feedback”, INFOCOM, IEEE, 1992, pp. 2045-2054.
Menezes, A. J. et al.: Handbook of Applied Cryptography, 8.2 RSA Public-Key Encryption, CRC Press, pp. 285-287.
Menezes, A. J. et al.: Handbook of Applied Cryptography, Chapter 2 Mathematical Background, CRC Press, pp. 68 and 613.
Koc, C. K.: “Montgomery Reduction with Even Modules”, IEEE Proc.-Comput. Digit. Tech., vol. 141, No. 5, Sep. 1994, pp. 314-316.
Grossschädl, J.: “The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip”, IEEE, 2000, pp. 384-393.
Dada Beemnet W
Greenberg Laurence A.
Infineon - Technologies AG
Locher Ralph E.
Stemer Werner H.
LandOfFree
Method of and apparatus for determining a key pair and 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 Method of and apparatus for determining a key pair and for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of and apparatus for determining a key pair and for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3725087