Torus-based cryptography: Difference between revisions

Revision as of 15:15, 4 April 2004

Latest revision as of 16:52, 25 November 2024

(24 intermediate revisions by 19 users not shown)

Line 1:

{{no footnotes|date=November 2015}}

'''Torus -based cryptography''' involves using [[algebraicAlgebraic torus|algebraic tori]] to construct a [[Group (mathematics)|group]] for use in cryptosystems[[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 cryptosystemalgorithm]] by the name of [[CEILIDH]]. It improves on conventional cryptosystems by representing some elements of large finite fields compactly and therefore transmitting fewer bits.

==ExternalSee Linksalso==

* [http://www.math.ohio-state.edu/~silver/bibliography/ceilidh.pdf Torus-Based Cryptography] - The paper by Rubin and Silverberg introducing the concept and implementation.

* [[Torus]]

{{msg:stub}}

==References==

* Karl Rubin, Alice Silverberg: Torus-Based Cryptography. CRYPTO 2003: 349–365

==External links==

* [http://www.math.ohio-stateuci.edu/~silverasilverb/bibliography/ceilidh.pdf Torus-Based Cryptography] -— Thethe paper by Rubin and Silverberg introducing the concept and(in implementationPDF).

[[Category:Public-key cryptography]]

{{msg:Crypto-stub}}