Kleinian integer

In mathematical cryptography, a Kleinian integer is a complex number of the form m+n\frac{1+\sqrt{-7}}{2} , with m and n rational integers.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematical cryptography, a Kleinian integer is a complex number of the form m+n1+−72, with m and n rational integers. They are named after Felix Klein.

The Kleinian integers form a ring called the Kleinian ring, which is the ring of integers in the imaginary quadratic field ℚ(−7). This ring is a unique factorization domain.

See also

edit edit source

References

edit edit source
  • Conway, John Horton; Smith, Derek A. (2003), On Quaternions and Octonions: Their Geometry, Arithmetic, and Symmetry, A. K. Peters, Ltd., ISBN 978-1-56881-134-5. (Review).
  • Dimitrov, V. S.; Järvinen, K. U.; Jacobson, M. J.; Chan, W. F.; Huang, Z. (2006), "FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers", Cryptographic Hardware and Embedded Systems - CHES 2006, Lecture Notes in Computer Science, vol. 4249, pp. 445–459, doi:10.1007/11894063_35, ISBN 978-3-540-46559-1

Text derived from https://en.wikipedia.org/w/index.php?oldid=1066827785 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001066827785 · captured 1642667187.0 · version history

Cite this page as: encyclopegia.org, “Kleinian integer”, snapshot enwiki-001066827785. https://encyclopegia.org/a/kleinian-integer

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.