Speeding up the Discrete Log Computation on Curves with Automorphisms
- 1 January 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Arithmetic on superelliptic curvesMathematics of Computation, 2000
- Improving the parallelized Pollard lambda search on anomalous binary curvesMathematics of Computation, 1999
- Examples of genus two CM curves defined over the rationalsMathematics of Computation, 1999
- Evaluation of discrete logarithms in a group of đť‘ť-torsion points of an elliptic curve in characteristic đť‘ťMathematics of Computation, 1998
- Speeding up Pollard's rho method for computing discrete logarithmsPublished by Springer Nature ,1998
- Efficient construction of secure hyperelliptic discrete logarithm problemsPublished by Springer Nature ,1997
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- ber die Automorphismengruppe eines algebraischen Funktionenk rpers von PrimzahlcharakteristikArchiv der Mathematik, 1973
- Absch tzung der Automorphismenanzahl von Funktionenk rpern bei PrimzahlcharakteristikMathematische Zeitschrift, 1970