Paper 2016/419
Walsh-Hadamard Transform and Cryptographic Applications in Bias Computing
Yi LU and Yvo DESMEDT
Abstract
Walsh-Hadamard transform is used in a wide variety of scientific and engineering applications, including bent functions and cryptanalytic optimization techniques in cryptography. In linear cryptanalysis, it is a key question to find a good linear approximation, which holds with probability
Note: Though the original conference version was published back in 2011, we feel that the main results and ideas are not well appreciated in crypto community unfortunately, especially with respect to applicability of Piling-up lemma (which is not restricted to the area of secret-key crypto). We completely rewrite the paper and give fully extended results in the journal "cryptography and communications". We took three times of hard revision work to make a new-look with the presentation, because the reviewers are very critical (but also helpful and encouraging) about the work. It took about one and half years, from we started preparation of the journal version to the final press publication. The current content and quality deserve to have wide-spread audience.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Minor revision. Cryptography and Communications (Springer)
- DOI
- 10.1007/s12095-015-0155-4
- Keywords
- (Sparse) Walsh-Hadamard TransformLinear cryptanalysisBias analysisMaximum entropy principlePiling-up lemma
- Contact author(s)
- dr yi lu @ ieee org
- History
- 2016-05-01: received
- Short URL
- https://ia.cr/2016/419
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/419, author = {Yi LU and Yvo DESMEDT}, title = {Walsh-Hadamard Transform and Cryptographic Applications in Bias Computing}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/419}, year = {2016}, doi = {10.1007/s12095-015-0155-4}, url = {https://eprint.iacr.org/2016/419} }