28 search results - page 2 / 6 » A Generalized Wiener Attack on RSA |
105
click to vote
ACNS
2007
Springer
15 years 5 months ago
2007
Springer
In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since IntegerFactorization is difficult, p and q are simply esti...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
110
click to vote
PKC
2005
Springer
15 years 5 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...
148
click to vote
ICICS
2010
Springer
14 years 9 months ago
2010
Springer
In this work we examine a number of different open source implementations of the RSA Optimal Asymmetric Encryption Padding (OAEP) and generally RSA with respect to the message-aime...
103
click to vote
CCS
2004
ACM
15 years 5 months ago
2004
ACM
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...