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

DOI10.1007/978-3-642-02620-1_9zbMath1307.94042OpenAlexW1721636290MaRDI QIDQ3634488

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Probabilistic and statistical methods in cryptology. An introduction by selected topics.
• On a new law of large numbers
• Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences
• A fast string searching algorithm
• On Independence and Sensitivity of Statistical Randomness Tests