Computing short vectors in lattices

"Computing short vectors in lattices" is Daniel J. Bernstein's doctoral thesis, focusing on algorithms and complexity issues related to finding short vectors in mathematical lattices, a central problem in computational number theory and cryptography.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.