Fast Correlation Attacks on the Summation Generator |
| |
| Authors: | Jovan Dj Golic Mahmoud Salmasizadeh Ed Dawson |
| |
| Affiliation: | (1) School of Electrical Engineering, University of Belgrade, Bulevar Revolucije 73, 10001 Belgrade, Yugoslavia golic@galeb.etg.bg.ac.yu, YU;(2) Electronic Research Centre, Sharif University of Technology, P.O. Box 11365-8639, Tehran, Iran, IR;(3) Information Security Research Centre, Queensland University of Technology, GPO Box 2434, Brisbane, Queensland 4001, Australia, AU |
| |
| Abstract: | The linear sequential circuit approximation method for combiners with memory is used to find mutually correlated linear transforms
of the input and output sequences in the well-known summation generator with any number of inputs. It is shown that the determined
correlation coefficient is large enough for applying a fast correlation attack to the output sequence to reconstruct the initial
states of the input linear feedback shift registers. The proposed attack is based on iterative probabilistic decoding and
appropriately generated low-weight parity-checks. The required output sequence length and the computational complexity are
both derived. Successful experimental results for the summation generators with three and five inputs are obtained.
Received 13 December 1996 and revised 7 October 1998 |
| |
| Keywords: | , Summation generator, Correlation attacks, Linear approximations, Correlation coefficients, Parity-checks, |
| 本文献已被 SpringerLink 等数据库收录！ |
|
