On the Cross‐Correlation Distribution of
            <i>d</i>
            ‐Ary Generalized Legendre‐Sidelnikov Sequences

Ke, Pinhui; Ye, Zhifan; Zhang, Shengyuan; Chang, Zuling

doi:10.1049/cje.2017.12.004

Cited by 3 publications

(13 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 4 Assume that the binary sequence s = s 0 s 1 • • • , where s i = Tr n 1 [(aα i + b) −1 ]. We can find a sequence s (1) = s…”

Section: Tr(smentioning

confidence: 99%

“…Spectra attacks can be improved by introducing two sequences with relatively small linear complexities, that is, by finding two sequences s (1) and s (2) satisfying s (2) = s • s (1) , where s…”

Section: Modified Fast Spectra Attackmentioning

confidence: 99%

“…i , for i = 0, 1, • • • and l(s (1) ) + l(s (2) ) < l(s), the required keystream bits can be cut down from l(s) to l(s (1) ) + l(s (2) ). The data complexity will be largely reduced if l(s (1) ) + l(s (2) ) << l(s).…”

Section: Modified Fast Spectra Attackmentioning

confidence: 99%

“…Stream ciphers usually are produced by a pseudorandom sequence generator, which has wide application in communication [ 1–4 ] and cryptography [ 5–9 ] . Due to simple implementation and large throughput, stream ciphers have received much attention in modern cryptography.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Security Analysis of A Stream Cipher with Proven Properties

Gao

Li²

2021

Chinese J of Electronics

View full text Add to dashboard Cite

Si and Ding proposed a stream cipher with two keys (the first and the second key) and an expected security strength. To further measure the security, we analyze the stream cipher by considering the selective discrete Fourier spectra attack and the fast selective discrete Fourier spectra attack. The two attacks reveal a fact that the second key is more important than the first key, that is, if the second key is leaked out, the first key can be obtained with a lower time complexity than that of the expected security. In addition, we analyze the ability of the stream cipher to resist the guess‐and‐determine attack. The results show an attacker is able to gain the two keys with an exponentially improved time complexity and a polynomial data complexity. It implies that we need a securer permutation over finite fields to design a new binary additive stream cipher to achieve the expected security level.

show abstract

“…Theorem 4 Assume that the binary sequence s = s 0 s 1 • • • , where s i = Tr n 1 [(aα i + b) −1 ]. We can find a sequence s (1) = s…”

Section: Tr(smentioning

confidence: 99%

Section: Modified Fast Spectra Attackmentioning

confidence: 99%

Section: Modified Fast Spectra Attackmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Security Analysis of A Stream Cipher with Proven Properties

Gao

Li²

2021

Chinese J of Electronics

View full text Add to dashboard Cite

show abstract

“…over GF (5). Following is the main result of this paper, based on which an efficient algorithm of computing the linear complexity of the sequence in Eq.…”

Section: Introductionmentioning

confidence: 99%