scholarly journals On the linear complexity profile of some sequences derived from elliptic curves

2015 ◽  
Vol 81 (2) ◽  
pp. 259-267 ◽  
Author(s):  
László Mérai ◽  
Arne Winterhof
2020 ◽  
Vol 68 ◽  
pp. 101761
Author(s):  
Jean-Paul Allouche ◽  
Guo-Niu Han ◽  
Harald Niederreiter

2012 ◽  
Vol 15 ◽  
pp. 326-340 ◽  
Author(s):  
Claus Diem

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