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)- 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
- Modular polynomials via isogeny volcanoes
- On bilinear structures on divisor class groups
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- The double-base number system and its application to elliptic curve cryptography
- Noncanonical number systems in the integers
- Computing Zeta Functions in Families of C a,b Curves Using Deformation
- Dynamical directions in numeration
- Recognizing hyperelliptic graphs in polynomial time
- Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices
- Multibase scalar multiplications in cryptographic pairings
- The pairing computation on Edwards curves
- Even faster integer multiplication
- \(p\)-adic class invariants
- The Xedni calculus and the elliptic curve discrete logarithm problem
- Advances in Elliptic Curve Cryptography
- A generic approach to searching for Jacobians
- Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects
- HECC Goes Embedded: An Area-Efficient Implementation of HECC
- Trisection for non-supersingular genus 2 curves in characteristic 2
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Cryptographic aspects of real hyperelliptic curves
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
- On exact discretization of cubic-quintic Duffing oscillator
- An Analysis of the Vector Decomposition Problem
- Multiple point compression on elliptic curves
- Hensel-lifting torsion points on Jacobians and Galois representations
- Efficient self-pairing on ordinary elliptic curves
- Normal forms of hyperelliptic curves of genus 3
- A CM construction for curves of genus 2 with \(p\)-rank 1
- Trisection for genus 2 curves in odd characteristic
- Modular Polynomials for Genus 2
- Redundancy of minimal weight expansions in Pisot bases
- Point counting in families of hyperelliptic curves
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Nonlinearities in elliptic curve authentication
- On the distribution of the coefficients of normal forms for Frobenius expansions
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- An ID-based signcryption scheme with compartmented secret sharing for unsigncryption
- A binary algorithm with low divergence for modular inversion on SIMD architectures
- 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
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)
