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

Serdar Boztas, Simon J. Puglisi, Andrew Turpin. Testing Stream Ciphers by Finding the Longest Substring of a Given Density. In Colin Boyd, Juan Manuel González Nieto, editors, Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 1-3, 2009, Proceedings. Volume 5594 of Lecture Notes in Computer Science, pages 122-133, Springer, 2009. [doi]

@inproceedings{BoztasPT09,
  title = {Testing Stream Ciphers by Finding the Longest Substring of a Given Density},
  author = {Serdar Boztas and Simon J. Puglisi and Andrew Turpin},
  year = {2009},
  doi = {10.1007/978-3-642-02620-1_9},
  url = {http://dx.doi.org/10.1007/978-3-642-02620-1_9},
  tags = {testing},
  researchr = {https://researchr.org/publication/BoztasPT09},
  cites = {0},
  citedby = {0},
  pages = {122-133},
  booktitle = {Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 1-3, 2009, Proceedings},
  editor = {Colin Boyd and Juan Manuel González Nieto},
  volume = {5594},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-02619-5},
}