Sciweavers

FIWAC
1993
139views Cryptology» more  FIWAC 1993»
14 years 3 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
FIWAC
1993
153views Cryptology» more  FIWAC 1993»
14 years 3 months ago
New lower bounds for some spherical designs
A new method for obtaining lower bounds for spherical t-designs is proposed. Applications and new bounds are given for t = 9, 10. Some restrictions on the distribution of the inne...
Peter Boyvalenkov, Svetla Nikova
FIWAC
1993
152views Cryptology» more  FIWAC 1993»
14 years 3 months ago
Disjoint Systems (Extended Abstract)
Systems (Extended Abstract) Noga Alon ∗ Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel A dis...
Noga Alon, Benny Sudakov