Improved Greedy Nonrandomness Detectors for Stream Ciphers

Linus Karlsson; Martin Hell; Paul Stankovski

Improved Greedy Nonrandomness Detectors for Stream Ciphers

Linus Karlsson, Martin Hell, Paul Stankovski

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

353 Nedladdningar (Pure)

Sammanfattning

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.

Originalspråk	engelska
Titel på värdpublikation	Proceedings of the 3rd International Conference on Information Systems Security and Privacy
Utgivningsort	Porto, Portugal
Förlag	SciTePress
Sidor	225-232
Antal sidor	8
Volym	1
ISBN (elektroniskt)	978-989-758-209-7
Status	Published - 2017 feb.
Evenemang	International Conference on Information Systems Security and Privacy - Porto, Portugal Varaktighet: 2017 feb. 19 → 2017 feb. 21 Konferensnummer: 3 http://icissp.org

Konferens

Konferens	International Conference on Information Systems Security and Privacy
Förkortad titel	ICISSP
Land/Territorium	Portugal
Ort	Porto
Period	2017/02/19 → 2017/02/21
Internetadress	http://icissp.org

Ämnesklassifikation (UKÄ)

Datorsystem

Tillgång till dokument

Karlsson_ImprovedGreedyAccepterat manuskript från författare, 187 KB

Citera det här

@inproceedings{6be91029e8484182838a5d066e44301b,

title = "Improved Greedy Nonrandomness Detectors for Stream Ciphers",

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.",

author = "Linus Karlsson and Martin Hell and Paul Stankovski",

year = "2017",

month = feb,

language = "English",

volume = "1",

pages = "225--232",

booktitle = "Proceedings of the 3rd International Conference on Information Systems Security and Privacy",

publisher = "SciTePress",

note = "International Conference on Information Systems Security and Privacy, ICISSP ; Conference date: 19-02-2017 Through 21-02-2017",

url = "http://icissp.org",

}

TY - GEN

T1 - Improved Greedy Nonrandomness Detectors for Stream Ciphers

AU - Karlsson, Linus

AU - Hell, Martin

AU - Stankovski, Paul

N1 - Conference code: 3

PY - 2017/2

Y1 - 2017/2

N2 - 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.

AB - 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.

M3 - Paper in conference proceeding

VL - 1

SP - 225

EP - 232

BT - Proceedings of the 3rd International Conference on Information Systems Security and Privacy

PB - SciTePress

CY - Porto, Portugal

T2 - International Conference on Information Systems Security and Privacy

Y2 - 19 February 2017 through 21 February 2017

ER -

Improved Greedy Nonrandomness Detectors for Stream Ciphers

Sammanfattning

Konferens

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här