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