Sciweavers

117 search results - page 2 / 24
» Why Cryptosystems Fail
Sort
View
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
A Chosen-Ciphertext Attack against NTRU
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
Éliane Jaulmes, Antoine Joux
ICICS
1997
Springer
13 years 9 months ago
Efficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
Atsuko Miyaji, Takatoshi Ono, Henri Cohen
CRYPTO
1997
Springer
108views Cryptology» more  CRYPTO 1997»
13 years 9 months ago
Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack
: The McEliece public-key cryptosystem fails to protect any message which is sent to a recipient more than once using different random error vectors. In general, it fails to protec...
Thomas A. Berson
IJBC
2006
93views more  IJBC 2006»
13 years 5 months ago
Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems
In recent years, a large amount of work on chaos-based cryptosystems have been published. However many of the proposed schemes fail to explain or do not possess a number of featur...
Gonzalo Álvarez, Shujun Li