Translation Equivalence of Boolean Functions Expressed by Primitive Element

Yindong CHEN  Liu ZHANG  Deng TANG  Weihong CAI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.4   pp.672-675
Publication Date: 2019/04/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.672
Type of Manuscript: LETTER
Category: Cryptography and Information Security
Keyword: 
Boolean function,  primitive element,  affine equivalence,  

Full Text: PDF(140.1KB)>>
Buy this Article



Summary: 
In recent years, algebraic attacks and fast algebraic attacks have received a lot of attention in the cryptographic community. There are three Boolean functions achieving optimal algebraic immunity based on primitive element of F2n. The support of Boolean functions in [1]-[3] have the same parameter s, which makes us have a large number of Boolean functions with good properties. However, we prove that the Boolean functions are affine equivalence when s takes different values.