A Proof of Constructions for Balanced Boolean Function with Optimum Algebraic Immunity

Yindong Chen; Wei Tian; Ya-nan Zhang

A Proof of Constructions for Balanced Boolean Function with Optimum Algebraic Immunity

원문정보

Yindong Chen, Wei Tian, Ya-nan Zhang

보안공학연구지원센터(IJSIA) International Journal of Security and Its Applications Vol.9 No.2 2015.02 pp.111-122 SCOPUS

피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

Algebraic immunity is a cryptographic criterion for Boolean functions used in cryptosystem to resist algebraic attacks. They usually should have high algebraic immunity. Chen proposed a first order recursive construction of Boolean functions and checked that they had optimum algebraic immunity for n<8.This paper gives a detail proof of having optimum algebraic and being balanced for all n>0.

Abstract
1. Introduction
2. Preliminaries
  2.1. Boolean Function
  2.2. Algebraic Immunity of Boolean function
  2.3. The Concatenation Operation of Boolean Function
3. A Recursive Construction of Boolean Function with Optimum Algebraic Immunity
4. Other Cryptographic Properties
5. Conclusion
Acknowledgements
References

키워드

저자정보

Yindong Chen College of Engineering, Shantou University, Shantou, China
Wei Tian College of Engineering, Shantou University, Shantou, China
Ya-nan Zhang College of Engineering, Shantou University, Shantou, China

참고문헌

자료제공 : 네이버학술정보

함께 이용한 논문

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

0개의 논문이 장바구니에 담겼습니다.

earticle