Sciweavers

FIWAC
1993
139views Cryptology» more  FIWAC 1993»
13 years 9 months ago
Montgomery-Suitable Cryptosystems
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
David Naccache, David M'Raïhi