Testing Stream Ciphers by Finding the Longest Substring of a Given Density

DOI10.1007/978-3-642-02620-1_9MaRDI QIDQ3634488zbMATH OpenOpenAlexFDO

Authors Serdar Boztaş, Simon J. Puglisi, Andrew Turpin

Publication date 25 June 2009

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02620-1_9

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Searching a bitstream in linear time for the longest substring of any given density
• Testing randomness via aperiodic words
• Randomness measures related to subset occurrence
• New statistical randomness tests based on length of runs
• On Lempel-Ziv Complexity of Sequences

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• A fast string searching algorithm
• Fast and space-efficient location of heavy or dense segments in run-length encoded sequences (extended abstract)
• On Independence and Sensitivity of Statistical Randomness Tests
• On a new law of large numbers
• Probabilistic and statistical methods in cryptology. An introduction by selected topics.
• The Erdős-Rényi law in distribution, for coin tossing and sequence matching
• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches

Cited in

(1)

• Searching a bitstream in linear time for the longest substring of any given density

This page was built for publication: Testing Stream Ciphers by Finding the Longest Substring of a Given Density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634488)