Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2006-03-31
2011-12-06
Malzahn, David H (Department: 2193)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
08073891
ABSTRACT:
Device for implementing modular multiplication, characterized in that it comprises at least one computation cell comprising a multiplier-adder comprising p pipelined logic-register pairs, receiving several digits to be added together and multiplied, at least two outputs corresponding to the low order and to the high order, an adder receiving the two outputs of the multiplier-adder, the number p being chosen in such a way that the maximum frequency of the multiplier-adder is greater than or equal to the maximum frequency of the adder.
REFERENCES:
patent: 5133069 (1992-07-01), Asato et al.
patent: 6804696 (2004-10-01), Chen et al.
patent: 7805479 (2010-09-01), Moshier et al.
patent: 2002/0116430 (2002-08-01), Chen et al.
patent: 2002/0194237 (2002-12-01), Takahashi et al.
patent: 2004/0267855 (2004-12-01), Shantz et al.
patent: 2005/0033790 (2005-02-01), Hubert
patent: 2007/0233769 (2007-10-01), Moshier et al.
patent: 2009/0086961 (2009-04-01), Sauzet et al.
patent: 2009/0089350 (2009-04-01), Sauzet et al.
patent: 2010/0235414 (2010-09-01), Huang et al.
Peter Kornerup: “A systolic, linear-array multiplier for a class of right-shift algorithms”; IEEE Transactions on Computers 43 (1994), No. 8, 892-898.
L-S Didier, J-C Bajard and P. Kornerup: “An RNS Montgomery multiplication Algorithm, Proceedings of ARITH13”; IEEE Computer Society, 1997, pp. 234-239.
Alexandre F. Tenca and Cetin K. Koc: “A scalable architecture for Montgomery multiplication”; CHES'99, 1999.
Alexandre F. Tenca and Cetin K. Koc: “A scalable architecture for Modular Multiplication based on Montgomery's Algorithm”; IEEE Transactions on computers 52 (2003), No. 9.
Alexandre F. Tenca, Cetin K. Koc and Erkay Savas: “A scalable and unified multiplier architecture for finite field GF (p) and GF (2n)”; CHES'00 2000.
Alexandre F. Tenca, Georgi Todorov and Cetin K. Koc: “High-Radix Design of a scalable modular multiplier”; CHES'01, vol. LNCS 2162, 2001, pp. 185-201.
Gunnar Gaubatz: “Versatile Montgomery Multiplier Architectures”; PhD thesis, Worcester Polytechnic Institute, Apr. 2002.
Bernard Florent
Garrido Eric
Sauzet Alain
Lowe Hauptman & Ham & Berner, LLP
Malzahn David H
Thales
LandOfFree
Method for implementing montgomery 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 implementing montgomery modular multiplication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for implementing montgomery modular multiplication... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4315537