GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
From MaRDI portal
Publication:2361677
DOI10.1134/S1995080216060111zbMath1369.11003MaRDI QIDQ2361677
Publication date: 30 June 2017
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Number-theoretic algorithms; complexity (11Y16) Arithmetic functions; related numbers; inversion formulas (11A25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Primes (11A41)
Related Items (2)
An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ Polynomial greatest common divisor as a solution of system of linear equations
Cites Work
This page was built for publication: GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
