Cryptographic properties of Boolean functions defining elementary cellular automata
Data(s) |
01/01/2011
|
---|---|
Resumo |
In this work, the algebraic properties of the local transition functions of elementary cellular automata (ECA) were analysed. Specifically, a classification of such cellular automata was done according to their algebraic degree, the balancedness, the resiliency, nonlinearity, the propagation criterion and the existence of non-zero linear structures. It is shown that there is not any ECA satisfying all properties at the same time. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
eng |
Publicador |
E.U.I.T. Industrial (UPM) |
Relação |
http://oa.upm.es/15265/1/INVE_MEM_2011_121543.pdf http://www.tandfonline.com/doi/full/10.1080/00207160903530957 info:eu-repo/semantics/altIdentifier/doi/10.1080/00207160903530957 |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
International Journal of Computer Mathematics, ISSN 0020-7160, 2011-01, Vol. 88, No. 2 |
Palavras-Chave | #Matemáticas |
Tipo |
info:eu-repo/semantics/article Artículo PeerReviewed |