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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
Paper Title
Journal
Date
