5 search results - page 1 / 1 » On the Design of RSA with Short Secret Exponent |
ASIACRYPT
1999
Springer
13 years 10 months ago
1999
Springer
ASIACRYPT
2000
Springer
13 years 10 months ago
2000
Springer
At Asiacrypt ’99, Sun, Yang and Laih proposed three RSA variants with short secret exponent that resisted all known attacks, including the recent Boneh-Durfee attack from Eurocry...
PKC
2005
Springer
13 years 11 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...
IACR
2011
12 years 5 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
CTRSA
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...