93 search results - page 2 / 19 » Applications of The Montgomery Exponent |
ISVLSI
2002
IEEE
13 years 10 months ago
2002
IEEE
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montg...
FPL
2010
Springer
13 years 3 months ago
2010
Springer
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
ISCAS
1999
IEEE
13 years 9 months ago
1999
IEEE
Ideal power converters are governed by differential equations with discontinuous right-hand sides. General-purpose algorithms to compute their Lyapunov exponents assume smooth equ...