Koblitz curves over quadratic fields
From MaRDI portal
Publication:2318090
DOI10.1007/s00145-018-9294-zzbMath1466.94034OpenAlexW2801341723WikidataQ129911932 ScholiaQ129911932MaRDI QIDQ2318090
Thomaz Oliveira, Julio López, Daniel Cervantes-Vázquez, Francisco Rodríguez-Henríquez
Publication date: 13 August 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9294-z
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (4)
Extending the GLS endomorphism to speed up GHS Weil descent using Magma ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Kummer for genus one over prime-order fields ⋮ Koblitz curves
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calculating optimal addition chains
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Recent progress on the elliptic curve discrete logarithm problem
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces
- Constructive and destructive facets of Weil descent on elliptic curves
- A one round protocol for tripartite Diffie-Hellman
- Efficient arithmetic on Koblitz curves
- Endomorphisms of Abelian varieties over finite fields
- A general framework for subexponential discrete logarithm algorithms
- Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation
- Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster
- Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
- Side-Channel Analysis of Weierstrass and Koblitz Curve ECDSA on Android Smartphones
- Point Decomposition Problem in Binary Elliptic Curves
- Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
- Faster Implementation of Scalar Multiplication on Koblitz Curves
- Kummer Strikes Back: New DH Speed Records
- Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication
- Fast evaluation of logarithms in fields of characteristic two
- Computing Logarithms in Finite Fields of Characteristic Two
- Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Exponent Recoding and Regular Exponentiation Algorithms
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Elliptic Curve Cryptosystems
- Reducing elliptic curve logarithms to logarithms in a finite field
- Improving the parallelized Pollard lambda search on anomalous binary curves
- Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
- Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
- Advances in Cryptology - EUROCRYPT 2004
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Information Security and Privacy
This page was built for publication: Koblitz curves over quadratic fields
