|
|||||
|
|
Linear Complexity of the Discrete Logarithm |
|
| Authors: | Sergei Konyagin Tanja Lange Igor Shparlinski |
| Institution: | (1) Department of Mechanics and Mathematics, Moscow State University, Moscow, 119899, Russia;(2) Institute of Experimental Mathematics, University of Essen, Essen, D-45326, Germany;(3) Department of Computing, Macquarie University, Sydney, NSW, 2109, Australia |
| Abstract: | 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. |
| Keywords: | discrete logarithm linear recurrence sequences linear complexity |
| 本文献已被 SpringerLink 等数据库收录！ | |