Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Improved low-density subset sum algorithms
Computational Complexity
Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
Lattice Reduction by Random Sampling and Birthday Methods
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Perspectives for cryptographic long-term security
Communications of the ACM - Privacy and security in highly dynamic systems
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Random sampling for short lattice vectors on graphics cards
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
We propose Simple Sampling Reduction (SSR) that makes Schnorr’s Random Sampling Reduction (RSR) practical. We also introduce generalizations of SSR that yield bases with several short basis vectors and that, in combination, generate shorter basis vectors than SSR alone. Furthermore, we give a formula for Pr[||v||2 ≤x] provided v is randomly sampled from SSR’s search space. We describe two algorithms that estimate the probability that a further SSR iteration will find an even shorter vector, one algorithm based on our formula for Pr[||v||2 ≤x], the other based on the approach of Schnorr’s RSR analysis. Finally, we report on some cryptographic applications.