Abstract
An embedding attack based on constraint Lenvenshtein distance was proposed by Golic and Mihaljevic to analyze a statistical model of a key stream generator which contains an additive noise of probability p, where any value of p ＜ 1/2 is possible. This attack is significant only if the embedding error caused by the noise is less than that caused by an incorrect candidate initial state. We show that this condition is not satisfied when p ≧ 1/4.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
