An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach

DOI10.1134/S1995080222150045OpenAlexW4327808389MaRDI QIDQ2700038

Yanyan Li

Publication date: 20 April 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080222150045

zbMATH Keywords

reinforcement learningprimality testMiller-Rabinproximal policy optimizationprimality witness

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computational number theory (11Yxx) Elementary number theory (11Axx)

Related Items (1)

On a modification of the Lucas primality test

Uses Software

• Mathematica
• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• PRIMES is in P
• Reinforcement learning for combinatorial optimization: a survey
• Two kinds of strong pseudoprimes up to $10^{36}$
• Primality Testing and Jacobi Sums
• Finding strong pseudoprimes to several bases. II
• Finding 𝐶₃-strong pseudoprimes
• Strengthening the Baillie-PSW primality test
• Notes on some new kinds of pseudoprimes

This page was built for publication: An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach