Compression in finite fields and torus-based cryptography
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.
compression torus-based cryptography multiplicative groups ceilidh