Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields

DOI10.1016/j.mcm.2008.03.012zbMath1165.14310OpenAlexW1998365456MaRDI QIDQ2389874

Hoil Kim, Gyoyong Sohn

Publication date: 20 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.03.012

zbMATH Keywords

cryptographyPicard curvesbaby-step giant-step algorithmcounting points

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Finite ground fields in algebraic geometry (14G15) Varieties over finite and local fields (11G25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Hasse–Witt and Cartier–Manin matrices: A warning and a request

Cites Work

• On the Jacobian varieties of hyperelliptic curves over fields of characteristic \(p>2\)
• Arithmetic on superelliptic curves
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• On the JACOBIan Varieties of PICARD Curves Defined over Fields of Characteristicp < 0
• Construction of CM Picard curves
• Point counting on Picard curves in large characteristic
• The Hasse-Witt matrix of an algebraic curve
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields