Correlation Measure of Order k and Linear Complexity Profile of Legendre-Sidelnikov Sequences

2012 ◽  
Vol E95.A (11) ◽  
pp. 1851-1854 ◽  
Author(s):  
Ming SU ◽  
Arne WINTERHOF
Keyword(s):  
Linear Complexity ◽  
Correlation Measure ◽  
Linear Complexity Profile

scholarly journals On the Pseudorandomness of the Liouville Function of Polynomials over a Finite Field

2016 ◽  
Vol 11 (1) ◽  
pp. 47-58
Author(s):  
László Mérai ◽  
Arne Winterhof
Keyword(s):  
Finite Field ◽  
Linear Complexity ◽  
Möbius Function ◽  
Correlation Measure ◽  
Liouville Function ◽  
Mobius Function ◽  
Linear Complexity Profile

AbstractWe study several pseudorandom properties of the Liouville function and the Möbius function of polynomials over a finite field. More precisely, we obtain bounds on their balancedness as well as their well-distribution measure, correlation measure, and linear complexity profile.

Linear complexity profile and correlation measure of interleaved sequences

2015 ◽  
Vol 7 (4) ◽  
pp. 497-508 ◽  
Author(s):  
Jing Jane He ◽  
Daniel Panario ◽  
Qiang Wang ◽  
Arne Winterhof
Keyword(s):  
Linear Complexity ◽  
Correlation Measure ◽  
Linear Complexity Profile

scholarly journals Perfect linear complexity profile and apwenian sequences

2020 ◽  
Vol 68 ◽  
pp. 101761
Author(s):  
Jean-Paul Allouche ◽  
Guo-Niu Han ◽  
Harald Niederreiter
Keyword(s):  
Linear Complexity ◽  
Linear Complexity Profile

scholarly journals On the use of expansion series for stream ciphers

2012 ◽  
Vol 15 ◽  
pp. 326-340 ◽  
Author(s):  
Claus Diem
Keyword(s):  
Power Series ◽  
Finite Fields ◽  
Linear Complexity ◽  
Stream Ciphers ◽  
Series Expansions ◽  
Expansion Series ◽  
Power Series Expansions ◽  
Curves Over Finite Fields ◽  
Linear Complexity Profile ◽  
Natural Way

AbstractFrom power series expansions of functions on curves over finite fields, one can obtain sequences with perfect or almost perfect linear complexity profile. It has been suggested by various authors to use such sequences as key streams for stream ciphers. In this work, we show how long parts of such sequences can be computed efficiently from short ones. Such sequences should therefore be considered to be cryptographically weak. Our attack leads in a natural way to a new measure of the complexity of sequences which we call expansion complexity.

Sign in / Sign up

Export Citation Format

Share Document