Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer
McCay, Matthew Eric
Butler, Jon T.
MetadataShow full item record
Boolean functions with high algebraic immunity (AI) are vital in reducing the possibility of utilizing algebraic attacks to break an encryption system. Simple algorithms exist to compute the AI of a given n-variable Boolean function, but the time required to test a large number of functions is much greater on conventional computing systems. AI was computed for all functions through n = 5 using the SRC-6. AI was also computed for n = 5 using a C algorithm. The SRC-6 performed 4.86 times faster than a conventional processor for this computation. It is believed that this is the first enumeration of all 5-variable functions with respect to AI. Monte Carlo trials were performed for n = 6, both on the SRC-6 and utilizing a C algorithm on a conventional processor. These trials provided the first known distribution of AI for 6-variable functions. Some algorithms for computing AI require a conversion between the truth table form of the function and its algebraic normal form. The first known Verilog implementation of a reduced transeunt triangle was developed for this conversion. This reduced form requires many fewer gates and has (n) delay versus (2) n delay for a full transeunt triangle.
Showing items related by title, author, creator and subject.
Butler, Jon T. (2010-09);"Bent Boolean functions are important in the encoding/decoding of secure messages. Because they are the most nonlinear of all functions, they are the least susceptible to linear attack. However, bent functions are rare and ...
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 ...
McCay, M. Eric; Stănică, Pantelimon; Butler, Jon T. (2012-09);Algebraic immunity (Al) is a property of a Boolean function f that measures its susceptibility to an alebraic attack. If f has a low algebraic immunity and f is used in an encryption protocol, then there are ways to ...