Improved Greedy Nonrandomness Detectors for Stream Ciphers

Research output: Chapter in Book/Report/Conference proceedingPaper in conference 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.

Details

Authors
Organisations
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Computer Systems
Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference on Information Systems Security and Privacy
Place of PublicationPorto, Portugal
PublisherSciTePress
Pages225-232
Number of pages8
Volume1
ISBN (Electronic)978-989-758-209-7
StatePublished - 2017 Feb
Peer-reviewedYes
EventInternational Conference on Information Systems Security and Privacy - Porto, Portugal
Duration: 2017 Feb 192017 Feb 21
Conference number: 3
http://icissp.org

Conference

ConferenceInternational Conference on Information Systems Security and Privacy
Abbreviated titleICISSP
CountryPortugal
CityPorto
Period2017/02/192017/02/21
Internet address

Total downloads

No data available