IEICE TRANSACTIONS on Fundamentals
Translation Equivalence of Boolean Functions Expressed by Primitive Element
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.4 pp.672-675
- Publication Date
- 2019/04/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.672
- Type of Manuscript
- LETTER
- Category
- Cryptography and Information Security
Authors
Yindong CHEN
Shantou University, and the Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Techniques
Liu ZHANG
Shantou University, and the Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Techniques
Deng TANG
Southwest Jiaotong University, and the Guangxi Key Laboratory of Cryptography and Information Security
Weihong CAI
Shantou University, and the Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Techniques
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Yindong CHEN, Liu ZHANG, Deng TANG, Weihong CAI, "Translation Equivalence of Boolean Functions Expressed by Primitive Element" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 4, pp. 672-675, April 2019, doi: 10.1587/transfun.E102.A.672.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.672/_p
Copy
@ARTICLE{e102-a_4_672,
author={Yindong CHEN, Liu ZHANG, Deng TANG, Weihong CAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Translation Equivalence of Boolean Functions Expressed by Primitive Element},
year={2019},
volume={E102-A},
number={4},
pages={672-675},
abstract={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.},
keywords={},
doi={10.1587/transfun.E102.A.672},
ISSN={1745-1337},
month={April},}
Copy
TY - JOUR
TI - Translation Equivalence of Boolean Functions Expressed by Primitive Element
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 672
EP - 675
AU - Yindong CHEN
AU - Liu ZHANG
AU - Deng TANG
AU - Weihong CAI
PY - 2019
DO - 10.1587/transfun.E102.A.672
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2019
AB - 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.
ER -
English
