Multiple encryption with minimum key

  • Ivan B. Damgård
  • Lars Ramkilde Knudsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1029)


In this paper we consider multiple encryption schemes built from conventional cryptosystems such as DES. The existing schemes are either vulnerable to variants of meet in the middle attacks, i.e. they do not provide security of the full key or there is no proof that the schemes are as secure as the underlying cipher. We propose a new variant of two-key triple encryption which is not vulnerable to the meet in the middle attack and which uses a minimum amount of key. We can prove a connection between the security of our system and the security of the underlying block cipher.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing, pages 856–864, 1984.Google Scholar
  2. 2.
    S. Even and O. Goldreich. On the power of cascade ciphers. ACM Trans. on Computer Systems, 3:108–116, 1985.Google Scholar
  3. 3.
    M. Matsui. Linear cryptanalysis method for DES cipher. In T. Helleseth, editor, Advances in Cryptology — Proc. Eurocrypt'93, LNCS 765, pages 386–397. Springer Verlag, 1993.Google Scholar
  4. 4.
    M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Y. G. Desmedt, editor, Advances in Cryptology — Proc. Crypto'94, LNCS 839, pages 1–11. Springer Verlag, 1994.Google Scholar
  5. 5.
    U. Maurer and J.L. Massey. Cascade ciphers: The importance of being first. Journal of Cryptology, 6(1):55–61, 1993.Google Scholar
  6. 6.
    R. Merkle and M. Hellman. On the security of multiple encryption. Communications of the ACM, 24(7):465–467, 1981.Google Scholar
  7. 7.
    J.-J. Quisquater and J.-P. Delescaille. How easy is collision search. New results and applications to DES. In G. Brassard, editor, Advances in Cryptology — Proc. Crypto'89, LNCS 435, pages 408–413. Springer Verlag, 1990.Google Scholar
  8. 8.
    W. Tuchman. Hellman presents no shortcut solutions to DES. IEEE Spectrum, 16(7):40–41, July 1979.Google Scholar
  9. 9.
    P.C. van Oorschot and M.J. Wiener. A known-plaintext attack on two-key triple encryption. In I.B. Damgård, editor, Advances in Cryptology — Proc. Eurocrypt'90, LNCS 473, pages 318–325. Springer Verlag, 1990.Google Scholar
  10. 10.
    M.J. Wiener. Efficient DES key search. Technical Report TR-244, School of Computer Science, Carleton University, Ottawa, Canada, May 1994. Presented at the Rump Session of Crypto'93.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ivan B. Damgård
    • 1
  • Lars Ramkilde Knudsen
    • 1
  1. 1.Aarhus UniversityDenmark

Personalised recommendations