AFRICACRYPT
2009
Springer
13 years 2 months ago
2009
Springer
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large integer modular exponentiation, the core of public-ke...
JUCS
2010
13 years 2 months ago
2010
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
INFORMATICALT
2006
13 years 4 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
CHES
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper proposes new chosen-message power-analysis attacks against public-key cryptosystems based on modular exponentiation, which use specific input pairs to generate...
CRYPTO
1993
Springer
13 years 8 months ago
1993
Springer
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...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
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...
CHES
2003
Springer
13 years 9 months ago
2003
Springer
The recent developments of side channel attacks have lead implementers to use more and more sophisticated countermeasures in critical operations such as modular exponentiation, or ...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
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...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
ITCC
2005
IEEE
13 years 10 months ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...