27 search results - page 5 / 6 » High-radix modular multiplication for cryptosystems |
JUCS
2010
13 years 5 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...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...
CHES
2008
Springer
13 years 9 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...
CHES
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and c...
TCC
2005
Springer
14 years 29 days 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...