2012 | OriginalPaper | Chapter
Perfect Algebraic Immune Functions
Authors : Meicheng Liu, Yin Zhang, Dongdai Lin
Published in: Advances in Cryptology – ASIACRYPT 2012
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A perfect algebraic immune function is a Boolean function with perfect immunity against algebraic and fast algebraic attacks. The main results are that for a perfect algebraic immune balanced function the number of input variables is one more than a power of two; for a perfect algebraic immune unbalanced function the number of input variables is a power of two. Also, for
n
equal to a power of two, the Carlet-Feng functions on
n
+ 1 variables and the modified Carlet-Feng functions on
n
variables are shown to be perfect algebraic immune functions.