Advertisement

Torus-Based Cryptography

  • Karl Rubin
  • Alice Silverberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2729)

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.

References

  1. 1.
    Bleichenbacher, D., Bosma, W., Lenstra, A.K.: Some remarks on Lucas-based cryptosystems. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 386–396. Springer, Heidelberg (1995)Google Scholar
  2. 2.
    Bosma, W., Hutton, J., Verheul, E.R.: Looking beyond XTR. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 46–63. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Brouwer, A.E., Pellikaan, R., Verheul, E.R.: Doing more with fewer bits. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 321–332. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    de Bruijn, N.G.: On the factorization of cyclic groups. Nederl. Akad. Wetensch. Proc. Ser. A 56 (= Indagationes Math. 15), 370–377 (1953)Google Scholar
  5. 5.
    Gong, G., Harn, L.: Public-key cryptosystems based on cubic finite field extensions. IEEE Trans. Inform. Theory 45, 2601–2605 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Klyachko, A.A.: On the rationality of tori with cyclic splitting field. In: Arithmetic and geometry of varieties, pp. 73–78. Kuybyshev Univ. Press, Kuybyshev (1988) (Russian)Google Scholar
  7. 7.
    Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. 8.
    Lenstra, A.K., Verheul, E.R.: An overview of the XTR public key system. In: Publickey cryptography and computational number theory (Warsaw, 2000), pp. 151–180. de Gruyter, Berlin (2001)Google Scholar
  9. 9.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1997)zbMATHGoogle Scholar
  10. 10.
    Müller, W.B., Nöbauer, W.: Some remarks on public-key cryptosystems. Studia Sci. Math. Hungar 16, 71–76 (1981)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Ono, T.: Arithmetic of algebraic tori. Ann. of Math. 74, 101–139 (1961)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Rubin, K., Silverberg, A.: Supersingular abelian varieties in cryptology. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 336–353. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Rubin, K., Silverberg, A.: Algebraic tori in cryptography. In: To appear in High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams. Fields Institute Communications Series. American Mathematical Society, ProvidenceGoogle Scholar
  14. 14.
    Schoenberg, I.J.: A note on the cyclotomic polynomial. Mathematika 11, 131–136 (1964)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Smith, P.J., Lennon, M.J.J.: LUC: A New Public Key System. In: Proceedings of the IFIP TC11 Ninth International Conference on Information Security IFIP/Sec 1993, pp. 103–117. North-Holland, Amsterdam (1993)Google Scholar
  16. 16.
    Smith, P., Skinner, C.: A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 357–364. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  17. 17.
    Voskresenskii, V.E.: Algebraic groups and their birational invariants, Translations of Mathematical Monographs, vol. 179. American Mathematical Society, Providence (1998)Google Scholar
  18. 18.
    Voskresenskii, V.E.: Stably rational algebraic tori, Les XXèmes Journées Arithmétiques (Limoges, 1997). J. Théor. Nombres Bordeaux 11, 263–268 (1999)zbMATHMathSciNetGoogle Scholar
  19. 19.
    Weil, A.: Adeles and algebraic groups. Progress in Math. 23, Birkhäuser, Boston (1982)Google Scholar
  20. 20.
    Williams, H.C.: A p + 1 method of factoring. Math. Comp. 39, 225–234 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Williams, H.C.: Some public-key crypto-functions as intractable as factorization. Cryptologia 9, 223–237 (1985)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Karl Rubin
    • 1
  • Alice Silverberg
    • 2
  1. 1.Department of MathematicsStanford UniversityStanfordUSA
  2. 2.Department of MathematicsOhio State UniversityColumbusUSA

Personalised recommendations