Welcome to the resource topic for 2002/149
Title:
About Filliol’s Observations on DES, AES and Hash Functions (draft)
Authors: Nicolas T. Courtois
Abstract:Recently Filiol proposed to test cryptographic algorithms
by making statistics on the number of low degree terms in the boolean functions.
The paper has been published on eprint on 23th of July 2002.
In this paper we reproduce some of Filiol’s simulations.
We did not confirm his results:
our results suggest that DES, AES, and major hash functions
have no significative bias and their output bits behave just like random boolean functions.
ePrint: https://eprint.iacr.org/2002/149
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .