Handbook of Elliptic and Hyperelliptic Curve Cryptography
From MaRDI portal
Publication:5316732
DOI10.1201/9781420034981zbMATH Open1082.94001OpenAlexW1592482282MaRDI QIDQ5316732FDOQ5316732
Authors:
Publication date: 15 September 2005
Full work available at URL: https://doi.org/10.1201/9781420034981
Recommendations
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)
Cited In (only showing first 100 items - show all)
- 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
- A CM construction for curves of genus 2 with \(p\)-rank 1
- A subexponential algorithm for evaluating large degree isogenies
- Computing Zeta Functions in Families of C a,b Curves Using Deformation
- On the Connection between Kloosterman Sums and Elliptic Curves
- Hensel-lifting torsion points on Jacobians and Galois representations
- An ID-based signcryption scheme with compartmented secret sharing for unsigncryption
- A binary algorithm with low divergence for modular inversion on SIMD architectures
- Computing zeta functions of superelliptic curves in larger characteristic
- Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
- A $p$-adic algorithm to compute the Hilbert class polynomial
- Faster computation of the Tate pairing
- Computing Hilbert class polynomials with the Chinese remainder theorem
- On the distribution of the coefficients of normal forms for Frobenius expansions
- A generic approach to searching for Jacobians
- The Xedni calculus and the elliptic curve discrete logarithm problem
- Cryptographic aspects of real hyperelliptic curves
- Modular Polynomials for Genus 2
- Counting points on hyperelliptic curves of genus 2 with real models
- Binary Kummer line
- Noncanonical number systems in the integers
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Elliptic nets and elliptic curves
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- Dynamical directions in numeration
- Trisection for genus 2 curves in odd characteristic
- Redundancy of minimal weight expansions in Pisot bases
- Trisection for non-supersingular genus 2 curves in characteristic 2
- Normal forms of hyperelliptic curves of genus 3
- Twisted Edwards Curves Revisited
- Recognizing hyperelliptic graphs in polynomial time
- \(p\)-adic class invariants
- Point counting in families of hyperelliptic curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
- Bisection for genus 2 curves in odd characteristic
- Multiple point compression on elliptic curves
- Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices
- Elliptic curve discrete logarithm problem over small degree extension fields
- Title not available (Why is that?)
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- Strong pseudoprimes to base 2
- Duffing Oscillator and Elliptic Curve Cryptography
- Ephemeral key recovery using index calculus method
- Symbolic trisection polynomials for genus 2 curves in odd characteristic
- A probabilistic analysis on a lattice attack against DSA
- Curves, Jacobians, and cryptography
- Square root computation in finite fields
- HECC (hyperelliptic curve cryptography)
- Still wrong use of pairings in cryptography
- Faster Halvings in Genus 2
- EPG-representations with Small Grid-Size
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- The infrastructure of a global field of arbitrary unit rank
- Title not available (Why is that?)
- Improved complexity bounds for counting points on hyperelliptic curves
- The "Elliptic" matrices and a new kind of cryptography
- Hashing to elliptic curves of \(j\)-invariant 1728
- On multi-language abstraction. Towards a static analysis of multi-language programs
- Short addition sequences for theta functions
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- On the arithmetic operations over finite fields of characteristic three with low complexity
- Reconstructing plane quartics from their invariants
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)
