7 search results - page 1 / 2 » Moduli for Testing Implementations of the RSA Cryptosystem |
ARITH
1999
IEEE
13 years 9 months ago
1999
IEEE
Comprehensive testing of any implementation of the RSA cryptosystem requires the use of a number of moduli with specific properties. It is shown how to generate a sufficient varie...
ICCD
2006
IEEE
14 years 1 months ago
2006
IEEE
— High secure cryptographic systems require large bit-length encryption keys which presents a challenge to their efficient hardware implementation especially in embedded devices...
TC
2010
12 years 11 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
IJNSEC
2008
13 years 5 months ago
2008
The study of countermeasures for hardware fault attack in multi-prime RSA cryptosystems is very important for applications such as computer network and smart cards. In this paper,...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
Since the remarkable work of Kocher [7], several papers considering different types of timing attacks have been published. In 2003, Brumley and Boneh presented a timing attack on...