Abstract
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered security against attacks known today is the same. We also give applications for this variant and conjecture a extension of this variant further reducing the size of sent information.
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
Adleman, M., DeMarrais, J.: A subexponentional algorithm over all finite fields. In: Proceedings of CRYPTO 1993, pp. 147–158. Springer, Heidelberg (1993)
Bleichenbacher, D., Bosma, W., Lenstra, A.K.: Some remarks on Lucas-Based Cryptosystems. In: Proceedings of CRYPTO 1995, pp. 386–396. Springer, Heidelberg (1995)
Coppersmith, D.: Fast evaluation of logarithms in fields of characteristic two. IEEE Transactions on Information Theory 30, 587–594 (1984)
ElGamal, T.: A Public Key Cryptosystem and a Signature scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory 31(4), 469–472 (1985)
FIPS 186, Digital signature standard, Federal Information Processing Standards Publication 186, U.S. Department of Commerce/ NIST (1994)
Lenstra, A.K.: Generating RSA moduli with a predetermined portion. In: Proceedings of Asiacrypt 1998, pp. 1–10. Springer, Heidelberg (1998)
Lenstra, A.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)
Lidl, R., Müller, W.B.: Permutation Polynomials in RSA-cryptosystems. In: Proceedings of Crypto 1983, pp. 293–301. Plemium Press (1983)
Lidl, R., Niederreiter, H.: Finite Fields. Addison-Wesley, Reading (1983)
Müller, W.B.: Polynomial functions in modern cryptology. In: Contributions to general Algebra 3, Proceedings of the Vienna Conference, pp. 7–32. Springer, Heidelberg (1985); Proceedings, pp. 50-61
Müller, W.B., Nöbauer, W.: Cryptanalysis of the Dickson-Scheme. In: Proceedings of Eurocrypt 1985, pp. 50–61. Springer, Heidelberg (1985)
Nöbauer, W.: Cryptanalysis of the Rédei Scheme. In: Contributions to general Algebra 3. Proceedings of the Vienna Conference, pp. 255–264 (1985)
Pollard, J.M.: Monte Carlo methods for index computation (mod(p). Mathematics of Computation 32, 918–924 (1978)
Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology 4, 161–174 (1991)
Smith, P., Skinner, C.: A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In: Proceedings of Asiacrypt 1994, pp. 357–364. Springer, Heidelberg (1994)
Verheul, E.R.: Certificates of Recoverability with Scalable Recovery Agent Security (in preparation)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brouwer, A.E., Pellikaan, R., Verheul, E.R. (1999). Doing More with Fewer Bits. In: Lam, KY., Okamoto, E., Xing, C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48000-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-48000-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66666-0
Online ISBN: 978-3-540-48000-6
eBook Packages: Springer Book Archive