Compositeness test with nodal curves

DOI10.1080/00207160.2016.1274737zbMath1433.11138OpenAlexW2561161810MaRDI QIDQ3174870

Enver Ozdemir

Publication date: 18 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1274737

zbMATH Keywords

generalized Jacobianprimality testnodal curves

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Primality (11Y11)

Uses Software

• PARI/GP
• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distinguishing prime numbers from composite numbers
• Factoring integers with elliptic curves
• Hyperelliptic cryptosystems
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• PRIMES is in P
• Elliptic Curves and Primality Proving
• Four primality testing algorithms
• Computing in the Jacobian of a Hyperelliptic Curve
• Elliptic Curve Cryptosystems
• The Pseudoprimes to 25 ⋅10 9
• A method for obtaining digital signatures and public-key cryptosystems
• On Strong Pseudoprimes to Several Bases
• A hyperelliptic smoothness test. I
• Finding strong pseudoprimes to several bases. II
• Advanced Topics in Computional Number Theory
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Computing Square Roots in Finite Fields
• Algorithmic Number Theory

This page was built for publication: Compositeness test with nodal curves