Handbook of Elliptic and Hyperelliptic Curve Cryptography

DOI10.1201/9781420034981zbMATH Open1082.94001OpenAlexW1592482282MaRDI QIDQ5316732FDOQ5316732

Authors:

Publication date: 15 September 2005

Full work available at URL: https://doi.org/10.1201/9781420034981

Recommendations

• scientific article; zbMATH DE number 1349933
• scientific article; zbMATH DE number 438988
• scientific article; zbMATH DE number 2154287
• scientific article; zbMATH DE number 2114384
• Advances in Elliptic Curve Cryptography

zbMATH Keywords

discrete logarithmpoint countingelliptic and hyperelliptic curvesrealization of discrete logarithm systems

Mathematics Subject Classification ID

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)

Cited In (only showing first 100 items - show all)

• Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
• Computing zeta functions of large polynomial systems over finite fields
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• Jacobi Quartic Curves Revisited
• Lifting and Elliptic Curve Discrete Logarithms
• Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
• Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
• Recent progress on the elliptic curve discrete logarithm problem
• On the size of the Jacobians of curves over finite fields
• What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
• Distinguishing Multiplications from Squaring Operations
• Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
• Computational Number Theory, Past, Present, and Future
• On the probability of generating a lattice
• Choosing and generating parameters for pairing implementation on BN curves
• Refinement of the four-dimensional GLV method on elliptic curves
• Ramanujan's class invariants and their use in elliptic curve cryptography
• Superintegrable systems with algebraic and rational integrals of motion
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
• Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
• A deterministic algorithm for the discrete logarithm problem in a semigroup
• Fast implementation of Curve25519 using AVX2
• Discretization of Hamiltonian systems and intersection theory
• Computing Hilbert Class Polynomials
• On Edwards curves and ZVP-attacks
• Spanning the isogeny class of a power of an elliptic curve
• Higher-dimensional 3-adic CM construction
• Low-cost addition-subtraction sequences for the final exponentiation in pairings
• Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Linear complexity of some sequences derived from hyperelliptic curves of genus 2
• A survey of fault attacks in pairing based cryptography
• New bi-Hamiltonian systems on the plane
• Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves
• Fast arithmetic in unramified \(p\)-adic fields
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
• Fast Jacobian arithmetic for hyperelliptic curves of genus 3
• Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms
• Reduction of divisors for classical superintegrable GL(3) magnetic chain
• Isolated elliptic curves and the MOV attack
• Non-commutative digit expansions for arithmetic on supersingular elliptic curves
• Correspondences on hyperelliptic curves and applications to the discrete logarithm
• Double-Base Number System for Multi-scalar Multiplications
• Supersingular isogeny-based cryptography: a survey
• Horizontal collision correlation attack on elliptic curves
• Bounds and trade-offs for double-base number systems
• Faster pairing computation on genus \(2\) hyperelliptic curves
• Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
• Scalable zero knowledge via cycles of elliptic curves
• Generating Pairing-Friendly Curves with the CM Equation of Degree 1
• Factoring polynomials over finite fields
• Super-isolated abelian varieties
• Bäcklund transformations and divisor doubling
• Bäcklund transformations for the nonholonomic Veselova system
• Attacking the linear congruential generator on elliptic curves via lattice techniques
• On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic
• Memoryless near-collisions via coding theory
• Point counting in families of hyperelliptic curves in characteristic 2
• Parallelizing pairings on Hessian elliptic curves
• Quasi-quadratic elliptic curve point counting using rigid cohomology
• Speeding up elliptic curve discrete logarithm computations with point halving
• On the computation of coefficients of modular forms: the reduction modulo \(p\) approach
• On the product of small Elkies primes
• Isogenies of abelian varieties over finite fields
• Index calculus in the trace zero variety
• Computing pairings using \(x\)-coordinates only
• Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
• On the distribution of Atkin and Elkies primes
• Modular polynomials via isogeny volcanoes
• Computing bilinear pairings on elliptic curves with automorphisms
• Constructing elliptic curves over finite fields with prescribed torsion
• Genus 2 point counting over prime fields
• Faster Multiplication in GF(2)[x]
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• The double-base number system and its application to elliptic curve cryptography
• On exact discretization of cubic-quintic Duffing oscillator
• An optimal representation for the trace zero subgroup
• Memory-saving computation of the pairing final exponentiation on BN curves
• Toric forms of elliptic curves and their arithmetic
• Montgomery Ladder for All Genus 2 Curves in Characteristic 2
• On bilinear structures on divisor class groups
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• The pairing computation on Edwards curves
• Advances in Elliptic Curve Cryptography
• On the number of distinct elliptic curves in some families
• HECC Goes Embedded: An Area-Efficient Implementation of HECC
• The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
• Nonlinearities in elliptic curve authentication
• Efficient self-pairing on ordinary elliptic curves
• Complete classification of torsion of elliptic curves over quadratic cyclotomic fields
• Multibase scalar multiplications in cryptographic pairings
• Even faster integer multiplication
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Sublinear scalar multiplication on hyperelliptic Koblitz curves
• Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects
• An Analysis of the Vector Decomposition Problem
• Group law computations on Jacobians of hyperelliptic curves
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
• The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves

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)