2967 search results - page 540 / 594 » Cryptology |
PKC
2005
Springer
15 years 3 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
SACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the produ...
SACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
TCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of password-authenticated key exchange (PAK) also known as session-key generation using passwords: constructing session-key generation protocols t...
73
Voted
TCC
2005
Springer
15 years 3 months ago
2005
Springer
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper...