Not so greedy: Enhanced subset exploration for nonrandomness detectors

Linus Karlsson, Martin Hell, Paul Stankovski

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

188 Nedladdningar (Pure)

Sammanfattning

Distinguishers and nonrandomness detectors are used to distinguish ciphertext from random data. In this paper, we focus on the construction of such devices using the maximum degree monomial test. This requires the selection of certain subsets of key and IV-bits of the cipher, and since this selection to a great extent affects the final outcome, it is important to make a good selection. We present a new, generic and tunable algorithm to find such subsets. Our algorithm works on any stream cipher, and can easily be tuned to the desired computational complexity. We test our algorithm with both different input parameters and different ciphers, namely Grain-128a, Kreyvium and Grain-128. Compared to a previous greedy approach, our algorithm consistently provides better results.

Originalspråkengelska
Titel på värdpublikationInformation Systems Security and Privacy - 3rd International Conference, ICISSP 2017, Revised Selected Papers
FörlagSpringer
Sidor273-294
Antal sidor22
ISBN (tryckt)9783319933535
DOI
StatusPublished - 2018 jan. 1
EvenemangInternational Conference on Information Systems Security and Privacy - Porto, Portugal
Varaktighet: 2017 feb. 192017 feb. 21
Konferensnummer: 3
http://icissp.org

Publikationsserier

NamnCommunications in Computer and Information Science
Volym867
ISSN (tryckt)1865-0929

Konferens

KonferensInternational Conference on Information Systems Security and Privacy
Förkortad titelICISSP
Land/TerritoriumPortugal
OrtPorto
Period2017/02/192017/02/21
Internetadress

Ämnesklassifikation (UKÄ)

  • Signalbehandling

Fingeravtryck

Utforska forskningsämnen för ”Not so greedy: Enhanced subset exploration for nonrandomness detectors”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här