UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Algebraic Tori in Cryptography

Thumbnail Image

Files

ncalexan2005.pdf (1.61 MB)

Date

2005

Authors

Alexander, Nicholas Charles

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Communicating bits over a network is expensive. Therefore, cryptosystems that transmit as little data as possible are valuable. This thesis studies several cryptosystems that require significantly less bandwidth than conventional analogues. The systems we study, called torus-based cryptosystems, were analyzed by Karl Rubin and Alice Silverberg in 2003 [RS03]. They interpreted the XTR [LV00] and LUC [SL93] cryptosystems in terms of quotients of algebraic tori and birational parameterizations, and they also presented CEILIDH, a new torus-based cryptosystem. This thesis introduces the geometry of algebraic tori, uses it to explain the XTR, LUC, and CEILIDH cryptosystems, and presents torus-based extensions of van Dijk, Woodruff, et al. [vDW04, vDGP<sup>+</sup>05] that require even less bandwidth. In addition, a new algorithm of Granger and Vercauteren [GV05] that attacks the security of torus-based cryptosystems is presented. Finally, we list some open research problems.

Description

Keywords

Mathematics, cryptography, compression, finite field, extension field, discrete logarithm problem, tori, torus, algebraic, Rubin, Silverberg, Granger, Vercauteren, XTR, LUC, CEILIDH

LC Keywords

Citation

URI

http://hdl.handle.net/10012/1154

Collections

Theses
Combinatorics and Optimization