Skip to main content

Lattice

  • Reference work entry
  • 253 Accesses

Synonyms

Euclidean lattice; Geometry of numbers

Related Concepts

Closest Vector Problem; Lattice Reduction; Lattice-Based Cryptography; Shortest Vector Problem

Definition

In mathematics, the term lattice is used for two very different kinds of objects, arising, respectively, in order theory and number theory. Here, lattice always means a number-theoretical lattice. Informally speaking, a lattice is a regular infinite arrangement of points in n-dimensional space. More formally, a lattice is a discrete subgroup of \({\mathbb{R}}^{n}\).

Background

Lattices appeared in the nineteenth century in both crystallography and number theory. But in some sense, their study goes back to that of quadratic forms: Gauss [3] made a connection between quadratic forms and lattices, which was further developed by Dirichlet [2] and especially Minkowski [7]. Lattice theory is usually called geometry of numbers [1510], a name due to Minkowski [7].

Theory

A lattice can be defined in many equivalent ways....

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Cassels JWS (1971) An introduction to the geometry of numbers. Springer, Berlin

    MATH  Google Scholar 

  2. Dirichlet JPGL (1850) Über die Reduction der positiven quadratischen Formen in drei unbestimmten ganzen Zahlen. J Reine Angew Math 40:209–227

    Article  MATH  Google Scholar 

  3. Gauss CF (1840) Recension der “Untersuchungen über die Eigenschaften der positiven ternären quadratischen Formen von Ludwig August Seeber.” Göttingische Gelehrte Anzeigen, July 9, 1065ff, 1831. Repr. J Reine Angew Math 20:312–320. http://gdz.sub.uni-goettingen.de/dms/load/toc/?PPN=PPN23599524X&DMDID=dmdlog22

  4. Grötschel M, Lovász L, Schrijver A (1993) Geometric algorithms and combinatorial optimization. Springer, Berlin

    Book  MATH  Google Scholar 

  5. Gruber M, Lekkerkerker CG (1987) Geometry of numbers. North-Holland, Groningen

    MATH  Google Scholar 

  6. Micciancio D, Goldwasser S (2002) Complexity of lattice problems: a cryptographic perspective. The Kluwer international series in engineering and computer science, vol 671. Kluwer, Boston

    Google Scholar 

  7. Minkowski H (1896) Geometrie der Zahlen. Teubner, Leipzig

    Google Scholar 

  8. Nguyen PQ, Stern J (2001) The two faces of lattices in cryptology. In: Cryptography and lattices – proceedings of CALC’01, Providence. Lecture notes in computer science, vol 2146. Springer, Berlin, pp 146–180

    Google Scholar 

  9. Nguyen PQ, Vallée B (2009) The LLL algorithm: survey and applications. Information security and cryptography. Springer, Heidelberg

    Google Scholar 

  10. Siegel CL (1989) Lectures on the geometry of numbers. Springer, Berlin

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Nguyen, P. (2011). Lattice. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_456

Download citation

Publish with us

Policies and ethics