Cryptology ePrint Archive: Report 2019/286

Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ variables Majority Function

Yindong Chen and Fei Guo and Liu Zhang

Abstract: Boolean functions used in some cryptosystems of stream ciphers should satisfy various criteria simultaneously to resist some known attacks. The fast algebraic attack (FAA) is feasible if one can find a nonzero function $g$ of low algebraic degree and a function $h$ of algebraic degree significantly lower than $n$ such that $f\cdot g=h$. Then one new cryptographic property fast algebraic immunity was proposed, which measures the ability of Boolean functions to resist FAAs. It is a great challenge to determine the exact values of the fast algebraic immunity of an infinite class of Boolean functions with optimal algebraic immunity. In this letter, we explore the exact fast algebraic immunity of two subclasses of the majority function.

Category / Keywords: foundations / Fast algebraic immunity, Majority function, Algebraic immunity, Boolean function

Date: received 11 Mar 2019

Contact author: ydchen at stu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20190319:135023 (All versions of this report)

Short URL: ia.cr/2019/286


[ Cryptology ePrint archive ]