Sciweavers

IACR
2011
141views more  IACR 2011»
14 years 6 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
IACR
2011
166views more  IACR 2011»
14 years 6 months ago
Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
Dmitry Khovratovich, Christian Rechberger, Alexand...
IACR
2011
221views more  IACR 2011»
14 years 6 months ago
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
Süleyman Kardas, Mehmet Sabir Kiraz, Muhammed...
IACR
2011
114views more  IACR 2011»
14 years 6 months ago
Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three
Abstract. This paper proposes new explicit formulae for the point doubling, tripling and addition on ordinary Weierstrass elliptic curves with a point of order 3 over finite fiel...
Hongfeng Wu, Changan Zhao
IACR
2011
115views more  IACR 2011»
14 years 6 months ago
Threshold Encryption into Multiple Ciphertexts
We propose (T, N) multi-ciphertext scheme for symmetric encryption. The scheme encrypts a message into N distinct ciphertexts. The knowledge of the symmetric key allows decryption ...
Martin Stanek