EFD

swMATH4152MaRDI QIDQ16336FDOQ16336

Author name not available (Why is that?)

Cited In (56)

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

This page was built for software: EFD