Handbook of Elliptic and Hyperelliptic Curve Cryptography
From MaRDI portal
(Redirected from Publication:5316732)
discrete logarithmelliptic and hyperelliptic curvespoint countingrealization of discrete logarithm systems
Curves over finite and local fields (11G20) Factorization (11Y05) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00) Cryptography (94A60)
Recommendations
Cited in
(only showing first 100 items - show all)- Computing pairings using x-coordinates only
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Noncanonical number systems in the integers
- On bilinear structures on divisor class groups
- Quasi-quadratic elliptic curve point counting using rigid cohomology
- Bisection for genus 2 curves in odd characteristic
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
- On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- Isolated elliptic curves and the MOV attack
- Non-commutative digit expansions for arithmetic on supersingular elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- Bäcklund transformations and divisor doubling
- Parallelizing pairings on Hessian elliptic curves
- Choosing and generating parameters for pairing implementation on BN curves
- Refinement of the four-dimensional GLV method on elliptic curves
- Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves
- Speeding up elliptic curve discrete logarithm computations with point halving
- Bounds and trade-offs for double-base number systems
- Faster pairing computation on genus 2 hyperelliptic curves
- Elliptic curve discrete logarithm problem over small degree extension fields
- The Xedni calculus and the elliptic curve discrete logarithm problem
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- Protecting ECC against fault attacks: the ring extension method revisited
- Computing projective equivalences of planar curves birationally equivalent to elliptic and hyperelliptic curves
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Strong pseudoprimes to base 2
- Hashing to elliptic curves of \(j\)-invariant 1728
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- Computing zeta functions of large polynomial systems over finite fields
- On multi-language abstraction. Towards a static analysis of multi-language programs
- Reconstructing plane quartics from their invariants
- Discretization of Hamiltonian systems and intersection theory
- Superintegrable systems with algebraic and rational integrals of motion
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Super-isolated abelian varieties
- A probabilistic analysis on a lattice attack against DSA
- Still wrong use of pairings in cryptography
- On the arithmetic operations over finite fields of characteristic three with low complexity
- A theta model for elliptic curves
- Dynamical directions in numeration
- Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects
- Improving the arithmetic of elliptic curves in the Jacobi model
- Bäcklund transformations for the nonholonomic Veselova system
- Improved complexity bounds for counting points on hyperelliptic curves
- Faster computation of the Tate pairing
- A CM construction for curves of genus 2 with \(p\)-rank 1
- On the probability of generating a lattice
- On Edwards curves and ZVP-attacks
- Higher-dimensional 3-adic CM construction
- Comparison of scalar multiplication on real hyperelliptic curves
- Pairing inversion for finding discrete logarithms
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Memory-saving computation of the pairing final exponentiation on BN curves
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- Group law computations on Jacobians of hyperelliptic curves
- Sublinear scalar multiplication on hyperelliptic Koblitz curves
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Correspondences on hyperelliptic curves and applications to the discrete logarithm
- Fast implementation of Curve25519 using AVX2
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- Nonlinearities in elliptic curve authentication
- An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication
- Multibase scalar multiplications in cryptographic pairings
- A p-adic algorithm to compute the Hilbert class polynomial
- A generic approach to searching for Jacobians
- Ephemeral key recovery using index calculus method
- Even faster integer multiplication
- Cryptographic aspects of real hyperelliptic curves
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Point counting in families of hyperelliptic curves in characteristic 2
- Hilbert's Seventeenth Problem and Hyperelliptic Curves
- A point counting algorithm using cohomology with compact support
- Modular Polynomials for Genus 2
- p-adic class invariants
- The infrastructure of a global field of arbitrary unit rank
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- Counting points on hyperelliptic curves of genus 2 with real models
- Compositeness test with nodal curves
- Finding elliptic curves with a subgroup of prescribed size
- A relation between embedding degrees and class numbers of binary quadratic forms
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Low-weight primes for lightweight elliptic curve cryptography on 8-bit AVR processors
- Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2
- Handbook of Financial Cryptography and Security
- Twisted Edwards Curves Revisited
- On the Connection between Kloosterman Sums and Elliptic Curves
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Double-Base Number System for Multi-scalar Multiplications
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)
