Title | ||
---|---|---|
A Family Constructions of Odd-Variable Boolean Function with Optimum Algebraic Immunity. |
Abstract | ||
---|---|---|
Algebraic immunity is a novel cryptographic criterion proposed to against algebraic attacks. In order to resist algebraic attacks. Boolean functions used in cryptosystem should have high algebraic immunity. This paper generalizes Dalai's and Chen's constructions, and gets a new family constructions for odd-variable Boolean function with optimum algebraic immunity. By employing different transformations of Boolean functions, there would generate different constructions. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1007/978-3-642-27189-2_5 | Communications in Computer and Information Science |
Keywords | Field | DocType |
algebraic attacks,Boolean function,algebraic immunity,recursive construction | Boolean function,Discrete mathematics,Dimension of an algebraic variety,Algebraic number,Algebra,Parity function,Algebraic function,Algebraic extension,Real algebraic geometry,Boolean expression,Mathematics | Conference |
Volume | Issue | ISSN |
259 | null | 1865-0929 |
Citations | PageRank | References |
0 | 0.34 | 23 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yindong Chen | 1 | 15 | 8.07 |