Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2211.07626 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918452672856064 |
|---|---|
| author | Andrecut, M. |
| author_facet | Andrecut, M. |
| contents | We discuss a class of cellular automata (CA) able to produce long random strings, starting from short "seed" strings. The approach uses two principles borrowed from cryptography: diffusion and confusion. We show numerically that the strings are pseudo-random using three approaches based on: Fourier transform, entropy estimation, and compression. An application to cryptography is also included with the corresponding Python code. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_07626 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Growing Random Strings in CA Andrecut, M. Cryptography and Security We discuss a class of cellular automata (CA) able to produce long random strings, starting from short "seed" strings. The approach uses two principles borrowed from cryptography: diffusion and confusion. We show numerically that the strings are pseudo-random using three approaches based on: Fourier transform, entropy estimation, and compression. An application to cryptography is also included with the corresponding Python code. |
| title | Growing Random Strings in CA |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2211.07626 |