Enumeration of bent Boolean functions by reconfigurable computer
Shafer, J. L.
Butler, Jon T.
MetadataShow full item record
We show that there is a significant benefit to using a reconfigurable computer to enumerate bent Boolean functions for crypographic applications. Bent functions are rare, and the only known way to generate all bent functions is by a sieve technique in which many prospective functions are tested...
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.The 18th Annual International IEEE Symposium on Field-Programmable Custom Computing Machines, Charlotte, NC, May 2-4, 2010, pp. 265-272
Showing items related by title, author, creator and subject.
Schafer, Neil Brendan. (Monterey, California: Naval Postgraduate School, 2009-09);Boolean bent functions have desirable cryptographic properties in that they have maximum nonlinearity, which hardens a cryptographic function against linear cryptanalysis attacks. Furthermore, bent functions are extremely ...
Ulker, Birol (Monterey, Calif. Naval Postgraduate School, 2002-03);A logical function f is AND bi-decomposable if it can be written as f x1, x2)= h1 (x1) h2(x2), where x1 and x2 are disjoint. Such functions are important because they can be efficiently implemented. Also many benchmark ...
An analysis of bent function properties using the transeunt triangle and the SRC-6 reconfigurable computer Shafer, Jennifer L. (Monterey, California: Naval Postgraduate School, 2009-09);Linear attacks against cryptosystems can be defeated when combiner functions are composed of highly nonlinear Boolean functions. The highest nonlinearity Boolean functions, or bent functions, are not common- especially ...