Compression in Finite Fields and Torus-Based Cryptography

K. Rubin, A. Silverberg
2008 SIAM journal on computing (Print)  
This paper is dedicated to the memory of the cat Ceilidh. 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 T 2 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. 2000 Mathematics
more » ... 2000 Mathematics Subject Classification. 94A60, 68P25, 14G50, 11T71.
doi:10.1137/060676155 fatcat:63frdelflndgnillg63chnw764