Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2005-07-05
2005-07-05
Morse, Gregory (Department: 2134)
Cryptography
Particular algorithmic function encoding
C708S530000, C380S028000
Reexamination Certificate
active
06914983
ABSTRACT:
The modular exponentiation function used in public key encryption and decryption systems is implemented in a standalone engine having at its core modular multiplication circuits which operate in two phases which share overlapping hardware structures. The partitioning of large arrays in the hardware structure, for multiplication and addition, into smaller structures results in a multiplier design comprising a series of nearly identical processing elements linked together in a chained fashion. As a result of the two-phase operation and the chaining together of partitioned processing elements, the overall structure is operable in a pipelined fashion to improve throughput and speed. The chained processing elements are constructed so as to provide a partitionable chain with separate parts for processing factors of the modulus. In this mode, the system is particularly useful for exploiting characteristics of the Chinese Remainder Theorem to perform rapid exponentiation operations. A checksum mechanism is also provided to insure accurate operation without impacting speed and without significantly increasing complexity. While the present disclosure is directed to a complex system which includes a number of features, the present application is particularly directed a system and method for performing modular checksum operations.
REFERENCES:
patent: 5321752 (1994-06-01), Iwamura et al.
patent: 5513133 (1996-04-01), Cressel et al.
patent: 5764554 (1998-06-01), Monier
patent: 6182104 (2001-01-01), Foster et al.
Menezes et al., “Handbook of Applied Cryptography”, CRC press, Revised, Section 14.3-14.41.
Koc et al, “Analyzing and Comparing Montgomery Multiplication Algorithms”, IEEE 1996, pp. 26-33.
Kornerup, Peter, “A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms,” IEEE Transactions on Computers, vol. 43, No. 8, Aug., 1994, pp 892-898.
Chen Chin-Long
Condorelli Vincenzo
Fayad Camil
Cutter Lawrence D.
Ho Thomas
International Business Machines - Corporation
Morse Gregory
LandOfFree
Method for checking modular multiplication 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 for checking modular multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for checking modular multiplication will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3412639