Handbook of Elliptic and Hyperelliptic Curve Cryptography
From MaRDI portal
(Redirected from 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)- Isogenies of abelian varieties over finite fields
- Index calculus in the trace zero variety
- Transformation of the Stäckel matrices preserving superintegrability
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- Computing separable isogenies in quasi-optimal time
- Computing zeta functions of large polynomial systems over finite fields
- On the product of small Elkies primes
- Computing pairings using x-coordinates only
- Strong pseudoprimes to base 2
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
- On the distribution of Atkin and Elkies primes
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Jacobi Quartic Curves Revisited
- Ephemeral key recovery using index calculus method
- Duffing Oscillator and Elliptic Curve Cryptography
- Lifting and Elliptic Curve Discrete Logarithms
- Modular polynomials via isogeny volcanoes
- Symbolic trisection polynomials for genus 2 curves in odd characteristic
- A probabilistic analysis on a lattice attack against DSA
- Recent progress on the elliptic curve discrete logarithm problem
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Computing bilinear pairings on elliptic curves with automorphisms
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Curves, Jacobians, and cryptography
- Square root computation in finite fields
- On the size of the Jacobians of curves over finite fields
- Still wrong use of pairings in cryptography
- Constructing elliptic curves over finite fields with prescribed torsion
- 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
- HECC (hyperelliptic curve cryptography)
- Genus 2 point counting over prime fields
- Faster Halvings in Genus 2
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- The infrastructure of a global field of arbitrary unit rank
- EPG-representations with Small Grid-Size
- An optimal representation for the trace zero subgroup
- Faster Multiplication in GF(2)[x]
- Memory-saving computation of the pairing final exponentiation on BN curves
- Computational Number Theory, Past, Present, and Future
- On multi-language abstraction: towards a static analysis of multi-language programs
- Toric forms of elliptic curves and their arithmetic
- Improved complexity bounds for counting points on hyperelliptic curves
- The double-base number system and its application to elliptic curve cryptography
- On the probability of generating a lattice
- On exact discretization of cubic-quintic Duffing oscillator
- scientific article; zbMATH DE number 7656025 (Why is no real title available?)
- 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
- Hashing to elliptic curves of \(j\)-invariant 1728
- On multi-language abstraction. Towards a static analysis of multi-language programs
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- The pairing computation on Edwards curves
- On bilinear structures on divisor class groups
- The "Elliptic" matrices and a new kind of cryptography
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2
- Superintegrable systems with algebraic and rational integrals of motion
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- The counting function for Elkies primes
- Short addition sequences for theta functions
- On the number of distinct elliptic curves in some families
- On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
- Advances in Elliptic Curve Cryptography
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Fast implementation of Curve25519 using AVX2
- HECC Goes Embedded: An Area-Efficient Implementation of HECC
- Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
- On the arithmetic operations over finite fields of characteristic three with low complexity
- Reconstructing plane quartics from their invariants
- Nonlinearities in elliptic curve authentication
- Discretization of Hamiltonian systems and intersection theory
- A point counting algorithm using cohomology with compact support
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- A generalized MSST algorithm for counting points of elliptic curves over \(\mathbb{F}_{p^n}\)
- Protecting ECC against fault attacks: the ring extension method revisited
- Complete classification of torsion of elliptic curves over quadratic cyclotomic fields
- Multibase scalar multiplications in cryptographic pairings
- Even faster integer multiplication
- Efficient self-pairing on ordinary elliptic curves
- On Edwards curves and ZVP-attacks
- Computing Hilbert Class Polynomials
- Spanning the isogeny class of a power of an elliptic curve
- Higher-dimensional 3-adic CM construction
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- Sublinear scalar multiplication on hyperelliptic Koblitz curves
- An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication
- Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects
- Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
- Scalar multiplication on generalized Huff curves using the skew-Frobenius map
- An Analysis of the Vector Decomposition Problem
- A theta model for 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)
