Algebraic Immunity of Boolean Functions - Analysis and Construction
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Instituto Politécnico Nacional
2009
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876484960607535104 |
|---|---|
| author | Deepak Kumar Dalai |
| author_facet | Deepak Kumar Dalai |
| contents | Algebraic Immunity of Boolean Functions - Analysis and Construction Deepak Kumar Dalai Subhamoy Maitra Computación Annihilators Algebraic Attacks Boolean Functions Algebraic Normal Form Fast Algebraic Attacks In this paper, we first analyse the method of finding algebraic immunity of a Boolean function. Given a Boolean function f on n-variables, we identify a reduced set of homogeneous linear equations by solving which one can decide whether there exist annihilators of f at a specific degree. Moreover, we analyse how an affine transformation on the input variables of f can be exploited to achieve further reduction in the set of homogeneous linear equations. Next, from the design point of view, we construct balanced Boolean functions with maximum possible AI with an additional property which is necessary to resist the fast algebraic attack. 2009 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61513252005 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.3 Vol.12 |
| format | Artículo científico |
| id | redalyc_61513252005 |
| institution | Redalyc |
| language | en |
| publishDate | 2009 |
| publisher | Instituto Politécnico Nacional |
| spellingShingle | Algebraic Immunity of Boolean Functions - Analysis and Construction Deepak Kumar Dalai Computación Annihilators Algebraic Attacks Boolean Functions Algebraic Normal Form Fast Algebraic Attacks Algebraic Immunity of Boolean Functions - Analysis and Construction Deepak Kumar Dalai Subhamoy Maitra Computación Annihilators Algebraic Attacks Boolean Functions Algebraic Normal Form Fast Algebraic Attacks In this paper, we first analyse the method of finding algebraic immunity of a Boolean function. Given a Boolean function f on n-variables, we identify a reduced set of homogeneous linear equations by solving which one can decide whether there exist annihilators of f at a specific degree. Moreover, we analyse how an affine transformation on the input variables of f can be exploited to achieve further reduction in the set of homogeneous linear equations. Next, from the design point of view, we construct balanced Boolean functions with maximum possible AI with an additional property which is necessary to resist the fast algebraic attack. 2009 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61513252005 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.3 Vol.12 |
| title | Algebraic Immunity of Boolean Functions - Analysis and Construction |
| topic | Computación Annihilators Algebraic Attacks Boolean Functions Algebraic Normal Form Fast Algebraic Attacks |
| url | https://www.redalyc.org/articulo.oa?id=61513252005 |