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 |
| Number of pages | 12 |
| Journal | Designs, Codes and Cryptography |
| Volume | 28 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Mar 2003 |
Keywords
- discrete logarithm
- linear complexity
- linear recurrence sequences
Fingerprint
Dive into the research topics of 'Linear complexity of the discrete logarithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver