@article {
author = {Vardasbi, A. and Salmasizadeh, M. and Mohajeri, J.},
title = {On the multi _ chi-square tests and their data complexity},
journal = {The ISC International Journal of Information Security},
volume = {4},
number = {1},
pages = {15-24},
year = {2012},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {10.22042/isecure.2015.4.1.3},
abstract = {Chi-square tests are generally used for distinguishing purposes; however when they are combined to simultaneously test several independent variables, extra notation is required. In this study, the chi-square statistics in some previous works is revealed to be computed half of its real value. Therefore, the notion of Multi _ Chi-square tests is formulated to avoid possible future confusions. In order to show the application of Multi _ Chi square tests, two new tests are introduced and applied to reduce round Trivium as a special case. These tests are modifications of the ANF monomial test, and when applied to Trivium with the same number of rounds, the data complexity of them is roughly 24 times smaller than that of former ANF monomial test. In a Multi _ Chi-square test the critical degrees of freedom is defined to be the minimum value of the degrees of freedom for which the test is successful at distinguishing the samples set from random. This study investigates the relation between this critical value and the chi-square statistic of a Multi _ Chi-square test. In the sequel, by exploiting this relation, a method to approximate the data complexity of a distinguishing Multi _ Chi-square test is introduced and shown to perform properly in the special case of reduced round Trivium.},
keywords = {Multi _ Chi-square Test,Distinguishing Attacks,Critical Degrees of Freedom,Trivium},
url = {http://www.isecure-journal.com/article_39194.html},
eprint = {http://www.isecure-journal.com/article_39194_7010289d1d62a8cf948b632a21caf77d.pdf}
}