Abstract
In this letter, using techniques from linear algebra and coding theory, we characterize the quadratic Boolean functions represented by trace. We show that a linear combination of trace-terms over finite field can be determined to be bent by a polynomial GCD computation. Then we derive some new families of bent functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
