Linear Distinguishing Attack on Shannon Algorithm

Chang  Ya-Qin; Jin Chen-Hui

doi:10.3724/SP.J.1146.2009.01626

Volume 33 Issue 1

Feb. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2011 > 33(1): 190-193

Chang Ya-Qin, Jin Chen-Hui. Linear Distinguishing Attack on Shannon Algorithm[J]. Journal of Electronics & Information Technology, 2011, 33(1): 190-193. doi: 10.3724/SP.J.1146.2009.01626

Citation:

Chang Ya-Qin, Jin Chen-Hui. Linear Distinguishing Attack on Shannon Algorithm[J]. Journal of Electronics & Information Technology, 2011, 33(1): 190-193. doi: 10.3724/SP.J.1146.2009.01626

Chang Ya-Qin, Jin Chen-Hui. Linear Distinguishing Attack on Shannon Algorithm[J]. Journal of Electronics & Information Technology, 2011, 33(1): 190-193. doi: 10.3724/SP.J.1146.2009.01626

Citation:

Chang Ya-Qin, Jin Chen-Hui. Linear Distinguishing Attack on Shannon Algorithm[J]. Journal of Electronics & Information Technology, 2011, 33(1): 190-193. doi: 10.3724/SP.J.1146.2009.01626

PDF( 183 KB)

Linear Distinguishing Attack on Shannon Algorithm

doi: 10.3724/SP.J.1146.2009.01626

Chang Ya-Qin^{* 金晨辉
,},
Jin Chen-Hui

Received Date: 2009-12-22
Rev Recd Date: 2010-09-14
Publish Date: 2011-01-19

Abstract

Abstract

A new distinguishing attack is presented on Shannon algorithm. The distinguish attack is built by using linear approximations of both the non-linear feedback shift register and the non-linear filtration function, and 32 distinguishers are derived which the bias is 2-28. Therefore, the Shannon algorithm is distinguishable from truly random cipher after observing 252 keystreams words on average.
- Stream ciphers,
- Distinguishing attack,
- Linear approximations,
- Non-linear Feedback Shift Register (NFSR),
- Shannon algorithm