Handbook of Elliptic and Hyperelliptic Curve Cryptography
From MaRDI portal
Publication:5316732
DOI10.1201/9781420034981zbMath1082.94001OpenAlexW1592482282MaRDI QIDQ5316732
No author found.
Publication date: 15 September 2005
Full work available at URL: https://doi.org/10.1201/9781420034981
discrete logarithmpoint countingelliptic and hyperelliptic curvesrealization of discrete logarithm systems
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Factorization (11Y05) Primality (11Y11) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to information and communication theory (94-00)
Related Items (only showing first 100 items - show all)
Elliptic curve cryptography arithmetic in terms of one variable polynomial division ⋮ New bi-Hamiltonian systems on the plane ⋮ HECC (Hyperelliptic Curve Cryptography) ⋮ Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm ⋮ Compositeness test with nodal curves ⋮ Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors ⋮ Finding elliptic curves with a subgroup of prescribed size ⋮ A relation between embedding degrees and class numbers of binary quadratic forms ⋮ Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox ⋮ Unnamed Item ⋮ On exact discretization of cubic-quintic Duffing oscillator ⋮ Fast Implementation of Curve25519 Using AVX2 ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ Computational Number Theory, Past, Present, and Future ⋮ Optimal generic attack against basic Boneh-Boyen signatures ⋮ The "Elliptic" matrices and a new kind of cryptography ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves ⋮ Fast Jacobian arithmetic for hyperelliptic curves of genus 3 ⋮ Products of hyperelliptic Jacobians with maximal Galois image ⋮ Unnamed Item ⋮ Montgomery Ladder for All Genus 2 Curves in Characteristic 2 ⋮ Transformation of the Stäckel matrices preserving superintegrability ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ EPG-representations with Small Grid-Size ⋮ Faster Multiplication in GF(2)[x] ⋮ Computing Hilbert Class Polynomials ⋮ Computing Zeta Functions in Families of C a,b Curves Using Deformation ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Constructing elliptic curves over finite fields with prescribed torsion ⋮ Modular polynomials via isogeny volcanoes ⋮ Reduction of divisors for classical superintegrable GL(3) magnetic chain ⋮ On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic ⋮ ON THE DISTRIBUTION OF ORDERS OF FROBENIUS ACTION ON ^-TORSION OF ABELIAN SURFACES ⋮ Supersingular Isogeny-based Cryptography: A Survey ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Computing separable isogenies in quasi-optimal time ⋮ Trisection for non-supersingular genus 2 curves in characteristic 2 ⋮ On the computation of coefficients of modular forms: The reduction modulo $p$ approach ⋮ On the product of small Elkies primes ⋮ A Subexponential Algorithm for Evaluating Large Degree Isogenies ⋮ 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 ⋮ A $p$-adic algorithm to compute the Hilbert class polynomial ⋮ A generic approach to searching for Jacobians ⋮ The double-base number system and its application to elliptic curve cryptography ⋮ An Analysis of the Vector Decomposition Problem ⋮ Recognizing hyperelliptic graphs in polynomial time ⋮ Ephemeral key recovery using index calculus method ⋮ Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic ⋮ Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction ⋮ Symbolic Trisection Polynomials for Genus 2 Curves in Odd Characteristic ⋮ Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms ⋮ Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат ⋮ Cryptographic aspects of real hyperelliptic curves ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ Double-Base Number System for Multi-scalar Multiplications ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves ⋮ Hensel-lifting torsion points on Jacobians and Galois representations ⋮ Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography ⋮ What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol? ⋮ Jacobi Quartic Curves Revisited ⋮ Factoring polynomials over finite fields ⋮ On Modular Decomposition of Integers ⋮ 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 ⋮ 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 ⋮ The infrastructure of a global field of arbitrary unit rank ⋮ Faster Halvings in Genus 2 ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ Lifting and Elliptic Curve Discrete Logarithms ⋮ Distinguishing Multiplications from Squaring Operations ⋮ HECC Goes Embedded: An Area-Efficient Implementation of HECC ⋮ Duffing Oscillator and Elliptic Curve Cryptography ⋮ Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p ) ⋮ Curves, Jacobians, and cryptography ⋮ Short addition sequences for theta functions ⋮ Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography ⋮ Counting points on hyperelliptic curves of genus 2 with real models ⋮ The GPS Identification Scheme Using Frobenius Expansions ⋮ Spanning the isogeny class of a power of an elliptic curve ⋮ Computing 𝐿-polynomials of Picard curves from Cartier–Manin matrices ⋮ Hashing to elliptic curves of \(j\)-invariant 1728 ⋮ Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves ⋮ A theta model for elliptic curves ⋮ 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 ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ Linear complexity of some sequences derived from hyperelliptic curves of genus 2 ⋮ On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
This page was built for publication: Handbook of Elliptic and Hyperelliptic Curve Cryptography
