A Proof of Constructions for Balanced Boolean Function with Optimum Algebraic Immunity
| Autor: | Ya-nan Zhang, Wei Tian, Yindong Chen |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
TheoryofComputation_MISCELLANEOUS
Discrete mathematics General Computer Science Computer Science::Neural and Evolutionary Computation Balanced boolean function Dimension of an algebraic variety Addition theorem Quantitative Biology::Cell Behavior ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Cryptosystem Boolean expression Algebraic function Algebraic number Boolean function Computer Science::Cryptography and Security Mathematics |
| Zdroj: | International Journal of Security and Its Applications. 9:111-122 |
| ISSN: | 1738-9976 |
| DOI: | 10.14257/ijsia.2015.9.2.11 |
| Popis: | Algebraic immunity is a cryptographic criterion for Boolean functions used in cryptosystem to resist algebraic attacks. They usually should have high algebraic immunity. Chen proposed a first order recursive construction of Boolean functions and checked that they had optimum algebraic immunity for n 0. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|