Cryptographic system, method and multiplier

Details Cryptographic system, method and multiplier Cryptographic system, method and multiplier

2005-12-30

2011-12-06

Bullock, Jr., Lewis (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

C708S603000, C708S627000

Reexamination Certificate

active

08073892

ABSTRACT:
In general, in one aspect, the disclosure describes a multiplier that includes a set of multiple multipliers configured in parallel where the set of multiple multipliers have access to a first operand and a second operand to multiply, the first operand having multiple segments and the second operand having multiple segments. The multiplier also includes logic to repeatedly supply a single segment of the second operand to each multiplier of the set of multiple multipliers and to supply multiple respective segments of the first operand to the respective ones of the set of multiple multipliers until each segment of the second operand has been supplied with each segment of the first operand. The logic shifts the output of different ones of the set of multiple multipliers based, at least in part, on the position of the respective segments within the first operand. The multiplier also includes an accumulator coupled to the logic.

REFERENCES:
patent: 3515344 (1970-06-01), Goldschmidt et al.
patent: 4546446 (1985-10-01), Machida
patent: 4594679 (1986-06-01), George et al.
patent: 4775951 (1988-10-01), Iwahashi et al.
patent: 4811269 (1989-03-01), Hirose et al.
patent: 5073870 (1991-12-01), Morita
patent: 5150322 (1992-09-01), Smith et al.
patent: 5524090 (1996-06-01), Iwamura
patent: 5892699 (1999-04-01), Duncan et al.
patent: 6035316 (2000-03-01), Peleg et al.
patent: 6182233 (2001-01-01), Schuster et al.
patent: 6711602 (2004-03-01), Bhandal et al.
patent: 7266580 (2007-09-01), Busaba et al.
patent: 7373368 (2008-05-01), Rarick et al.
patent: 2003/0065699 (2003-04-01), Burns
patent: 2005/0138366 (2005-06-01), Burres et al.
patent: 2005/0138368 (2005-06-01), Burres et al.
patent: 2005/0141715 (2005-06-01), Chen-Chi et al.
patent: 2005/0144211 (2005-06-01), Simkins et al.
patent: 2005/0149725 (2005-07-01), Burres et al.
patent: 2005/0149744 (2005-07-01), Burres et al.
patent: 2005/0154960 (2005-07-01), Koshy et al.
patent: 2005/0198093 (2005-09-01), Son
patent: 2005/0238166 (2005-10-01), Koshy et al.
patent: 2005/0240764 (2005-10-01), Koshy et al.
patent: 2006/0010327 (2006-01-01), Koshy et al.
patent: 2006/0059219 (2006-03-01), Koshy
patent: 2006/0059220 (2006-03-01), Koshy et al.
patent: 2007/0061392 (2007-03-01), Gerwig et al.
patent: 2009/0037508 (2009-02-01), Bernard et al.
patent: 1410880 (2003-04-01), None
patent: 04216126 (1992-08-01), None
patent: 2007078939 (2007-07-01), None
patent: WO 2007/078939 (2007-11-01), None
Analysis of Sliding Window Techniques for Exponentiation, C. Koc, 1995, 17-24.
Modular Exponentiation using Parallel Multipliers, S. Tang, 2003, 1-8.
Optimized Squaring with Sliding Windows, B. Phillips and N. Burgess, 2000, 130-133.
Improved Approach to the Use of Booth's Multiplication Algorithm, Apr. 1, 1985, IBM Technical Disclosure Bulletin, vol. 27 Issue 11, pp. 6624-6632.
Erle, et al.: Decimal Multiplication with Efficient Partial Product Generation, Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH'05); 2005; 8 pages.
Feghali, et al.: Security: Adding Protection to the Network via the Network Processor, Intel Technology Journal, vol. 06, No. 3; Aug. 15, 2002; ISSN 1535766X; 10 pages.
Halbutogullari, et al.: Parallel Multiplication in GF (2k) Using Polynomial Residue Arithmetic, Designs, Codes and Cryptography, vol. 20, No. 2; pp. 155-173; Jun. 2000; 15 pages.
Harris, et al.: An Improved Unified Scalable Radix-2 Montgomery Multiplier, Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH'05); 2005; 8 pages.
Walters, III, et al.: Efficient Function Approximation Using Truncated Multipliers and Squarers, Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH'05); 2005; 8 pages.
Dadda L., et al., “Digital Multipliers: A Unified Approach”, Alta Frequenza, Ufficio Centrale AEI-CEI, Milano IT., vol. 37, No. 11, Nov. 11, 1968, XP007901375, pp. 1079-1086.
International Search Report and Written Opinion, International Application No. PCT/US2006/048417, mailed Aug. 8, 2007, 31 pages.
International Search Report and written opinion for PCT Patent Application No. PCT/US2006/048417, mailed on Aug. 21, 2007, pp. 31.
Office Action received for CN Patent Application No. 200610130999.7 mailed on Mar. 6, 2009, pp. 6 and English translation of 12 pages.
International Preliminary Report on Patentability for PCT Patent Application No. PCT/US2006/048417, mailed on Jul. 10, 2008, 8 Pages.
Office Action received for Chinese Patent Application No. 200610130999.7, mailed on Mar. 15, 2010, 8 pages of Office Action and English translation of 13 pages.
Office Action received for European Patent Application No. 06845803.3, mailed on Jul. 16, 2009, 2 Pages.

Affiliated with

Also associated with

Rating

Cryptographic system, method and multiplier does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cryptographic system, method and multiplier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic system, method and multiplier will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4314406