Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
- 1 January 2011
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Distinguishers for the Compression Function and Output Transformation of Hamsi-256Lecture Notes in Computer Science, 2010
- Security Bounds for the Design of Code-Based CryptosystemsLecture Notes in Computer Science, 2009
- Known-Key Distinguishers for Some Block CiphersPublished by Springer Science and Business Media LLC ,2007
- Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential CryptanalysisLecture Notes in Computer Science, 2002
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- Codes, Bent Functions and Permutations Suitable For DES-like CryptosystemsDesigns, Codes and Cryptography, 1998
- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced CostLecture Notes in Computer Science, 1997
- The block cipher SquarePublished by Springer Science and Business Media LLC ,1997
- Truncated and higher order differentialsLecture Notes in Computer Science, 1995
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parametersDesigns, Codes and Cryptography, 1993