On the probability of generating a lattice

DOI10.1016/j.jsc.2013.12.002zbMath1287.11085arXiv1211.6246OpenAlexW2080635344MaRDI QIDQ2437315

Felix Fontein, Paweł Wocjan

Publication date: 3 March 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.6246

zbMATH Keywords

Riemann zeta functiondiscrete logarithm problemanalysis of quantum algorithmRandom generation of a lattice

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (1)

Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Natural density of rectangular unimodular integer matrices
• The probability of choosing primitive sets
• A key-exchange protocol using real quadratic fields
• The infrastructure of a global field of arbitrary unit rank
• Trapdoors for hard lattices and new cryptographic constructions
• Fast quantum algorithms for computing the unit group and class group of a number field
• Polynomial time quantum algorithm for the computation of the unit group of a number field
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Generalization of a theorem of Siegel
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
• The expected number of random elements to generate a finite Abelian group

This page was built for publication: On the probability of generating a lattice