Sciweavers

77 search results - page 6 / 16
» Public-Key Cryptosystems from Lattice Reduction Problems
Sort
View
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
14 years 20 days ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
COCOON
2010
Springer
14 years 8 days ago
Identity-Based Authenticated Asymmetric Group Key Agreement Protocol
In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key crypt...
Lei Zhang, Qianhong Wu, Bo Qin, Josep Domingo-Ferr...
LATINCRYPT
2010
13 years 5 months ago
A Lattice-Based Threshold Ring Signature Scheme
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
WCC
2005
Springer
172views Cryptology» more  WCC 2005»
14 years 29 days ago
Dimension of the Linearization Equations of the Matsumoto-Imai Cryptosystems
Abstract. The Matsumoto-Imai (MI) cryptosystem was the first multivariate public key cryptosystem proposed for practical use. Though MI is now considered insecure due to Patarin...
Adama Diene, Jintai Ding, Jason E. Gower, Timothy ...
ASIACRYPT
2001
Springer
13 years 12 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...