Extending the range of computational fields of integers

Details Extending the range of computational fields of integers Extending the range of computational fields of integers

2006-09-19

2006-09-19

Arani, Taghi (Department: 2131)

Electrical computers and digital processing systems: support

Multiple computer communication using cryptography

Particular communication authentication technique

C380S028000, C380S046000, C708S200000, C708S490000, C708S491000, C708S503000, C708S523000, C708S629000, C708S670000, C708S800000

Reexamination Certificate

active

07111166

ABSTRACT:
An extension of the serial/parallel Montgomery modular multiplication method with simultaneous reduction as previously implemented by the applicants, adapted innovatively to perform both in the prime number and in the GF(2q) polynomial based number field, in such a way as to simplify the flow of operands, by performing a multiple anticipatory function to enhance the previous modular multiplication procedures.

REFERENCES:
patent: 4587627 (1986-05-01), Omura et al.
patent: 4745568 (1988-05-01), Onyszchuk et al.
patent: 5065429 (1991-11-01), Lang
patent: 5073870 (1991-12-01), Morita
patent: 5144574 (1992-09-01), Morita
patent: 5206824 (1993-04-01), Arazi
patent: 5261001 (1993-11-01), Dariel et al.
patent: 5448639 (1995-09-01), Arazi
patent: 5499299 (1996-03-01), Takenaka et al.
patent: 5513133 (1996-04-01), Cressel et al.
patent: 5544246 (1996-08-01), Mandelbaum et al.
patent: 5742530 (1998-04-01), Gressel et al.
patent: 6185596 (2001-02-01), Hadad et al.
patent: 6249869 (2001-06-01), Drupsteen et al.
patent: 0 502 782 (1992-09-01), None
patent: WO 98/48345 (1998-10-01), None
patent: WO 98/50851 (1998-11-01), None
C. Parr et al., “Fast Arithmetic for Public-Key Algorithms in Galois fields with Composite Exponents”,IEEE Transactions on Computers, vol. 48, No. 10, Oct. 1999.
W. Wesley Peterson et al.,Error-Correcting Codes, 2ndEdition, MIT Press, Cambridge, MA, 1972, pp. 174-179.
Lecture by Marco Bucci of the Fondazione Ugo Bordoni, Eurocrypt Conference Rump Session, Perugia, Italy, 1994.
The ST19-CF58 Device, produced by STMicroelectronics, Rousset, France.
D. Knuth,The Art of Computer Programming, vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981.
On May 16, 2001, an announcement was made at site www.security.ece.orst.edu of an U.S. Patent Application, filed on Feb. 29, 2000, entitled: A Scalable and Unified Multiplier for Finite Fields.

Affiliated with

Also associated with

Rating

Extending the range of computational fields of integers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Extending the range of computational fields of integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extending the range of computational fields of integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3577782