Testing a cellular automata construction method to obtain 9-variable cryptographic Boolean functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909457704812544 |
|---|---|
| author | Prévost, Thomas Martin, Bruno |
| author_facet | Prévost, Thomas Martin, Bruno |
| contents | We propose a method for constructing 9-variable cryptographic Boolean functions from the iterates of 5-variable cellular automata rules. We then analyze, for important cryptographic properties of 5-variable cellular automata rules, how they are preserved after extension to 9-variable Boolean functions. For each cryptographic property, we analyze the proportion of 5-variable cellular automata rules that preserve it for each of the 48 affine equivalence classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_09380 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Testing a cellular automata construction method to obtain 9-variable cryptographic Boolean functions Prévost, Thomas Martin, Bruno Cryptography and Security We propose a method for constructing 9-variable cryptographic Boolean functions from the iterates of 5-variable cellular automata rules. We then analyze, for important cryptographic properties of 5-variable cellular automata rules, how they are preserved after extension to 9-variable Boolean functions. For each cryptographic property, we analyze the proportion of 5-variable cellular automata rules that preserve it for each of the 48 affine equivalence classes. |
| title | Testing a cellular automata construction method to obtain 9-variable cryptographic Boolean functions |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2501.09380 |