Sciweavers

8 search results - page 1 / 2
» Simple Backdoors for RSA Key Generation
Sort
View
CTRSA
2003
Springer
120views Cryptology» more  CTRSA 2003»
13 years 10 months ago
Simple Backdoors for RSA Key Generation
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...
Claude Crépeau, Alain Slakmon
ASIACRYPT
2006
Springer
13 years 9 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
13 years 11 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
13 years 9 months ago
Fast Generation of Prime Numbers on Portable Devices: An Update
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
Marc Joye, Pascal Paillier
FPL
2008
Springer
157views Hardware» more  FPL 2008»
13 years 6 months ago
Chosen-message SPA attacks against FPGA-based RSA hardware implementations
This paper presents SPA (Simple Power Analysis) attacks against public-key cryptosystems implemented on an FPGA platform. The SPA attack investigates a power waveform generated by...
Atsushi Miyamoto, Naofumi Homma, Takafumi Aoki, Ak...