The following pages link to (Q4783726):
Displaying 50 items.
- Arithmetic on abelian and Kummer varieties (Q268484) (← links)
- Fast cryptography in genus 2 (Q271578) (← links)
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
- Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems (Q396609) (← links)
- Exponential sums over points of elliptic curves (Q401994) (← links)
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0 (Q411481) (← links)
- Efficient precomputation schemes of \(kP+lQ\) (Q436568) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- An optimal representation for the trace zero subgroup (Q521853) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication (Q744601) (← links)
- Guest editorial: Special issue in honor of Scott A. Vanstone (Q887413) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Some techniques for faster scalar multiplication on GLS curves (Q888957) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves (Q1675781) (← links)
- Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers (Q1698663) (← links)
- Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors (Q1698669) (← links)
- Refinement of the four-dimensional GLV method on elliptic curves (Q1746951) (← links)
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma (Q1979955) (← links)
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
- Revocable hierarchical identity-based authenticated key exchange (Q2104408) (← links)
- Ready-made short basis for GLV+GLS on high degree twisted curves (Q2129735) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography (Q2152032) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems (Q2243220) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- Jacobian coordinates on genus 2 curves (Q2397457) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Hyperelliptic curves with compact parameters (Q2572968) (← links)
- A Multivariate Encryption Scheme with Rainbow (Q2801772) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Constructing Isogenies on Extended Jacobi Quartic Curves (Q2980870) (← links)
- Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem (Q3383117) (← links)
- Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors (Q3454155) (← links)
- A Leakage Resilient MAC (Q3460113) (← links)
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms (Q3600506) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
- On Modular Decomposition of Integers (Q3637152) (← links)
- Easy Decision Diffie-Hellman Groups (Q4827630) (← links)
- О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых в (Q4959009) (← links)
- High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions (Q4960943) (← links)
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication (Q5035834) (← links)
- A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder (Q5048986) (← links)
- Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form (Q5069746) (← links)
