Enhancing the Strength of Conventional Cryptosystems

We look at various ways of enhancing the strength of conventional cryptosystems such as DES by building a new system which has longer keys and which uses the original system as a building block. We propose a new variant of two-key triple encryption which is not vulnerable to the meet in the middle attack by van Oorschot and Wiener. Under an appropriate assumption on the security of DES, we can prove that our system is at least as hard to break as single DES.

[1]  Ivan Damgård,et al.  Secure Signature Schemes Based on Interactive Protocols See Back Inner Page for a List of Recent Publications in the Brics Report Series. Copies May Be Obtained by Contacting: Secure Signature Schemes Based on Interactive Protocols , 1995 .

[2]  Alexander A. Razborov,et al.  On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..

[3]  Vladimiro Sassone Strong Concatenable Processes: An Approach to the Category of Petri Net Computations , 1994 .

[4]  Paul C. van Oorschot,et al.  A Known Plaintext Attack on Two-Key Triple Encryption , 1991, EUROCRYPT.

[5]  Mitsuru Matsui,et al.  Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.

[6]  Jaap van Oosten Fibrations and Calculi of Fractions , 1994 .

[7]  Gerth Stølting Brodal,et al.  Partially Persistent Data Structures of Bounded Degree with Constant Update Time , 1994, Nord. J. Comput..

[8]  G. Winskel,et al.  A Compositional Proof System for the Modal mu-Calculus , 1994 .

[9]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[10]  Mitsuru Matsui,et al.  The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.

[11]  Martin E. Hellman,et al.  On the security of multiple encryption , 1981, CACM.

[12]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[13]  Thore Husfeldt Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink , 1995, ESA.

[14]  Noam Nisan,et al.  Symmetric Logspace is Closed Under Complement , 1994 .

[15]  Matthew J. Weiner,et al.  Efficient DES Key Search , 1994 .

[16]  A. Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994 .