Torus-based cryptography
Torus-based cryptography involves using algebraic tori to construct a group for use in ciphers 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.[1][2]
See also
[edit]References
[edit]- ↑ Rubin, Karl; Silverberg, Alice (2003). "Torus-Based Cryptography". In Boneh, Dan (ed.). Advances in Cryptology - CRYPTO 2003. Lecture Notes in Computer Science. Vol. 2729. Berlin, Heidelberg: Springer. pp. 349–365. doi:10.1007/978-3-540-45146-4_21. ISBN 978-3-540-45146-4.
- ↑ Gorla, Elisa (2025), "Torus-Based Cryptography", Encyclopedia of Cryptography, Security and Privacy, Springer, Cham, pp. 2632–2634, doi:10.1007/978-3-030-71522-9_481, ISBN 978-3-030-71522-9, retrieved 2026-02-03
External links
[edit]- Torus-Based Cryptography (2003) — the paper introducing the concept (in PDF).
 | This cryptography-related article is a stub. You can help Wikipedia by adding missing information. |