On the security of multiple encryption

  title={On the security of multiple encryption},
  author={Ralph C. Merkle and Martin E. Hellman},
  journal={Commun. ACM},
Double encryption has been suggested to strengthen the Federal Data Encryption Standard (DES). A recent proposal suggests that using two 56-bit keys but enciphering 3 times (encrypt with a first key, decrypt with a second key, then encrypt with the first key again) increases security over simple double encryption. This paper shows that although either technique significantly improves security over single encryption, the new technique does not significantly increase security over simple double… 
Multiple Encryption with Minimum Key
This paper proposes 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 and can prove a connection between the security of the system and theSecurity of the underlying block cipher.
Security of Sequential Multiple Encryption
An extended security notion of sequential multiple encryptions is presented, in which the adversary is allowed to decrypt component encryptions in addition to access to the decryption oracle of the multiple encryption, and it is shown that the constructed scheme satisfies it.
An Overview of the Data encryption standard (DES)
The Data Encryption Standard is overviewed; criticisms faced and concluded if it is still secure enough to protect confidential information based on published cryptanalysis on this encryption system.
Two-Key Triple Encryption
This paper proposes a variant of two-key triple encryption with a new method of generating three keys from two that is not vulnerable to the meet-in-the-middle attack and can be shown to be at least as hard to break as the underlying block cipher.
Related-key attack against triple encryption based on fixed points
  • S. Vaudenay
  • Computer Science, Mathematics
    Proceedings of the International Conference on Security and Cryptography
  • 2011
This paper focuses on triple encryption mode, which was proposed to increase the security of single encryption when the key is too short and proposed a related-key attack which can break it at a price similar to breaking single encryption.
Multiphase Encryption: A New Concept in Modern Cryptography
In this research paper, the new encryption technique named as ―Multiphase Encryption is proposed, which enhances the complexity in encryption algorithm at large extent.
On the Security of Encrypted Secret Sharing
This work presents a method for combining arbitrary encryption algorithms, a (k, n)-threshold scheme, which increases the effective key lengths of repeatedly applied encryption algorithms.
Technical correspondence: On multiple encryption security
It is possible to apply DES twice to a message without encountering the problems Merkle and Hellman describe, and a clever hardware design could make this algorithm run nearly half as fast as DES.
Analysis of DES Double Key Mode
In this paper we examine closely a new mode of the Data Encryption Standard (DES), which is included in a new chip called SuperCrypt. This mode allows for a 112-bit key which encrypts at the same
On the security of the XOR sandwiching paradigm for multiple keyed block ciphers
  • R. Ii-Yung, K. Khoo, R. Phan
  • Computer Science, Mathematics
    2013 International Conference on Security and Cryptography (SECRYPT)
  • 2013
This paper provides a comprehensive analysis on the security of the XOR sandwiching paradigm against known attacks for the case of multiple keyed triple encryption, without loss of generality, using DES as the underlying block cipher.


Assessment of the National Bureau of Standards Proposed Federal Data Encryption Standard
The National Bureau of Standards (NBS) has implemented a Data Encryption Standard (DES), describing an encryption procedure to be used by Federal agencies and others to protect data against
New directions in cryptography
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and cataloging individual pieces of data to provide real-time information about their owners.
Communication theory of secrecy systems
  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
An extension of the Shannon theory approach to cryptography
  • M. Hellman
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1977
Shannon's information-theoretic approach to cryptography is reviewed and extended. It is shown that Shannon's random cipher model is conservative in that a randomly chosen cipher is essentially the
Results of an initial attempt to cryptanalyze the NBS data encryption standard
  • Information Systems Laboratory SEL
  • 1976
Encryption algorithm: Key size is the thing
  • Datamation
  • 1976
The Codebreakers. Macmillan
  • New York,
  • 1976