Improved Greedy Nonrandomness Detectors for Stream Ciphers

Linus Karlsson, Martin Hell, Paul Stankovski

2017

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.

Paper Citation

in Harvard Style

Karlsson L., Hell M. and Stankovski P. (2017). Improved Greedy Nonrandomness Detectors for Stream Ciphers . In Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-209-7, pages 225-232. DOI: 10.5220/0006268202250232

in Bibtex Style

@conference{icissp17,
author={Linus Karlsson and Martin Hell and Paul Stankovski},
title={Improved Greedy Nonrandomness Detectors for Stream Ciphers},
booktitle={Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2017},
pages={225-232},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006268202250232},
isbn={978-989-758-209-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Improved Greedy Nonrandomness Detectors for Stream Ciphers
SN - 978-989-758-209-7
AU - Karlsson L.
AU - Hell M.
AU - Stankovski P.
PY - 2017
SP - 225
EP - 232
DO - 10.5220/0006268202250232