Linear Complexity of the Discrete Logarithm | springerprofessional.de

Register Login

Springer Professional

Javascript needed

Please enable JavaScript on your browser, so that you can use all features of this website.

Top

previous article An Efficient Protocol for Authenticated Key Agr...

next article Quasi-Symmetric Designs with Good Blocks and In...

Hint

Swipe to navigate through the articles of this issue

01-03-2003 | Issue 2/2003

Linear Complexity of the Discrete Logarithm

Journal:: Designs, Codes and Cryptography > Issue 2/2003

Authors:: Sergei Konyagin, Tanja Lange, Igor Shparlinski

» Get access to the full-text

Please log in to get access to this content

Log in Register for free

Advertisement

Title: Linear Complexity of the Discrete Logarithm
Authors:: Sergei Konyagin
Tanja Lange
Igor Shparlinski
Publication date: 01-03-2003
DOI: https://doi.org/10.1023/A:1022584306676
Publisher: Kluwer Academic Publishers
Journal: Designs, Codes and Cryptography An International Journal
Issue 2/2003
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586

Premium Partner

Image Credits

Neuer Inhalt/© ITandMEDIA

Version: 0.1257.0