Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.09288 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913314822422528 |
|---|---|
| author | Tatarkiewicz, Jan J. Kuzmicz, Wieslaw B. |
| author_facet | Tatarkiewicz, Jan J. Kuzmicz, Wieslaw B. |
| contents | We present a novel, computationally simple method of hiding any message in the stream of random bits by using a secret key. The method is called Bury Among Random Numbers (BARN). A stream of random bits is produced by extracting the entropy of a physical process in a hardware-based true random number generator (TRNG). The process of placing bits of a message into the stream of random bits is governed by the number of random bits skipped between subsequent insertions. The set of numbers that correspond to the steps of BARN is derived from a random number also provided by TRNG. Hence BARN cipher does not depend on any arithmetic function. We propose an effective method of computing random keys from a given number of random bits. We estimate the number of permutations that need to be tested during a brute-force attack on the new cipher for various key lengths. Some practical applications for the new class of symmetrical ciphers are discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_09288 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | New Class of Ciphers Using Hardware Entropy Source Tatarkiewicz, Jan J. Kuzmicz, Wieslaw B. Cryptography and Security We present a novel, computationally simple method of hiding any message in the stream of random bits by using a secret key. The method is called Bury Among Random Numbers (BARN). A stream of random bits is produced by extracting the entropy of a physical process in a hardware-based true random number generator (TRNG). The process of placing bits of a message into the stream of random bits is governed by the number of random bits skipped between subsequent insertions. The set of numbers that correspond to the steps of BARN is derived from a random number also provided by TRNG. Hence BARN cipher does not depend on any arithmetic function. We propose an effective method of computing random keys from a given number of random bits. We estimate the number of permutations that need to be tested during a brute-force attack on the new cipher for various key lengths. Some practical applications for the new class of symmetrical ciphers are discussed. |
| title | New Class of Ciphers Using Hardware Entropy Source |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2404.09288 |