Sciweavers

PKC
2005
Springer
192views Cryptology» more  PKC 2005»
15 years 2 months ago
Securing RSA-KEM via the AES
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...
Jakob Jonsson, Matthew J. B. Robshaw
PKC
2005
Springer
167views Cryptology» more  PKC 2005»
15 years 2 months ago
Converse Results to the Wiener Attack on RSA
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef...
PKC
2005
Springer
156views Cryptology» more  PKC 2005»
15 years 2 months ago
Cryptanalysis of HFEv and Internal Perturbation of HFE
Hidden field equation (HFE) multivariable cryptosystems were first suggested by Patarin. Kipnis and Shamir showed that to make the cryptosystem secure, a special parameter D of a...
Jintai Ding, Dieter Schmidt
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
15 years 2 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
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...
Hung-Min Sun, Cheng-Ta Yang
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
15 years 2 months ago
Breaking a Cryptographic Protocol with Pseudoprimes
The Miller-Rabin pseudo primality test is widely used in cryptographic libraries, because of its apparent simplicity. But the test is not always correctly implemented. For example ...
Daniel Bleichenbacher
Cryptology
Top of PageReset Settings