Sciweavers

1769 search results - page 91 / 354
» Cryptography
Sort
View
ENTCS
2006
124views more  ENTCS 2006»
15 years 3 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
IJNSEC
2008
147views more  IJNSEC 2008»
15 years 3 months ago
Constructing Efficient Certificateless Public Key Encryption with Pairing
Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic ser...
Yijuan Shi, Jianhua Li, Jianjun Shi
EUROCRYPT
2009
Springer
16 years 3 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
99
Voted
EUROCRYPT
2005
Springer
15 years 8 months 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...
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
15 years 8 months 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