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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
WenPing MA, MoonHo LEE, FuTai ZHANG, "A New Class of Bent Functions" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 7, pp. 2039-2040, July 2005, doi: 10.1093/ietfec/e88-a.7.2039.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.7.2039/_p
Copy
@ARTICLE{e88-a_7_2039,
author={WenPing MA, MoonHo LEE, FuTai ZHANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Class of Bent Functions},
year={2005},
volume={E88-A},
number={7},
pages={2039-2040},
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.},
keywords={},
doi={10.1093/ietfec/e88-a.7.2039},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A New Class of Bent Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2039
EP - 2040
AU - WenPing MA
AU - MoonHo LEE
AU - FuTai ZHANG
PY - 2005
DO - 10.1093/ietfec/e88-a.7.2039
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2005
AB - 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.
ER -