Linear Complexity of the Discrete Logarithm

被引：0
作者：
Sergei Konyagin
Tanja Lange
Igor Shparlinski
机构：
[1] Moscow State University,Department of Mechanics and Mathematics
[2] University of Essen,Institute of Experimental Mathematics
[3] Macquarie University,Department of Computing
来源：
Designs, Codes and Cryptography | 2003年 / 28卷
关键词：
discrete logarithm; linear recurrence sequences; linear complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We obtain new lower bounds on the linear complexity of several consecutive values of the discrete logarithm modulo a prime p. These bounds generalize and improve several previous results.
引用
收藏
页码：135 / 146
页数：11
相关论文
共 20 条
[1]  
Coppersmith D.(2000)On polynomial approximation of the discrete logarithm and the Diffie- Hellman mapping J. Cryptology 13 339-360
[2]  
Shparlinski I. E.(1997)Linear complexity of generalized cyclotomic binary sequences of order 2 Finite Fields and Their Appl. 3 159-174
[3]  
Ding C.(1998)On cyclotomic generator of order Inform. Proc. Letters 66 21-25
[4]  
Ding C.(2000)Duadic sequences of prime length Discr. Math. 218 33-49
[5]  
Helleseth T.(1998)On the linear complexity of Legendre sequences IEEE Trans. Inform. Theory 44 1276-1278
[6]  
Ding C.(2002)Incomplete character sums and their application to the interpolation of the discrete logarithm by Boolean functions Acta Arith. 101 223-229
[7]  
Helleseth T.(2001)Lower bounds on the linear complexity of the discrete logarithm in finite fields IEEE Trans. Inform. Theory 47 2807-2811
[8]  
Lam K. Y.(1986)A polynomial representation for logarithms in Acta Arith. 47 255-261
[9]  
Ding C.(2002)( Finite Fields and Their Appl. 8 184-192
[10]  
Helleseth T.(2002)) Designs, Codes and Cryptography 25 63-72
12