Name
Abstract | ||
|---|---|---|
This paper scrutinizes the structure of jump-controlled LFSRs for resistance against generalized correlation attack based upon Constrained Levenshtein Distance(CLD) measure. It proves that for a given number of cipher text bits, CLD computation is independent of Jump index. However, based upon the inherent relation between the jump index and deletion rate, it is argued that structures utilizing primitive polynomials with large values of jump indices are relatively safer against generalized correlation attack when compared with their counterparts. The paper also presents a novel recursive algorithm for efficient computation of CLD for jump controlled structures and another algorithm to defeat the complexity induced due to high deletion rates. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CIT.2010.195 | CIT |
Keywords | Field | DocType |
jump-controlled linear feedback shift register,cryptography,generalized correlation attack,cipher text bits,edit distance attack,primitive polynomials,cipher text bit,efficient computation,inherent relation,linear finite state machine,cld computation,high deletion rate,shift registers,constrained levenshtein distance,recursive algorithm,novel recursive algorithm,constrained levenshtein distance measure,deletion rate,lfsrs jump,jump controlling,polynomials,jump index,finite state machine,edit distance,indexation,indexes,primitive polynomial,zinc,correlation | Recursion (computer science),Polynomial,Computer science,Cryptography,Algorithm,Levenshtein distance,Correlation attack,Ciphertext,Jump,Computation | Conference |
ISBN | Citations | PageRank |
978-1-4244-7547-6 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mujahid Mohsin | 1 | 10 | 2.53 |
| Mehreen Afzal | 2 | 15 | 4.86 |
| Muhammad Arif Wahla | 3 | 13 | 3.17 |