Paper 2002/149 Original: eprint.iacr.org/2002/149 ↗
About Filliol's Observations on DES, AES and Hash Functions (draft)
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2002-10-02: last updated
- 2002-10-01: published
- Short URL
- https://ia.cr/2002/149
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/149,
author = {Nicolas T. Courtois},
title = {About Filliol's Observations on DES, AES and Hash Functions (draft)},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/149},
year = {2002},
url = {https://eprint.iacr.org/2002/149}
}