The real reason for Rivest's phenomenon
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Cycle structure of the DES with weak and semi-weak keys
Proceedings on Advances in cryptology---CRYPTO '86
Is the data encryption standard a group? (Results of cycling experiments on DES)
Journal of Cryptology
How easy is collision search? Application to DES
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How easy is collision search: New results and applications to DES
CRYPTO '89 Proceedings on Advances in cryptology
A Switching Closure Test to Analyze Cryptosystems
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Scalable multicast security with dynamic recipient groups
ACM Transactions on Information and System Security (TISSEC)
Cryptography, trusted third parties and escrow
BT Technology Journal
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Building Survivable Services Using Redundancy and Adaptation
IEEE Transactions on Computers
A Polynomial-Time Universal Security Amplifier in the Class of Block Ciphers
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Key-Schedule Cryptoanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
The Round Functions of Cryptosystem PGM Generate the Symmetric Group
Designs, Codes and Cryptography
Binding software to specific native hardware in a VM environment: the puf challenge and opportunity
Proceedings of the 1st ACM workshop on Virtual machine security
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Combinatorial properties of basic encryption operations
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
The inverse s-box, non-linear polynomial relations and cryptanalysis of block ciphers
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
| Hi-index | 0.00 |
We prove that the set of DES permutations (encryption and decryption for each DES key) is not closed under functional composition. This implies that, in general, multiple DES-encryption is not equivalent to single DES-encryption, and that DES is not susceptible to a particular known-plaintext attack which requires, on average, 228 steps. We also show that the size of the subgroup generated by the set of DES permutations is greater than 102499, which is too large for potential attacks on DES which would exploit a small subgroup.