Strong pseudoprimes to base 2

DOI10.1007/s11139-022-00570-8OpenAlexW2945545748MaRDI QIDQ2097530

Neslihan Aysen Ozkirisci, Enver Ozdemir, Kubra Nari

Publication date: 14 November 2022

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.06447

zbMATH Keywords

primality testMiller-Rabin testsingular cubic curvestrong pseudoprime

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Factorization; primality (11A51) Primes (11A41) Primality (11Y11)

Uses Software

• PARI/GP
• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• On distinguishing prime numbers from composite numbers
• Factoring integers with elliptic curves
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• PRIMES is in P
• Finding strong pseudoprimes to several bases
• Elliptic Curves and Primality Proving
• Four primality testing algorithms
• The Pseudoprimes to 25 ⋅10 9
• A p + 1 Method of Factoring
• On Strong Pseudoprimes to Several Bases
• Finding strong pseudoprimes to several bases. II
• Advanced Topics in Computional Number Theory
• Handbook of Elliptic and Hyperelliptic Curve Cryptography