Harmouch, Y. and El Kouch, R. and Ben-Azza, H. (2019) An improvement of correlation analysis for vectorial boolean functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11627. pp. 250-269.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

This paper investigates the correlation of n-bit to m-bit vectorial Boolean functions denoted by F. At Crypto 2000, Zhang and Chan showed that the maximum of linear approximations for F with Boolean functions g have a higher bias than those based on the usual correlation attack. The correlation for this linear approximation has been named the maximum correlation and has been shown to be a useful tool for correlation attack resistance. In this work, we deal with two issues. Firstly, we show that combining F with any g does not always increase the bias as stated by several works. To justify such results, we demonstrate the exact correlation link between F, g and the combination of F by g. Secondly, we provide the exact condition in which the correlation coefficients for this approximation are maximum. © Springer Nature Switzerland AG 2019.

Item Type: Article
Uncontrolled Keywords: Cryptography, Bias; Correlation analysis; Correlation attack; Correlation coefficient; Linear approximations; Maximum correlations; Stream Ciphers; Vectorial Boolean function, Boolean functions
Subjects: Computer Science
Divisions: SCIENTIFIC PRODUCTION > Computer Science
Depositing User: Administrateur Eprints Administrateur Eprints
Last Modified: 31 Jan 2020 15:45
URI: http://eprints.umi.ac.ma/id/eprint/2298

Actions (login required)

View Item View Item