Cited in
(74)- Efficient implementation of the GOST R 34.10 digital signature scheme using modern approaches to elliptic curve scalar multiplication
- Parallelized Software Implementation of Elliptic Curve Scalar Multiplication
- Small scalar multiplication on Weierstrass curves using division polynomials
- Bitcoin security with a twisted Edwards curve
- Avoiding full extension field arithmetic in pairing computations
- Delaying mismatched field multiplications in pairing computations
- Horizontal collision correlation attack on elliptic curves
- Another Approach to Pairing Computation in Edwards Coordinates
- Fast cryptography in genus 2
- Binary Huff Curves
- Faster pairing computations on curves with high-degree twists
- ECM on Graphics Cards
- Twisted Jacobi intersections curves
- Speeding-up verification of digital signatures
- High-Performance Modular Multiplication on the Cell Processor
- Optimizing memory cost of multi-scalar multiplication
- Random Euclidean addition chain generation and its application to point multiplication
- Jacobian coordinates on genus 2 curves
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- Isomorphism classes of Edwards curves over finite fields
- Fast Point Multiplication on Elliptic Curves without Precomputation
- Group law computations on Jacobians of hyperelliptic curves
- Complete addition formulas on the level four theta model of elliptic curves
- On the number of distinct elliptic curves in some families
- Twisted Edwards Curves Revisited
- Efficient pairing computation on elliptic curves in Hessian form
- Differential addition on binary elliptic curves
- Toric forms of elliptic curves and their arithmetic
- Families of elliptic curves with rational 3-torsion
- A theta model for elliptic curves
- Double-Base Number System for Multi-scalar Multiplications
- Faster computation of the Tate pairing
- Connecting Legendre with Kummer and Edwards
- Using \(5\)-isogenies to quintuple points on elliptic curves
- Jacobi Quartic Curves Revisited
- Faster Pairings on Special Weierstrass Curves
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- HECC
- MIRACL
- ECPP
- eBASH
- mpFq
- eBACS
- OpenSSL
- QCViewer
- eBATS
- GMP-ECM
- Echidna
- EECM-MPFQ
- JKL-ECM
- Analysis and optimization of elliptic-curve single-scalar multiplication
- Connecting Legendre
- Koblitz curves
- Curve25519
- FourQlib
- KummerLineV02
- An analysis of affine coordinates for pairing computation
- Hashing into Hessian curves
- JKL-ECM: an implementation of ECM using Hessian curves
- New Formulae for Efficient Elliptic Curve Arithmetic
- A complete set of addition laws for incomplete Edwards curves
- HECC Goes Embedded: An Area-Efficient Implementation of HECC
- Architecture level optimizations for Kummer based HECC on FPGAs
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications
- Arithmetic of the level four theta model of elliptic curves
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation
- Multiple point compression on elliptic curves
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- A new public key cryptosystem based on Edwards curves
- Faster repeated doublings on binary elliptic curves
- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
- ECM using Edwards curves
This page was built for software: EFD
