Abstract
We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the desired computational complexity. We test the algorithm on the stream ciphers Grain-128a and Grain-128, and achieve significantly better results compared to an earlier greedy approach.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 3rd International Conference on Information Systems Security and Privacy |
| Place of Publication | Porto, Portugal |
| Publisher | SciTePress |
| Pages | 225-232 |
| Number of pages | 8 |
| Volume | 1 |
| ISBN (Electronic) | 978-989-758-209-7 |
| Publication status | Published - 2017 Feb |
| Event | International Conference on Information Systems Security and Privacy - Porto, Portugal Duration: 2017 Feb 19 → 2017 Feb 21 Conference number: 3 http://icissp.org |
Conference
| Conference | International Conference on Information Systems Security and Privacy |
|---|---|
| Abbreviated title | ICISSP |
| Country/Territory | Portugal |
| City | Porto |
| Period | 2017/02/19 → 2017/02/21 |
| Internet address |
Subject classification (UKÄ)
- Computer Systems