Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2002-03-25
2003-12-30
Mai, Tan V. (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
06671709
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates, in general, to public-key cryptography and, more particularly, to a public-key cryptographic integrated circuit.
Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) are public-key cryptographic algorithms that provide high security for digital data transfers between electronic devices. The modular mathematics of the RSA and ECC (Fp) algorithms can be computed on a hardware multiplier and the polynomial mathematics of the ECC (F2
M
in polynomial-basis) algorithm can be computed on a different hardware multiplier. Both hardware multiplier architectures that are used for computing the RSA and ECC algorithms can use pipelining techniques for the massive parallel computations of the algorithms. The pipelined multiplier offers lower power which is required for many applications.
Hardware implementations for computing RSA and ECC algorithms is not straight forward. Thus, the type of cryptography best suited for the system application defines the appropriate hardware multiplier architecture that computes the desired RSA or ECC algorithms. With increasing demand for faster cryptographic operations and higher performance, hardware modular multiplier architecture improvements are needed to ensure high levels of security.
Accordingly, it would be advantageous to provide cryptography in a multiplication system that achieves high performance, low cost, and low-power for implementation in an integrated circuit. It would be a further advantage for the multiplication system to compute the RSA and ECC algorithms.
REFERENCES:
patent: 4707800 (1987-11-01), Montrone et al.
patent: 4994997 (1991-02-01), Martin et al.
patent: 5010511 (1991-04-01), Hartley et al.
patent: 5189636 (1993-02-01), Patti et al.
patent: 5262975 (1993-11-01), Ohki
patent: 5511018 (1996-04-01), Wittmann et al.
patent: 5636351 (1997-06-01), Lee
patent: 5724276 (1998-03-01), Rose et al.
patent: 6049815 (2000-04-01), Lambert et al.
patent: 6175941 (2001-01-01), Poeppelman et al.
patent: 6349318 (2002-02-01), Vanstone et al.
patent: 6356636 (2002-03-01), Foster et al.
Glaser Philipp Michael
Torla Michael J.
Mai Tan V.
Motorola Inc.
LandOfFree
Multiplier cell and method of computing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multiplier cell and method of computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiplier cell and method of computing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3129565