Abstract
We introduce the concept of torus-based cryptography, give a new public key system called CEILIDH, and compare it to other discrete log based systems including Lucas-based systems and XTR. Like those systems, we obtain small key sizes. While Lucas-based systems and XTR are essentially restricted to exponentiation, we are able to perform multiplication as well. We also disprove the open conjectures from [2], and give a new algebro-geometric interpretation of the approach in that paper and of LUC and XTR. © International Association for Cryptologic Research 2003.
Cite
CITATION STYLE
Rubin, K., & Silverberg, A. (2003). Torus-based cryptography. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2729, 349–365. https://doi.org/10.1007/978-3-540-45146-4_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
