Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
1999-07-08
2003-09-02
Hua, Ly V. (Department: 2131)
Cryptography
Particular algorithmic function encoding
Public key
C380S286000, C380S028000, C380S277000, C380S282000, C713S157000, C713S176000, C713S180000, C713S152000
Reexamination Certificate
active
06614909
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to the field of cryptography in general and more particularly to public key cryptosystems.
BACKGROUND OF THE INVENTION
In some conventional public key cryptosystems, two keys may be generated by both a sender and a recipient who wish to communicate securely with each other. In particular, the sender and the recipient may generate a public key that may be known to others and a private key which only the creator may know. For example, in a Revest Shamir Adleman (RSA) cryptosystem each user's public key may be publicly known while each user's private key may be known only to the respective user. To send a secure communication, the sender encrypts a message using the recipient's public key. The recipient decrypts the message using the recipient's private key. Similarly, the roles may be reversed wherein the original recipient may wish to respond to the original sender's message. Accordingly, the original recipient encrypts the response using the original sender's public key and the original sender may decrypt the response using the original sender's private key.
It is known to generate the public and private keys used in a public key cryptosystem based on two large prime numbers. For example, the public key may be generated by multiplying two prime numbers while the private key may be generated by applying modular operations to the public key which may cause the public and private keys to be large (i.e., a large number of bits). For example, the two prime numbers described above may include one hundred bits each. Consequently, the encryption and decryption of messages may involve operations with large numbers which may be time consuming without using a dedicated processor and large registers to store intermediate results during the encryption and decryption process. Unfortunately, a dedicated processor and large registers may occupy relatively large portions of a circuit board and be economically unfeasible. In view of the above, the is a need to improve public key cryptosystems that use large numbers to perform encryption and decryption.
SUMMARY OF THE INVENTION
It is, therefore, an object of the present invention to provide for improvement in the encryption and decryption of communications in public key cryptosystems.
It is another object of the present invention to allow a reduction in the size of registers used to carry out modular operations used in encryption and decryption of communications in public key cryptosystems.
It is a further object of the present invention to allow a reduction in the interconnect used to carry out modular operations used in encryption and decryption of communications in public key cryptosystems.
In still another aspect of the present invention, the first and second data are accessed in an external memory device. The external memory device may comprise a dual port synchronous RAM. Using an external memory device may reduce the need to provide large size registers. For example, a portion of the external memory device may be allocated for storage of intermediate results thereby reducing the need to provide dedicated registers on an integrated circuit board which carries the circuitry used to implement the public key cryptosystem according to the present invention.
REFERENCES:
patent: 5513133 (1996-04-01), Cressel et al.
patent: 5768389 (1998-06-01), Ishii
patent: 6151676 (2000-11-01), Cuccia et al.
patent: 8123670 (1996-03-01), None
Official Action (w/translation) for Korean Patent Application No. 10-1998-0029528 dated Sep. 27, 2000.
Dussé et al., “A Cryptographic Library for the Motorola DSP56000,” Eurocrypt '90: Advances in Cryptology, pp. 230-244, 1991.
Montgomery, P.L., “Modular Multiplication Without Trial Division,” Mathematics of Computation, vol. 44, No. 170, pp. 519-521, Apr. 1985.
Cha Young-tae
Lee Kyung-hee
Ryu Seung-suk
Hua Ly V.
Myers Bigel & Sibley & Sajovec
LandOfFree
Methods, systems, and circuits for generating keys 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 Methods, systems, and circuits for generating keys for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods, systems, and circuits for generating keys for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3047104