Loading...
Please wait, while we are loading the content...
Similar Documents
On Edit Distance Attack to Alternating Step Generator
| Content Provider | Semantic Scholar |
|---|---|
| Author | Jiang, Shaoquan Gong, Guang |
| Copyright Year | 2003 |
| Abstract | Edit distance between two binary input strings and one binary output string was introduced to attack alternating step generator by Golic and Menicocci. This attack is successful only if the maximal, average and minimal conditional probability of the zero distance, given a key stream of length n, approach zero exponentially. In this paper, using the run property of binary sequences, we prove the average and minimal conditional probability of zero distance exponentially approach zero with n. We also prove if there exists N such that the maximal conditional probability of zero distance of length N is less than 12(N+1), then the maximal conditional probability of zero distance will exponentially approach zero. |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/978-1-4615-0304-0_10 |
| Alternate Webpage(s) | http://comsec.uwaterloo.ca/download/cacr-bound.pdf |
| Alternate Webpage(s) | http://www.researchgate.net/profile/Shaoquan_Jiang/publication/228995612_On_edit_distance_attack_to_alternating_step_generator/links/0deec52ef89d0b4b32000000.pdf |
| Alternate Webpage(s) | https://doi.org/10.1007/978-1-4615-0304-0_10 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
