Linear complexity of the discrete logarithm

S. Konyagin; T. Lange; I.E. Shparlinski

doi:10.1023/A:1022584306676

Linear complexity of the discrete logarithm

S. Konyagin, T. Lange, I.E. Shparlinski

Research output: Contribution to journal › Article › Academic › peer-review

13 Citations (Scopus)

1 Downloads (Pure)

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.

Original language	English
Pages (from-to)	135-146
Journal	Designs, Codes and Cryptography
Volume	28
Issue number	2
DOIs	https://doi.org/10.1023/A:1022584306676
Publication status	Published - 2003

Access to Document

10.1023/A:1022584306676

Cite this

@article{8b82dfd81cae449fabc2b24815c9ad95,

title = "Linear complexity of the discrete logarithm",

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.",

author = "S. Konyagin and T. Lange and I.E. Shparlinski",

year = "2003",

doi = "10.1023/A:1022584306676",

language = "English",

volume = "28",

pages = "135--146",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - Linear complexity of the discrete logarithm

AU - Konyagin, S.

AU - Lange, T.

AU - Shparlinski, I.E.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

U2 - 10.1023/A:1022584306676

DO - 10.1023/A:1022584306676

M3 - Article

SN - 0925-1022

VL - 28

SP - 135

EP - 146

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

IS - 2

ER -

Linear complexity of the discrete logarithm

Abstract

Access to Document

Fingerprint

Cite this