2012Unpublished venueRequires access

Perfect Algebraic Immune Functions.

Meicheng Liu, Yin Zhang, Dongdai Lin

Open publisher page 0 citations

Abstract

Abstract. 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 the Carlet-Feng functions on 2 s +1 variables and the modified Carlet-Feng functions on 2 s variables are shown to be perfect algebraic immune functions. Furthermore, it is shown that a perfect algebraic immune function behaves good against probabilistic algebraic attacks as well.

About this research paper

What this paper is about

Abstract. 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 the Carlet-Feng functions on 2 s +1 variables and the modified Carlet-Feng functions on 2 s variables are shown to be perfect algebraic immune functions. Furthermore, it is shown that a perfect algebraic immune function behaves good against probabilistic algebraic attacks as well.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract. 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 the Carlet-Feng functions on 2 s +1 variables and the modified Carlet-Feng functions on 2 s variables are shown to be perfect algebraic immune functions. Furthermore, it is shown that a perfect algebraic immune function behaves good against probabilistic algebraic attacks as well.

Key concepts: Algebraic function, Algebraic number, Mathematics, Boolean function, Function (biology), Real algebraic geometry, Power (physics), Dimension of an algebraic variety

Related papers

Back to paper searchBrowse research topicsOriginal source
Perfect Algebraic Immune Functions. — Research Paper | ScholarLens