Coding for privacy with burst adaptive permutations
Valdemar C. da Rocha · 2003
A formal treatment is presented for Al Jabri's (see IEE Electronics Letters, vol.32, no.24, p.2226-7, 1996 and 4th International Symposium on Communication Theory and Applications, Ambleside, Lake District, UK, 13-18, p.197-200, 1997) attack to reconstruct the permutation in secret-key schemes based on single-burst correcting codes. An extension of that technique to attack secret-key cryptosystems based on multi-burst correcting codes is presented and shown to be effective. A new encryption scheme is proposed, using burst-error correcting codes and adaptive permutations, which is resistant to known attacks and is specially tailored to counter Al Jabri's attack.