Algebraic curves and cryptography
From MaRDI portal
Publication:5921638
DOI10.1016/j.ffa.2005.05.001zbMath1079.94014OpenAlexW1981349468WikidataQ61914067 ScholiaQ61914067MaRDI QIDQ5921638
Steven D. Galbraith, Alfred J. Menezes
Publication date: 22 September 2005
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2005.05.001
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ On the cyclicity of the rational points group of abelian varieties over finite fields ⋮ Families of genus 2 curves with small embedding degree
Uses Software
Cites Work
- Advances in Cryptology - ASIACRYPT 2003
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Building curves with arbitrary small MOV degree over finite prime fields
- Nonsingular plane cubic curves over finite fields
- Hyperelliptic cryptosystems
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- Efficient signature generation by smart cards
- The discrete logarithm problem on elliptic curves of trace one
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Constructive and destructive facets of Weil descent on elliptic curves
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Efficient implementation of pairing-based cryptosystems
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Short signatures from the Weil pairing
- The Weil pairing, and its efficient calculation
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Weil descent of Jacobians.
- Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve
- Complexity of a determinate algorithm for the discrete logarithm
- The Xedni calculus and the elliptic curve discrete logarithm problem
- Analysis of the Xedni calculus attack
- Generating more MNT elliptic curves
- Cryptographic implications of Hess' generalized GHS attack
- Elliptic curves suitable for pairing based cryptography
- Arithmetic on superelliptic curves
- A general framework for subexponential discrete logarithm algorithms
- Identity-Based Cryptosystems and Signature Schemes
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Algorithms for Black-Box Fields and their Application to Cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Computing in the Jacobian of a Hyperelliptic Curve
- Elliptic Curve Cryptosystems
- New directions in cryptography
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- On the discrete logarithm in the divisor class group of curves
- Real and imaginary quadratic representations of hyperelliptic function fields
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Factoring with Two Large Primes
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
- Identity-Based Encryption from the Weil Pairing
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- Easy Decision Diffie-Hellman Groups
- An Analysis of Goubin’s Refined Power Analysis Attack
- Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Advances in Cryptology - EUROCRYPT 2004
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Elliptic Curve Cryptography
- Algorithmic Number Theory
- Selected Areas in Cryptography
- Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
- Topics in Cryptology – CT-RSA 2004
- Public Key Cryptography – PKC 2004
- Public Key Cryptography – PKC 2004
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Cryptology - ASIACRYPT 2003