Testing Stream Ciphers by Finding the Longest Substring of a Given Density - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Serdar Boztas' in GoogleThis author has not been identified. Look up 'Simon J. Puglisi' in GoogleThis author has not been identified. Look up 'Andrew Turpin' in Google

runs on WebDSL