Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Improved Greedy Nonrandomness Detectors for Stream Ciphers

Karlsson, Linus LU orcid ; Hell, Martin LU and Stankovski, Paul LU orcid (2017) International Conference on Information Systems Security and Privacy 1. p.225-232
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.
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
Proceedings of the 3rd International Conference on Information Systems Security and Privacy
volume
1
pages
8 pages
publisher
SciTePress
conference name
International Conference on Information Systems Security and Privacy
conference location
Porto, Portugal
conference dates
2017-02-19 - 2017-02-21
external identifiers
  • scopus:85049089747
ISBN
978-989-758-209-7
language
English
LU publication?
yes
id
6be91029-e848-4182-838a-5d066e44301b
date added to LUP
2017-03-20 16:18:02
date last changed
2024-11-11 05:51:01
@inproceedings{6be91029-e848-4182-838a-5d066e44301b,
  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       = {{Karlsson, Linus and Hell, Martin and Stankovski, Paul}},
  booktitle    = {{Proceedings of the 3rd International Conference on Information Systems Security and Privacy}},
  isbn         = {{978-989-758-209-7}},
  language     = {{eng}},
  pages        = {{225--232}},
  publisher    = {{SciTePress}},
  title        = {{Improved Greedy Nonrandomness Detectors for Stream Ciphers}},
  url          = {{https://lup.lub.lu.se/search/files/22842712/Karlsson_ImprovedGreedy.pdf}},
  volume       = {{1}},
  year         = {{2017}},
}