Correlation properties of an improved summation generator with 2-bit memory (Q1603844)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1768023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Correlation properties of an improved summation generator with 2-bit memory |
scientific article; zbMATH DE number 1768023 |
Statements
Correlation properties of an improved summation generator with 2-bit memory (English)
0 references
15 July 2002
0 references
Recently, \textit{H. J. Lee} and \textit{S. J. Moon} proposed an improved summation generator with 2-bit memory [ibid. 80, 211-217 (2000; Zbl 1037.94542)]. By adding an extra bit of memory in the nonlinear combining function, the proposed generator is claimed to be secure against correlation attacks that the original summation generator suffers. In this paper, we show that the improved generator is still vulnerable to correlation attacks since there exists a high correlation between the input sequences and the output sequences.
0 references
keystream generator
0 references
summation generator
0 references
correlation attack
0 references
cryptanalysis
0 references
0.9192371368408204
0 references
0.8960203528404236
0 references
0.8364306092262268
0 references
