Skip to main content

Improving the Security of Exponential Key Exchange

  • Chapter
Advances in Cryptology
  • 390 Accesses

Abstract

Presented in this paper is a recursive public key distribution mechanism which utilizes a fixed size public key generator to build systems with arbitrarily large cryptocomplexity when block encryption is performed by some key driven device such as DES. The technique provides both an encryption and authentication mechanism and is ideally suited to link encryption applications where there exist only fixed length public key generators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shamir, A.. “A Polynomial Time Algorithm for Breaking the Merkle-Hellman Cryptosystems,” (extended abstract) Research Announcement, April 1982.

    Google Scholar 

  2. Brickell, E. F. et al, “A Preliminary Report on the Cryptanalysis of Merkle-Hellman Cryptosystems,” Presented at CRYPTO 82, August 1982.

    Google Scholar 

  3. Herlestam, T. and R. Johannesson, “On Computing Logarithms Over GF(2P),” 1981 IEEE International Symposium on Information Theory, Santa Monica, California, February 1981.

    Google Scholar 

  4. Fuji-Hara, R. et al “Finite Field Techniques for Shift Registers and Encipherment,” University of Waterloo Research Report, Project number 106–16, 1982.

    Google Scholar 

  5. Beker, H. and F. Piper, Cipher Systems, John Wiley amp; Sons, 1982.

    Google Scholar 

  6. Diffie, W. and M. Hellman “New Directions in Cryptography.” IEEE Transactions on Information Theory, Vol IT-22, November 1976.

    Google Scholar 

  7. Fam, B. W. and J. Kowalchuk III, “A VLSI Device for Fast Exponentiation in Finite Fields,” Proceedings of the 1982 IEEE International Conference in Circuits and Computers, September 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Plenum Press, New York

About this chapter

Cite this chapter

Fam, B.W. (1984). Improving the Security of Exponential Key Exchange. In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-4730-9_25

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-4732-3

  • Online ISBN: 978-1-4684-4730-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics