A Parallel Approach in Computing Correlation Immunity up to Six Variables
Abstract
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 (in addition to other cryptographic properties) 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 less than or equal to n less than or equal to 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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 10, 2015
- Accession Number
- ADA623190
Entities
People
- Carole J. Etherington
- Eric Bach
- Jon T. Butler
- Matthew W. Anderson
- Pantelimon Stanica
Organizations
- Naval Postgraduate School