Is the Data Encryption Standard a group? (Results of cycling experiments on DES)

  title={Is the Data Encryption Standard a group? (Results of cycling experiments on DES)},
  author={B. S. Kaliski and R. Rivest and A. Sherman},
  journal={Journal of Cryptology},
  • B. S. Kaliski, R. Rivest, A. Sherman
  • Published 2004
  • Mathematics, Computer Science
  • Journal of Cryptology
  • The Data Encryption Standard (DES) defines an indexed set of permutations acting on the message space ℳ ={0,1}64. If this set of permutations were closed under functional composition, then the two most popular proposals for strengthening DES through multiple encryption would be equivalent to single encryption. Moreover, DES would be vulnerable to a known-plaintext attack that runs in 228 steps on the average. It is unknown in the open literature whether or not DES has this weakness.Two… CONTINUE READING
    40 Citations
    Primitivity of the group of a cipher involving the action of the key-schedule
    A Simplified and Generalized Treatment of DES-Related Ciphers
    • 3
    • PDF
    Efficient DES Key Search
    • 100
    Algebraic aspects of the advanced encryption standard
    • 73
    • PDF
    Algebraic properties of generalized Rijndael-like ciphers
    • 5
    • PDF
    Parallel Collision Search with Cryptanalytic Applications
    • 316
    • PDF
    Algebraic properties of cryptosystem PGM
    • 52
    • PDF
    On the primitivity of Lai-Massey schemes
    The Round Functions of Cryptosystem PGM Generate the Symmetric Group
    • 10
    • PDF


    Is DES a Pure Cipher? (Results of More Cycling Experiments on DES)
    • 22
    • PDF
    A cryptanalytic time-memory trade-off
    • M. Hellman
    • Computer Science
    • IEEE Trans. Inf. Theory
    • 1980
    • 641
    • PDF
    On the security of multiple encryption
    • 226
    • PDF
    Advances in Cryptology
    • 360
    DES-like functions can generate the alternating group
    • 45
    • PDF
    Advances in Cryptology: Proceedings Of Crypto 83
    • 338