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
• New Formulae for Efficient Elliptic Curve Arithmetic
• Jacobi Quartic Curves Revisited
• Random Euclidean Addition Chain Generation and Its Application to Point Multiplication
• 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
• Title not available (Why is that?)
• 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
• Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation
• 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
• Differential Addition on Binary Elliptic Curves
• 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
• Efficient Pairing Computation on Elliptic Curves in Hessian Form
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
• Оптимизация объема памяти при мультискалярном умножении
• Another Approach to Pairing Computation in Edwards Coordinates
• Hashing into Hessian Curves
• A theta model for elliptic curves
• Faster Repeated Doublings on Binary Elliptic Curves
• Jacobian coordinates on genus 2 curves
• 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
• Avoiding Full Extension Field Arithmetic in Pairing Computations
• Horizontal collision correlation attack on elliptic curves
• Using \(5\)-isogenies to quintuple points on elliptic curves
• Group Law Computations on Jacobians of Hyperelliptic Curves
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Families of elliptic curves with rational 3-torsion
• Delaying Mismatched Field Multiplications in Pairing Computations
• High-Performance Modular Multiplication on the Cell Processor
• Twisted Edwards Curves Revisited
• A complete set of addition laws for incomplete Edwards curves
• An Analysis of Affine Coordinates for Pairing Computation
• Faster Pairing Computations on Curves with High-Degree Twists
• Connecting Legendre with Kummer and Edwards
• Multiple point compression on elliptic curves
• Эффективная реализация схемы цифровой подписи ГОСТ Р 34.10 с помощью современных методов скалярного умножения на эллиптических кривых

This page was built for software: EFD