Abstract
We consider the generic design of compression functions based on two n-bit permutations and XOR-based mixing functions. It is known that any such function mapping
Funding source: Research Council KU Leuven
Award Identifier / Grant number: GOA TENSE (GOA/11/007)
Funding source: Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen)
Funding source: Research Foundation – Flanders (FWO)
The authors would like to thank the anonymous reviewers of the Journal of Mathematical Cryptology for their comments and suggestions.
© 2015 by De Gruyter
This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.