Hyperelliptic cryptosystems
From MaRDI portal
Publication:1121852
DOI10.1007/BF02252872zbMath0674.94010OpenAlexW2912690715MaRDI QIDQ1121852
Publication date: 1989
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02252872
finite fieldsfinite abelian groupsdiscrete logarithmpublic keycryptosystemsgroups of almost prime orderjacobians of hyperelliptic curves
Cryptography (94A60) Jacobians, Prym varieties (14H40) Finite ground fields in algebraic geometry (14G15)
Related Items (76)
Constructing hyperelliptic curves of genus 2 suitable for cryptography ⋮ A simple method for obtaining relations among factor basis elements for special hyperelliptic curves ⋮ Remarks on the zeta function of some diagonal hyperelliptic curves ⋮ Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ Smooth ideals in hyperelliptic function fields ⋮ Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm ⋮ Compositeness test with nodal curves ⋮ Comments on efficient batch verification test for digital signatures based on elliptic curves ⋮ On the structure of the divisor class group of a class of curves over finite fields ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ Efficient pairing computation on supersingular abelian varieties ⋮ Isomorphism classes of hyperelliptic curves of genus 2 over finite fields with characteristic 2 ⋮ Gauss composition for \(\mathbb{P}^1\), and the universal Jacobian of the Hurwitz space of double covers ⋮ The arithmetic of Jacobian groups of superelliptic cubics ⋮ Construction of CM Picard curves ⋮ Jacobian coordinates on genus 2 curves ⋮ Computing Zeta Functions of Artin–schreier Curves over Finite Fields ⋮ Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree ⋮ A quasi quadratic time algorithm for hyperelliptic curve point counting ⋮ Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic ⋮ Computing the Mordell-Weil Rank of Jacobians of Curves of Genus Two ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems ⋮ Quantum algorithm for solving hyperelliptic curve discrete logarithm problem ⋮ Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves ⋮ Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields ⋮ Faster pairing computation on genus \(2\) hyperelliptic curves ⋮ Factoring integers and oracles for elliptic and hyperelliptic curves ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ An addition algorithm in Jacobian of \(C_{ab}\) curves. ⋮ Unnamed Item ⋮ On the distribution of the coefficients of normal forms for Frobenius expansions ⋮ Group arithmetic in \(C_{3,5}\) curves ⋮ Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ ⋮ Counting hyperelliptic curves that admit a Koblitz model ⋮ Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield ⋮ Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with odd characteristic ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Unnamed Item ⋮ HYPERELLIPTIC CURVES, CARTIER — MANIN MATRICES AND LEGENDRE POLYNOMIALS ⋮ On Randomness Extraction in Elliptic Curves ⋮ A new method for decomposition in the Jacobian of small genus hyperelliptic curves ⋮ Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems ⋮ A note on cyclic groups, finite fields, and the discrete logarithm problem ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ Algebraic curves and cryptography ⋮ Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications ⋮ Isomorphism classes of hyperelliptic curves of genus 3 over finite fields ⋮ Formulae for arithmetic on genus 2 hyperelliptic curves ⋮ Curves of genus two over fields of even characteristic ⋮ Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time ⋮ Explicit bounds and heuristics on class numbers in hyperelliptic function fields ⋮ Koblitz curve cryptosystems ⋮ Sieving in Function Fields ⋮ Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves ⋮ Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic ⋮ Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations ⋮ Comparison of scalar multiplication on real hyperelliptic curves ⋮ Cryptography on twisted Edwards curves over local fields ⋮ Cryptographic aspects of real hyperelliptic curves ⋮ Division polynomials for hyperelliptic curves defined by Dickson polynomials ⋮ Constructive and destructive use of compilers in elliptic curve cryptography ⋮ Weil descent of Jacobians. ⋮ Kummer for genus one over prime-order fields ⋮ Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography ⋮ HECC Goes Embedded: An Area-Efficient Implementation of HECC ⋮ Computing zeta functions of Artin-Schreier curves over finite fields. II ⋮ Hyperelliptic curves of genus three over finite fields of even characteristic ⋮ Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\) ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields ⋮ Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems ⋮ A double large prime variation for small genus hyperelliptic index calculus ⋮ Unnamed Item ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields ⋮ Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
Cites Work
- Primality of the number of points on an elliptic curve over a finite field
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Some Primes of the Form (a n - 1)/(a - 1)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Computing in the Jacobian of a Hyperelliptic Curve
- Elliptic Curve Cryptosystems
- New directions in cryptography
- Abelian varieties over finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hyperelliptic cryptosystems
