Sciweavers

Share
SIAMCOMP
2008

Compression in Finite Fields and Torus-Based Cryptography

10 years 11 months ago
Compression in Finite Fields and Torus-Based Cryptography
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key cryptosystems called T2 and CEILIDH, we disprove some conjectures, and we use the theory of algebraic tori to give a better understanding of our cryptosystems, the Lucas-based, XTR and Gong-Harn cryptosystems, and conjectured generalizations.
Karl Rubin, Alice Silverberg
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIAMCOMP
Authors Karl Rubin, Alice Silverberg
Comments (0)
books