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)
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}\) ⋮ Nonlinearities in elliptic curve authentication ⋮ Dynamical directions in numeration ⋮ Multibase scalar multiplications in cryptographic pairings ⋮ On the size of the Jacobians of curves over finite fields ⋮ Even faster integer multiplication ⋮ Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects ⋮ Improving the arithmetic of elliptic curves in the Jacobi model ⋮ On the number of distinct elliptic curves in some families ⋮ The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ A deterministic algorithm for the discrete logarithm problem in a semigroup ⋮ Bäcklund transformations for the nonholonomic Veselova system ⋮ Computing zeta functions of large polynomial systems over finite fields ⋮ 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 ⋮ Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices ⋮ Isogenies of abelian varieties over finite fields ⋮ Normal forms of hyperelliptic curves of genus 3 ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems ⋮ Quantum algorithm for solving hyperelliptic curve discrete logarithm problem ⋮ Horizontal collision correlation attack on elliptic curves ⋮ A survey of fault attacks in pairing based cryptography ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ On the distribution of Atkin and Elkies primes ⋮ Improved complexity bounds for counting points on hyperelliptic curves ⋮ Index calculus in the trace zero variety ⋮ Genus 2 point counting over prime fields ⋮ Computing zeta functions of superelliptic curves in larger characteristic ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication ⋮ 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 ⋮ Faster computation of the Tate pairing ⋮ A CM construction for curves of genus 2 with \(p\)-rank 1 ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ On the distribution of the coefficients of normal forms for Frobenius expansions ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Bäcklund transformations and divisor doubling ⋮ On the probability of generating a lattice ⋮ On Edwards curves and ZVP-attacks ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ Elliptic nets and elliptic curves ⋮ The pairing computation on Edwards curves ⋮ Redundancy of minimal weight expansions in Pisot bases ⋮ An ID-based signcryption scheme with compartmented secret sharing for unsigncryption ⋮ A binary algorithm with low divergence for modular inversion on SIMD architectures ⋮ Memoryless near-collisions via coding theory ⋮ Point counting in families of hyperelliptic curves ⋮ On multi-language abstraction. Towards a static analysis of multi-language programs ⋮ Extending the GLS endomorphism to speed up GHS Weil descent using Magma ⋮ Trisection for genus 2 curves in odd characteristic ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Refinement of the four-dimensional GLV method on elliptic curves ⋮ Higher-dimensional 3-adic CM construction ⋮ An optimal representation for the trace zero subgroup ⋮ Multiple point compression on elliptic curves ⋮ Toric forms of elliptic curves and their arithmetic ⋮ Fast arithmetic in unramified \(p\)-adic fields ⋮ Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves ⋮ Complete classification of torsion of elliptic curves over quadratic cyclotomic fields ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ Ramanujan's class invariants and their use in elliptic curve cryptography ⋮ Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves ⋮ Reconstructing plane quartics from their invariants ⋮ Discretization of Hamiltonian systems and intersection theory ⋮ Superintegrable systems with algebraic and rational integrals of motion ⋮ Comparison of scalar multiplication on real hyperelliptic curves ⋮ Pairing inversion for finding discrete logarithms ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties ⋮ 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 ⋮ Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus ⋮ On bilinear structures on divisor class groups ⋮ Computing projective equivalences of planar curves birationally equivalent to elliptic and hyperelliptic curves ⋮ Quasi-quadratic elliptic curve point counting using rigid cohomology ⋮ Bisection for genus 2 curves in odd characteristic ⋮ Super-isolated abelian varieties ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields ⋮ Still wrong use of pairings in cryptography ⋮ Strong pseudoprimes to base 2 ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity
This page was built for publication: Handbook of Elliptic and Hyperelliptic Curve Cryptography
