Abstract
We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discrete-log based public-key system achieving the optimal communication rate, partially answering the conjecture in [4]. For n the product of distinct primes, we construct efficient ElGamal signature and encryption schemes in a subgroup of \(F_{q^n}^*\) in which the number of bits exchanged is only a φ(n)/n fraction of that required in traditional schemes, while the security offered remains the same. We also present a Diffie-Hellman key exchange protocol averaging only φ(n)log2 q bits of communication per key. For the cryptographically important cases of n=30 and n=210, we transmit a 4/5 and a 24/35 fraction, respectively, of the number of bits required in XTR [14] and recent CEILIDH [24] cryptosystems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adelman, L.M., DeMarrais, J.: A Subexponential Algorithm for Discrete Logarithms over All Finite Fields. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 147–158. Springer, Heidelberg (1994)
Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: Proc. 8-rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 675–681. ACM, NY (1997)
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)
Brouwer, 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)
Chebotarev, N.G.: Die Bestimmung der Dichtigkeit einer Menge von Primzahlen. welche zu einer gegebenen Substitutionsklasse gehören. Math. Ann. 95, 191–228 (1926)
Cohen, H., Lenstra, A.K.: Supplement to Implementation of a New Primality Test. Mathematics of Computation 48(177) (1987)
Coppersmith, D.: Fast Evaluation of Logarithms in Fields of Characteristic Two. IEEE Trans. Inform. Theory 30, 587–594 (1984)
Finch, S.R.: Artin’s Constant, 2.4 in Mathematical Constants, pp. 104–110. Cambridge University Press, Cambridge (2003)
Gordon, D.: Discrete Logarithms in GF(p) Using the Number Field Sieve. SIAMJ. Discrete Math. 6, 312–323 (1993)
ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory 31(4), 469–472 (1985)
Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1979)
Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics Doklady 7, 595–596 (1963)
Lenstra, K.: Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997. LNCS, vol. 1270, pp. 127–138. Springer, Heidelberg (1997)
Lenstra, K., Verheul, E.R.: The XTR Public Key System. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)
Lenstra, K., Verheul, E.R.: An Overview of the XTR Public Key System. In: Public-key cryptography and computational number theory, Warsaw, 2000, pp. 151–180. de Gruyter, Berlin (2001)
Lenstra, H.W.: The Chebotarev Density Theorem, http://math.berkeley.edu/jvoight/notes/oberwolfach/Lenstra-Chebotarev.pdf
Lim, S., Kim, S., Yie, I., Kim, J., Lee, H.: XTR Extended to GF(p6m). In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 301–312. Springer, Heidelberg (2001)
Menezes, J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Nagell, T.: The Cyclotomic Polynomials and The Prime Divisors of the Cyclotomic Polynomial. In: 46 and 48 in Introduction to Number Theory, pp. 158–160, 164-168. Wiley, New York (1951)
Odlyzko, A.: Discrete Logarithms: The past and the future. Designs, Codes and Cryptography 19, 129–145 (2000)
Pohlig, S.C., Hellman, M.E.: An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance. IEEE Trans. on IT 24, 106–110 (1978)
Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32, 918–924 (1978)
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, Providence (2004)
Rubin, K., Silverberg, A.: Torus-Based Cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 349–365. Springer, Heidelberg (2003)
Rubin, K., Silverberg, A.: Using primitive subgroups to do more with fewer bits. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 18–41. Springer, Heidelberg (2004)
Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology 4, 161–174 (1991)
Schirokauer, O.: Discrete Logarithms and Local Units. Phil. Trans. R. Soc. Lond. A 345, 409–423 (1993)
Schirokauer, O., Weber, D., Denny, T.F.: Discrete Logarithms: the effectiveness of the index calculus method. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol. 1122, Springer, Heidelberg (1996)
Stam, M.: Speeding up Subgroup Cryptosystems, PhD Thesis, Eindhoven University of Technology (2003)
Voskresenskii, V.: Algebraic Groups and Their Birational Invariants, Translations of Mathematical Monographs 179. American Mathematical Society, Providence (1998)
Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba Algorithm for Efficient Implementations, (2003), http://www.crypto.ruhr-uni-bochum.de/Publikationen/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Dijk, M., Woodruff, D. (2004). Asymptotically Optimal Communication for Torus-Based Cryptography. In: Franklin, M. (eds) Advances in Cryptology – CRYPTO 2004. CRYPTO 2004. Lecture Notes in Computer Science, vol 3152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-28628-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22668-0
Online ISBN: 978-3-540-28628-8
eBook Packages: Springer Book Archive