77 search results - page 2 / 16 » Public-Key Cryptosystems from Lattice Reduction Problems |
BIRTHDAY
2012
Springer
12 years 18 days ago
2012
Springer
Finding efficient countermeasures for cryptosystems against fault attacks is challenged by a constant discovery of flaws in designs. Even elements, such as public keys, that do no...
INFORMATICALT
2010
13 years 2 months ago
2010
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptograp...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However, between the efficiency of RSA and the security of...
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
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 ...
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...