Torus-based cryptography: Difference between revisions

Revision as of 22:59, 25 February 2006

Latest revision as of 16:52, 25 November 2024

(13 intermediate revisions by 11 users not shown)

Line 1:

{{no footnotes|date=November 2015}}

'''Torus -based cryptography''' involves using [[algebraicAlgebraic torus|algebraic tori]] to construct a [[groupGroup (mathematics)|group]] for use in [[cipher]]s based on the [[discrete logarithm problem]]. This idea was first introduced by [[Alice Silverberg]] and [[Karl Rubin]] in [[2003]] in the form of a [[public key algorithm]] by the name of [[CEILIDH]]. It improves on conventional cryptosystems by representing some elements of large finite fields compactly and therefore transmitting fewer bits.

==See also==

* [[Torus]]

==References==

Line 7 ⟶ 12:

* [http://www.math.uci.edu/~asilverb/bibliography/ceilidh.pdf Torus-Based Cryptography] — the paper introducing the concept (in PDF).

[[Category:AsymmetricPublic-key cryptosystemscryptography]]

{{crypto-stub}}

{{cryptoCrypto-stub}}

[[Category:Asymmetric-key cryptosystems]]