Cryptography – Particular algorithmic function encoding – Public key
Patent
1991-12-06
1993-12-28
Swann, Tod R.
Cryptography
Particular algorithmic function encoding
Public key
380 28, 380 50, H04K 100
Patent
active
052747077
ABSTRACT:
A device for applying modular arithmetic exponentiation and reduction to an input message, and method. The device includes a partial array multiplier and an array subtracter, but requires no divider unless the modulus is changed. The intermediate results are only approximate but a correction technique makes the output signal exact.
REFERENCES:
patent: 4027147 (1977-05-01), Majos et al.
patent: 4594678 (1986-06-01), Uhlenhoff
patent: 4736423 (1988-04-01), Matyas
patent: 4870681 (1989-09-01), Sedlak
patent: 4891781 (1990-01-01), Omura
patent: 5073870 (1991-12-01), Morita
patent: 5121429 (1992-06-01), Guppy et al.
patent: 5159632 (1992-10-01), Crandall
patent: 5166978 (1992-11-01), Quisquater
J. Nehvatal; "Computer Security, Public-key Cryptography"; NIST Special Publication 800-2, U.S. Printing Office, Apr. 1991.
"The art of Computer Programming"; vol. 2, Seminumerical Algorithms; Donald Knuth; Addison-Wesley, 1981.
"Optimized Software Implementations of the Modular Exponentiation on General Purpose Microprocessors"; D. Bong et al; Computer & Security vol. 8, 1989.
LandOfFree
Modular exponentiation and reduction device and method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Modular exponentiation and reduction device and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular exponentiation and reduction device and method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1549645