A parallel approach in computing correlation immunity up to six variables
Etherington, Carole J.
Anderson, Matthew W.
Butler, Jon T.
MetadataShow full item record
We show the use of a reconfigurable computer in computing the correlation immunity of Boolean functions of up to 6 variables. Boolean functions with high correlation immunity are desired in cryptographic systems because they are immune to correlation attacks. The SRC-6 reconfigurable computer was programmed in Verilog to compute the correlation immunity of functions. This computation is performed at a rate that is 190 times faster than a conventional computer. Our analysis of the correlation immunity is across all n-variable Boolean functions, for 2 ⦤ n ⦤ 6, thus obtaining, for the first time, a complete distribution of such functions. We also compare correlation immunity with two other cryptographic properties, nonlinearity and degree.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
An analysis of cryptographically significant Boolean functions with high correlation immunity by reconfigurable computer Etherington, Carole J. (Monterey, California. Naval Postgraduate School, 2010-12);Boolean functions with high correlation immunity can be used in cryptosystems to defend against correlation attacks. These functions are rare and difficult to find. As the variables increase, this task becomes exponentially ...
Correlation immunity, avalanche features, and other cryptographic properties of generalized Boolean functions Martinsen, Thor (Monterey, California: Naval Postgraduate School, 2017-09);This dissertation investigates correlation immunity, avalanche features, and the bent cryptographic properties for generalized Boolean functions defined on Vn with values in Zԛ. We extend the concept of correlation immunity ...
Maitra, Submahoy; Stănică, Pantelimon (2003);In 1999, Pieprzyk and Qu presented rotation symmetric (RotS) functions as components in the rounds of hashing algorithm. Later, in 2002, Cusick and St ̆anic ̆a presented further advancement in this area. This class of ...