Enumeration of bent Boolean functions by reconfigurable computer
Loading...
Authors
Shafer, J. L.
Schneider, S.W.
Stănică, P.
Butler, Jon T.
Subjects
Advisors
Date of Issue
2010-05
Date
May 2-4, 2010
Publisher
Language
Abstract
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...
Type
Article
Description
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
The 18th Annual International IEEE Symposium on Field-Programmable Custom Computing Machines, Charlotte, NC, May 2-4, 2010, pp. 265-272
Series/Report No
Department
Department of Electrical and Computer Engineering
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Enumeration of bent Boolean functions by reconfigurable computer”, The 18th Annual International IEEE Symposium on Field-Programmable Custom Computing Machines, Charlotte, NC, May 2-4, 2010, pp. 265-272
Distribution Statement
Rights
This 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.