152
click to vote
PKC
15 years 10 months ago
2005 Springer 
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...
133
click to vote
PKC
15 years 10 months ago
2005 Springer 
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-...
150
click to vote
PKC
15 years 10 months ago
2005 Springer 
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...
152
click to vote
PKC
15 years 10 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...
109
Voted
PKC
15 years 10 months ago
2005 Springer
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 ...
|
Cryptology