Compression in Finite Fields and Torus-Based Cryptography
Karl Rubin, Alice Silverberg · SIAM Journal on Computing · 2008
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.