Extending the range of computational fields of integers

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C380S028000, C380S046000, C708S490000, C708S491000, C708S492000

Reexamination Certificate

active

07904719

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: 5065429 (1991-11-01), Lang
patent: 5073870 (1991-12-01), Morita
patent: 5144574 (1992-09-01), Morita
patent: 5440634 (1995-08-01), Jones et al.
patent: 5544246 (1996-08-01), Mandelbaum et al.
patent: 5754654 (1998-05-01), Hiroya et al.
patent: 5991747 (1999-11-01), Tomoyuki et al.
patent: 6185596 (2001-02-01), Hadad et al.
patent: 6249869 (2001-06-01), Drupsteen et al.
patent: 6366940 (2002-04-01), Ono et al.
patent: 6553351 (2003-04-01), De Jong et al.
patent: 0 502 782 (1992-09-01), None
patent: 0601907 (1994-06-01), None
patent: 2321979 (1998-08-01), None
patent: WO 98/48345 (1998-10-01), None
patent: 9850851 (1998-11-01), None
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.
H. Orup, “Simplifying quotient determination in high-radix modular multiplication”, Computer Arithmetic, 1995, Proc. of the 12th Symposium on Bath, UK Jul. 19-21, 1995, IEEE Comput. Soc, US pp. 193-199.
Walter C D, “Systolic Modular Multiplication”, IEEE Trans on Computes, IEEE Service Center, Los Alamitos CA, US, vol. 42, No. 3, Mar. 1, 1993, pp. 376-378.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

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

     

Profile ID: LFUS-PAI-O-2693998

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.