Handbook of Elliptic and Hyperelliptic Curve Cryptography
From MaRDI portal
Publication:5316732
discrete logarithmpoint countingelliptic and hyperelliptic curvesrealization of discrete logarithm systems
Cryptography (94A60) Curves over finite and local fields (11G20) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Primality (11Y11) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)
Recommendations
Cited in
(only showing first 100 items - show all)- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
- Horizontal collision correlation attack on elliptic curves
- Distinguishing Multiplications from Squaring Operations
- Computing Hilbert Class Polynomials
- On the probability of generating a lattice
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Fast arithmetic in unramified \(p\)-adic fields
- Parallelizing pairings on Hessian elliptic curves
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- Bäcklund transformations and divisor doubling
- Factoring polynomials over finite fields
- Computational Number Theory, Past, Present, and Future
- On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
- Bäcklund transformations for the nonholonomic Veselova system
- Ramanujan's class invariants and their use in elliptic curve cryptography
- On Edwards curves and ZVP-attacks
- Higher-dimensional 3-adic CM construction
- Scalable zero knowledge via cycles of elliptic curves
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Double-Base Number System for Multi-scalar Multiplications
- Spanning the isogeny class of a power of an elliptic curve
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- Bounds and trade-offs for double-base number systems
- Faster pairing computation on genus \(2\) hyperelliptic curves
- Jacobi Quartic Curves Revisited
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Discretization of Hamiltonian systems and intersection theory
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Superintegrable systems with algebraic and rational integrals of motion
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
- On the computation of coefficients of modular forms: the reduction modulo \(p\) approach
- Isolated elliptic curves and the MOV attack
- Non-commutative digit expansions for arithmetic on supersingular elliptic curves
- On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- Memoryless near-collisions via coding theory
- Lifting and Elliptic Curve Discrete Logarithms
- Computing zeta functions of large polynomial systems over finite fields
- Supersingular isogeny-based cryptography: a survey
- Choosing and generating parameters for pairing implementation on BN curves
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- Refinement of the four-dimensional GLV method on elliptic curves
- Fast implementation of Curve25519 using AVX2
- Recent progress on the elliptic curve discrete logarithm problem
- Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves
- New bi-Hamiltonian systems on the plane
- Point counting in families of hyperelliptic curves in characteristic 2
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Super-isolated abelian varieties
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Fast Jacobian arithmetic for hyperelliptic curves of genus 3
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- On the size of the Jacobians of curves over finite fields
- A survey of fault attacks in pairing based cryptography
- Correspondences on hyperelliptic curves and applications to the discrete logarithm
- Reduction of divisors for classical superintegrable GL(3) magnetic chain
- Speeding up elliptic curve discrete logarithm computations with point halving
- An optimal representation for the trace zero subgroup
- Computing bilinear pairings on elliptic curves with automorphisms
- Counting points on hyperelliptic curves of genus 2 with real models
- Computing pairings using \(x\)-coordinates only
- On the Connection between Kloosterman Sums and Elliptic Curves
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
- Binary Kummer line
- Computing zeta functions of superelliptic curves in larger characteristic
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Elliptic nets and elliptic curves
- Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
- A subexponential algorithm for evaluating large degree isogenies
- Genus 2 point counting over prime fields
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- On the product of small Elkies primes
- Group law computations on Jacobians of hyperelliptic curves
- A $p$-adic algorithm to compute the Hilbert class polynomial
- On the number of distinct elliptic curves in some families
- Faster Multiplication in GF(2)[x]
- Twisted Edwards Curves Revisited
- Memory-saving computation of the pairing final exponentiation on BN curves
- Isogenies of abelian varieties over finite fields
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- Bisection for genus 2 curves in odd characteristic
- Toric forms of elliptic curves and their arithmetic
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Index calculus in the trace zero variety
- Complete classification of torsion of elliptic curves over quadratic cyclotomic fields
- Constructing elliptic curves over finite fields with prescribed torsion
- Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
- Faster computation of the Tate pairing
- Sublinear scalar multiplication on hyperelliptic Koblitz curves
- On the distribution of Atkin and Elkies primes
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Elliptic curve discrete logarithm problem over small degree extension fields
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
This page was built for publication: Handbook of Elliptic and Hyperelliptic Curve Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316732)
