On counting and generating curves over small finite fields

DOI10.1016/J.JCO.2003.08.022zbMath1056.11037OpenAlexW2111109162MaRDI QIDQ1827569

Ming-Deh A. Huang, Qi Cheng

Publication date: 6 August 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.022

zbMATH Keywords

Bateman-Horn conjecturecurve-based cryptographyKoblitz curve

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Constructing elliptic curves and curves of genus 2 over finite fields

Uses Software

• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Nonsingular plane cubic curves over finite fields
• Primality testing and Abelian varieties over finite fields
• Elliptic curve cryptosystems over small fields of odd characteristic
• Counting points on curves over finite fields
• On the class number of \(p\)-th cyclotomic field
• Counting points on elliptic curves over finite fields
• Elliptic Curves and Primality Proving
• Limitations to the equi-distribution of primes. IV
• Constructing hyperelliptic curves of genus 2 suitable for cryptography
• Primes in short intervals
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato

This page was built for publication: On counting and generating curves over small finite fields