Method for the implementation of modular reduction according to

Details Method for the implementation of modular reduction according to Method for the implementation of modular reduction according to

1995-11-07

1998-06-09

Malzahn, David H.

Boots, shoes, and leggings

G06F 772

Patent

active

057645540

ABSTRACT:
A method for implementing modular reduction according to the Montgomery method, wherein a binary data element C is encoded on a number c of bits, grouped together in m' words of k bits, with m' and k as integers, m' being such that m'*k>c>(m'-1)*k, a non-zero binary data element N is encoded on a number n of bits. According to the disclosed method, to produce C mod N, steps are carried out for the production of a binary data element J0, associated with N, the production of at least one binary data element H having the form 2.sup.f(C,N), with f(C,N) as an integer representing the size of C and the parity of N, and the providing firstly of C, at the parallel input of a multiplication circuit having one serial input, one parallel input and one serial output, and secondly of H at the serial input of this same multiplication circuit.

REFERENCES:
patent: 5144574 (1992-09-01), Morita
patent: 5513133 (1996-04-01), Cressel et al.
patent: 5572454 (1996-11-01), Lee et al.
IEE Proceedings E Computers & Digital Techniques, vol. 141, No. 5, Sep. 1994, Stevenage GB, pp. 314-316 KOC.

Affiliated with

Also associated with

Rating

Method for the implementation of modular reduction according to 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 the implementation of modular reduction according to , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for the implementation of modular reduction according to will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2209153