2012•Unpublished venueRequires access

Analysis of Minimum Numbers of Linearly Active S-Boxes of a Class of Generalized Feistel Block Ciphers.

Xiaopei Guo, Kejian Xu, Tongsen Sun, Xiubin Fan

Open publisher page 0 citations

Abstract

Abstract For a class of generalized Feistel block ciphers, an explicit recurrent formula for the minimum numbers of linearly active S-boxes of any round r is presented. Key words block cipher, generalized Feistel structure, linear spread value, the minimum number of linearly active S-boxes 1

About this research paper

What this paper is about

Abstract For a class of generalized Feistel block ciphers, an explicit recurrent formula for the minimum numbers of linearly active S-boxes of any round r is presented. Key words block cipher, generalized Feistel structure, linear spread value, the minimum number of linearly active S-boxes 1

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 For a class of generalized Feistel block ciphers, an explicit recurrent formula for the minimum numbers of linearly active S-boxes of any round r is presented. Key words block cipher, generalized Feistel structure, linear spread value, the minimum number of linearly active S-boxes 1

Key concepts: Block cipher, Mathematics, Class (philosophy), Block (permutation group theory), Arithmetic, Computer science, Combinatorics, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Analysis of Minimum Numbers of Linearly Active S-Boxes of a Class of Generalized Feistel Block Ciphers. — Research Paper | ScholarLens