Sciweavers

132 search results - page 1 / 27
» Spectral Modular Exponentiation
Sort
View
ARITH
2007
IEEE
13 years 11 months ago
Spectral Modular Exponentiation
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
Gökay Saldamli, Çetin Kaya Koç
CRYPTO
1993
Springer
159views Cryptology» more  CRYPTO 1993»
13 years 8 months ago
Comparison of Three Modular Reduction Functions
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...
Antoon Bosselaers, René Govaerts, Joos Vand...
MOC
2002
92views more  MOC 2002»
13 years 4 months ago
Asymptotic properties of the spectral test, diaphony, and related quantities
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...
Hannes Leeb
IPPS
1999
IEEE
13 years 8 months ago
FPGA Implementation of Modular Exponentiation
An e cient implementations of the main building block in the RSA cryptographic scheme is achieved by mapping a bit-level systolic array for modular exponentiation onto Xilinx FPGAs...
Alexander Tiountchik, Elena Trichina