Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2007-02-06
2007-02-06
Zand, Kambiz (Department: 2132)
Cryptography
Particular algorithmic function encoding
C380S029000, C380S030000
Reexamination Certificate
active
10134045
ABSTRACT:
Methods and apparatus for Montgomery multiplication process a multiplier operand in k-bit radix-digits, wherein k corresponds to a radix r=2k. A multiplicand operand and a modulus are processed word by word, and then additional bits of the multiplier operand are selected for processing. In a radix r=8 example, the multiplier operand is processed in 3 bit radix-8 digits. A processing kernel is configured to preprocess the modulus and/or the multiplier operand so that at least some values can be obtained from lookup tables.
REFERENCES:
Koc et al. “Analyzing and Comparing Montgomery Multiplication Algorithms.”IEEE Micro(1996):26-33.
Tenca et al. “A Scalable Architecture for Montgomery Multiplication.” Cryptographic Hardware and Embedded Systems No. 1717 (1999): 94-108.
Koç Çetin K.
Tenca Alexandre F.
Todorov Georgi
Klarquist & Sparkman, LLP
Perungavoor Venkat
State of Oregon Acting by and Through the State Board of Higher
Zand Kambiz
LandOfFree
Methods and apparatus for variable radix scalable modular... 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 and apparatus for variable radix scalable modular..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for variable radix scalable modular... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3891763