Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
Theoretical Computer Science
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Noise-tolerant learning, the parity problem, and the statistical query model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Finding the closest lattice vector when it's unusually close
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
On polynomial approximation to the shortest lattice vector length
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGACT News
Improved cryptographic hash functions with worst-case/average-case connection
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Security of most significant bits of gx2
Information Processing Letters
Lattice Reduction by Random Sampling and Birthday Methods
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On the Insecurity of a Server-Aided RSA Protocol
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Chinese Remaindering for Algebraic Numbers in a Hidden Field
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Dimension Reduction Methods for Convolution Modular Lattices
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Mathematics of Computation
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Designs, Codes and Cryptography
Polynomial interpolation from multiples
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of the discrete logarithm and Diffie-Hellman problems
Journal of Complexity - Special issue on coding and cryptography
Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Representing hard lattices with O(n log n) bits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
Journal of the ACM (JACM)
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Hardness of Approximating the Closest Vector Problem with Pre-Processing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast LLL-type lattice reduction
Information and Computation
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lattices that admit logarithmic worst-case to average-case connection factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Designs, Codes and Cryptography
Foundations and Trends® in Theoretical Computer Science
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Efficient reductions among lattice problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Jug measuring: Algorithms and complexity
Theoretical Computer Science
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Finding short lattice vectors within mordell's inequality
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On agnostic boosting and parity learning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Cryptanalysis of General Lu-Lee Type Systems
Information Security and Cryptology
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
Explicit Hard Instances of the Shortest Vector Problem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Rigorous and Efficient Short Lattice Vectors Enumeration
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Public Key Encryption Based on Ideal Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast LLL-type lattice reduction
Information and Computation
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Algorithmic problems for metrics on permutation groups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Lattice-based identification schemes secure under active attacks
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
A digital signature scheme based on CV P∞
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Asymptotically efficient lattice-based digital signatures
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Faster exponential time algorithms for the shortest vector problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Accelerating lattice reduction with FPGAs
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Parallel enumeration of shortest lattice vectors
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Adaptively secure identity-based identification from lattices without random oracles
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
An improvement of key generation algorithm for Gentry's homomorphic encryption scheme
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Better key sizes (and attacks) for LWE-based encryption
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Analysis of gauss-sieve for solving the shortest vector problem in lattices
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Lattice reduction algorithms: theory and practice
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Algorithms for the shortest and closest lattice vector problems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Analyzing blockwise lattice algorithms using dynamical systems
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A parallel implementation of GaussSieve for the shortest vector problem in lattices
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Generalized compact knapsacks are collision resistant
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On stern's attack against secret truncated linear congruential generators
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Cryptanalysis of the quadratic generator
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
On ideal lattices and learning with errors over rings
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Lattice enumeration using extreme pruning
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Rankin's constant and blockwise lattice reduction
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
BKZ 2.0: better lattice security estimates
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Secret key leakage from public key perturbation of DLP-Based cryptosystems
Cryptography and Security
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A O(1/ε2)n-time sieving algorithm for approximate integer programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
Sampling methods for shortest vectors, closest vectors and successive minima
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Attribute-based encryption for circuits
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Reusable garbled circuits and succinct functional encryption
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On Ideal Lattices and Learning with Errors over Rings
Journal of the ACM (JACM)
Hi-index | 0.01 |
We present a randomized 2^{O(n)} time algorithm to compute a shortest non-zero vector in an n-dimensional rational lattice. The best known time upper bound for this problem was 2^{O(n\log n)} first given by Kannan [7] in 1983. We obtain several consequences of this algorithm for related problems on lattices and codes, including an improvement for polynomial time approximations to the shortest vector problem. In this improvement we gain a factor of log log n in the exponent of the approximating factor.