Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
Markov ciphers and differential cryptanalysis
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
NESSIE: A European Approach to Evaluate Cryptographic Algorithms
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
First differential attack on full 32-round GOST
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Differential cryptanalysis of PP-1 cipher
Annales UMCS, Informatica - Cryptography and data protection
| Hi-index | 0.00 |
Q is a block cipher based on Rijndael and Serpent, which was submitted as a candidate to the NESSIE project by Leslie McBride.The submission document of Q describes 12 one-round iterative characteristics with probability 2-18 each. On 7 rounds these characteristics have probability 2-126, and the author of Q claims that these are the best 7- round characteristics. We find additional one-round characteristics that can be extended to more rounds. We also combine the characteristics into differentials. We present several differential attacks on the full cipher. Our best attack on the full Q with 128-bit keys (8 rounds) uses 2105 chosen plaintexts and has a complexity of 277 encryptions.Our best attack on the full Q with larger key sizes (9 rounds) uses 2125 chosen ciphertexts, and has a complexity of 296 for 192-bit keys, and 2128 for 256-bit keys.