Sciweavers

2967 search results - page 167 / 594
» Cryptology
Sort
View
EUROCRYPT
2009
Springer
16 years 7 months ago
Practical Chosen Ciphertext Secure Encryption from Factoring
We propose a practical public-key encryption scheme whose security against chosen-ciphertext attacks can be reduced in the standard model to the assumption that factoring is intrac...
Dennis Hofheinz, Eike Kiltz
FC
2007
Springer
128views Cryptology» more  FC 2007»
16 years 1 months ago
On Authentication with HMAC and Non-random Properties
Abstract. MAC algorithms can provide cryptographically secure authentication services. One of the most popular algorithms in commercial appli
Christian Rechberger, Vincent Rijmen
EUROCRYPT
2005
Springer
16 years 20 days ago
Collisions of SHA-0 and Reduced SHA-1
In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and introduce the first results on SHA
Eli Biham, Rafi Chen, Antoine Joux, Patrick Carrib...
IMA
2005
Springer
113views Cryptology» more  IMA 2005»
16 years 20 days ago
Exploiting Coding Theory for Collision Attacks on SHA-1
In this article we show that coding theory can be exploited efficiently for the cryptanalysis of hash functions. We will mainly focus
Norbert Pramstaller, Christian Rechberger, Vincent...
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
16 years 19 days ago
Breaking a Cryptographic Protocol with Pseudoprimes
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 ...
Daniel Bleichenbacher