Rigorously Analyzed Algorithms for the Discrete Logarithm Problem in Quadratic Number Fields
The purpose of this thesis is to study the complexity of the discrete logarithm problem (DLP) and related problems in quadratic orders. The significance of these problems stems in large part from their application in quadratic number field cryptography (QNFC). QNFC was proposed by Buchmann and Willi...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English en |
| Published: |
2004
|
| Online Access: | http://tuprints.ulb.tu-darmstadt.de/494/1/thesis.pdf Vollmer, Ulrich <http://tuprints.ulb.tu-darmstadt.de/view/person/Vollmer=3AUlrich=3A=3A.html> : Rigorously Analyzed Algorithms for the Discrete Logarithm Problem in Quadratic Number Fields. [Online-Edition] Technische Universität, Darmstadt [Ph.D. Thesis], (2004) |
Internet
http://tuprints.ulb.tu-darmstadt.de/494/1/thesis.pdfVollmer, Ulrich <http://tuprints.ulb.tu-darmstadt.de/view/person/Vollmer=3AUlrich=3A=3A.html> : Rigorously Analyzed Algorithms for the Discrete Logarithm Problem in Quadratic Number Fields. [Online-Edition] Technische Universität, Darmstadt [Ph.D. Thesis], (2004)