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.

• Type: Journal
• Year: 2008
• Where: SIAMCOMP
• Authors: Karl Rubin, Alice Silverberg
• Keywords: Efficient Compression, Multiplicative Groups, Public Key Cryptosystems, SIAMCOMP 2008