Bent function discovery by reconfigurable computer
Butler, Jon T.
MetadataShow full item record
"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 difficult to discover. The only known way to enumerate all bent functions is by a sieve in which many prospective functions are tested. This is a tutorial description of the process of bent Boolean function discovery by a reconfigurable computer. Specifically, we discuss the use of SRC Computersâ SRC-6 reconfigurable computer in sieving through a large number of functions. We show why this process is much faster than on a conventional computer (up to 60,000 times), and we discuss the circular pipeline as a method to improve the throughput even further. The circular pipeline takes advantage of the fact that most functions pass not even one test for bentness. The improvement in throughput due to the circular pipeline depends on the relationship between distances among functions, but it is approximately 500 times better than our present throughput. "
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.Proceedings of the 9th International Workshop on Boolean Problems, Freiberg, Germany, Sept. 16-17, 2010, pp. 1-12 (Invited paper) (Unrefereed)
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.
Johnson, Christopher D. (Monterey, California. Naval Postgraduate School, 2010-09);For the first time, the circular pipeline as a means to significantly improve the throughput achieved in the search for bent functions is presented in this thesis. Linear cryptanalysis attack is a threat to modern symmetric ...
Upton, John G. (Monterey, California. Naval Postgraduate School, 1992-06);This thesis uses spatial impulse response theory adapted from continuous-wave Fourier diffraction theory as the basis for a microcomputer program to model transient optical wave propagation. Programs to generate uniform ...
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 ...