Sciweavers

79 search results - page 2 / 16
» FPGA Implementation of Modular Exponentiation
Sort
View
FPL
2005
Springer
127views Hardware» more  FPL 2005»
13 years 10 months ago
Efficient Hardware Architectures for Modular Multiplication on FPGAs
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
David Narh Amanor, Viktor Bunimov, Christof Paar, ...
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
13 years 11 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
CRYPTO
1993
Springer
159views Cryptology» more  CRYPTO 1993»
13 years 9 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...
IPPS
2003
IEEE
13 years 10 months ago
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
Siddika Berna Örs, Lejla Batina, Bart Preneel...
FPGA
2009
ACM
273views FPGA» more  FPGA 2009»
13 years 11 months ago
A parallel/vectorized double-precision exponential core to accelerate computational science applications
Many natural processes exhibit exponential decay and, consequently, computational scientists make extensive use of e−x in computer simulation experiments. While it is common to ...
Robin Pottathuparambil, Ron Sass