1 results sorted by ID
Possible spell-corrected query: said set
New Slide Attacks on Almost Self-Similar Ciphers
Orr Dunkelman, Nathan Keller, Noam Lasry, Adi Shamir
Secret-key cryptography
The slide attack is a powerful cryptanalytic tool which has the unusual property that it can break iterated block ciphers with a complexity that does not depend on their number of rounds. However, it requires complete self similarity in the sense that all the rounds must be identical. While this can be the case in Feistel structures, this rarely happens in SP networks since the last round must end with an additional post-whitening subkey. In addition, in many SP networks the final round has...
New Slide Attacks on Almost Self-Similar Ciphers
Orr Dunkelman, Nathan Keller, Noam Lasry, Adi Shamir
Secret-key cryptography
The slide attack is a powerful cryptanalytic tool which has the unusual property that it can break iterated block ciphers with a complexity that does not depend on their number of rounds. However, it requires complete self similarity in the sense that all the rounds must be identical. While this can be the case in Feistel structures, this rarely happens in SP networks since the last round must end with an additional post-whitening subkey. In addition, in many SP networks the final round has...