Improved Greedy Nonrandomness Detectors for Stream Ciphers

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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.

Detaljer

Författare
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Datorsystem
Originalspråkengelska
Titel på värdpublikationProceedings of the 3rd International Conference on Information Systems Security and Privacy
UtgivningsortPorto, Portugal
FörlagSciTePress
Sidor225-232
Antal sidor8
Volym1
ISBN (elektroniskt)978-989-758-209-7
StatusPublished - 2017 feb
PublikationskategoriForskning
Peer review utfördJa
EvenemangInternational Conference on Information Systems Security and Privacy - Porto, Portugal
Varaktighet: 2017 feb 192017 feb 21
Konferensnummer: 3
http://icissp.org

Konferens

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

Nedladdningar

Ingen tillgänglig data