Sciweavers

183 search results - page 20 / 37
» The State of Cryptographic Hash Functions
Sort
View
ACISP
2009
Springer
13 years 11 months ago
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
Ahto Buldas, Aivo Jürgenson, Margus Niitsoo
ASIACRYPT
2000
Springer
13 years 12 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson
FSE
2009
Springer
125views Cryptology» more  FSE 2009»
14 years 8 months ago
On the Security of Tandem-DM
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
FSE
2007
Springer
101views Cryptology» more  FSE 2007»
14 years 1 months ago
Producing Collisions for Panama, Instantaneously
We present a practical attack on the Panama hash function that generates a collision in 26 evaluations of the state updating function. Our attack improves that of Rijmen and cowork...
Joan Daemen, Gilles Van Assche
COMPUTER
2007
123views more  COMPUTER 2007»
13 years 7 months ago
Cryptography on a Speck of Dust
Ubiquitous computing has become a reality in recent years. Tiny wireless sensors and RFID tags are being deployed today and will soon form an important aspect of our infrastructur...
Jens-Peter Kaps, Gunnar Gaubatz, Berk Sunar