An analysis of cryptographically significant Boolean functions with high correlation immunity by reconfigurable computer
Etherington, Carole J.
Butler, Jon T.
MetadataShow full item record
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 more complex and time consuming. Three different ways to execute a program to find the correlation immunity of a function are compared in this thesis. First, a program was written in C and executed on a conventional CPU. The same program was then executed on an FPGA on the SRC-6 reconfigurable computer. A similar program was written in Verilog and executed on the FPGA. By taking advantage of the parallel processing ability of the SRC-6, a wellprogrammed Verilog macro can find functions with high correlation immunity at a much faster rate. The SRC-6 reconfigurable computer is used in this thesis to find the correlation immunity of millions of functions up to six variables. Rotation symmetric and balanced functions were examined to find subsets that contain a high percentage of functions with good correlation immunity. The nonlinearity and correlation immunity of functions of four and five variables were compared to find functions with the best balance to fend off both correlation and linear attacks on a cryptosystem.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Etherington, Carole J.; Anderson, Matthew W.; Bach, Eric; Butler, Jon T.; Stănică, Pantelimon (World Scientific Publishing Company, 2015);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 ...
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; Stanica, 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 ...