The following pages link to EFD (Q16336):
Displaying 50 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Twisted Jacobi intersections curves (Q391081) (← links)
- Isomorphism classes of Edwards curves over finite fields (Q413563) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- Multiple point compression on elliptic curves (Q521859) (← links)
- Toric forms of elliptic curves and their arithmetic (Q548601) (← links)
- Complete addition formulas on the level four theta model of elliptic curves (Q780585) (← links)
- On the number of distinct elliptic curves in some families (Q849356) (← links)
- Horizontal collision correlation attack on elliptic curves (Q892284) (← links)
- Connecting Legendre with Kummer and Edwards (Q1726008) (← links)
- Architecture level optimizations for Kummer based HECC on FPGAs (Q1746825) (← links)
- Using \(5\)-isogenies to quintuple points on elliptic curves (Q1944890) (← links)
- A new public key cryptosystem based on Edwards curves (Q2008069) (← links)
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146) (← links)
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications (Q2104421) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- A theta model for elliptic curves (Q2363002) (← links)
- Jacobian coordinates on genus 2 curves (Q2397457) (← links)
- Faster computation of the Tate pairing (Q2430985) (← links)
- A complete set of addition laws for incomplete Edwards curves (Q2430986) (← links)
- Arithmetic of the level four theta model of elliptic curves (Q2516923) (← links)
- Group Law Computations on Jacobians of Hyperelliptic Curves (Q2889865) (← links)
- Faster Repeated Doublings on Binary Elliptic Curves (Q2949545) (← links)
- JKL-ECM: an implementation of ECM using Hessian curves (Q2971003) (← links)
- Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation (Q3011912) (← links)
- Hashing into Hessian Curves (Q3011918) (← links)
- Random Euclidean Addition Chain Generation and Its Application to Point Multiplication (Q3058729) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Binary Huff Curves (Q3073716) (← links)
- Efficient Pairing Computation on Elliptic Curves in Hessian Form (Q3094994) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Families of elliptic curves with rational 3-torsion (Q3225749) (← links)
- Оптимизация объема памяти при мультискалярном умножении (Q3381822) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Parallelized Software Implementation of Elliptic Curve Scalar Multiplication (Q3454600) (← links)
- Fast Point Multiplication on Elliptic Curves without Precomputation (Q3519550) (← links)
- Avoiding Full Extension Field Arithmetic in Pairing Computations (Q3558313) (← links)
- Faster Pairing Computations on Curves with High-Degree Twists (Q3562898) (← links)
- High-Performance Modular Multiplication on the Cell Processor (Q3578462) (← links)
- Delaying Mismatched Field Multiplications in Pairing Computations (Q3578474) (← links)
- Twisted Edwards Curves Revisited (Q3600383) (← links)
- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication (Q3615631) (← links)
- ECM on Graphics Cards (Q3627453) (← links)
- Double-Base Number System for Multi-scalar Multiplications (Q3627454) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Jacobi Quartic Curves Revisited (Q3634512) (← links)
- (Q3635533) (← links)
- HECC Goes Embedded: An Area-Efficient Implementation of HECC (Q3644216) (← links)
- ECM using Edwards curves (Q4912021) (← links)
- О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых в (Q4959009) (← links)
