Improved Greedy Nonrandomness Detectors for Stream Ciphers

Linus Karlsson; Martin Hell; Paul Stankovski

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Improved Greedy Nonrandomness Detectors for Stream Ciphers

Topics: Cryptographic Algorithms

In Proceedings of the 3rd International Conference on Information Systems Security and Privacy ICISSP - Volume 1, 225-232, 2017 , Porto, Portugal

Authors: Linus Karlsson ; Martin Hell and Paul Stankovski

Affiliation: Lund University, Sweden

Keyword(s): Maximum Degree Monomial, Distinguisher, Nonrandomness Detector, Grain-128a, Grain-128.

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.141.31.209

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 - ICISSP; ISBN 978-989-758-209-7; ISSN 2184-4356, SciTePress, pages 225-232. DOI: 10.5220/0006268202250232

@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 - ICISSP},
year={2017},
pages={225-232},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006268202250232},
isbn={978-989-758-209-7},
issn={2184-4356},
}

TY - CONF

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