scholarly journals The determinant of random power series matrices over finite fields

2000 ◽  
Vol 315 (1-3) ◽  
pp. 139-144 ◽  
Author(s):  
Khaled A.S. Abdel-Ghaffar
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.


2011 ◽  
Vol 36 (1) ◽  
pp. 213 ◽  
Author(s):  
Antonios Bisbas ◽  
Jörg Neunhäuserer

1959 ◽  
Vol 6 (4) ◽  
pp. 343-347 ◽  
Author(s):  
A. Dvoretzky ◽  
P. Erdős

2001 ◽  
Vol 64 (1) ◽  
pp. 121-129
Author(s):  
Andrew J. Spencer

For some of the classical groups over finite fields it is possible to express the proportion of eigenvalue-free matrices in terms of generating functions. We prove a theorem on the monotonicity of the coefficients of powers of power series and apply this to the generating functions of the general linear, symplectic and orthogonal groups. This proves a conjecture on the monotonicity of the proportions of eigenvalue-free elements in these groups.


Sign in / Sign up

Export Citation Format

Share Document