Results 11 to 20 of about 583 (221)
, 2000 In this study, prime numbers and primality, which IS one of the most important topics in number theory is analyzed.Subject of primality of a number has been the focus of many scientific studies and several different theories has been developed for many years. Based on these theorems, primality of large numbers has been investigated.
Tepeli, Murat
openaire +3 more sources
Strengthening the Baillie-PSW primality test
, 2021 Author original manuscript (preprint)In 1980, the first and third authors proposed a probabilistic primality test that has become known as the Baillie-PSW primality test.
Fiori, Andrew +2 more
core +1 more source
, 2023 Based on a chat gpt answer it is proposed a simple and effective primality test that works well for big numbers "n"
Luis Felipe massena misiec (8212830)
core +1 more source
Primality proving with Gauss and Jacobi sums
Journal of Telecommunications and Information Technology, 2004 This article presents a primality test known as APR (Adleman, Pomerance and Rumely) which was invented in 1980. It was later simplified and improved by Cohen and Lenstra.
Andrzej Chmielowiec
doaj +1 more source
On the resolvent of an ideal and some applications
International Journal of Mathematics and Mathematical Sciences, 2003 We give an algorithm to compute a resolvent of an algebraic variety without computing its irreducible components; we decompose the radical of an ideal into prime ideals and we test the primality of a regular ideal.
Driss Bouziane, Abdelilah Kandri Rody
doaj +1 more source
A Practical Collision-Based Power Analysis on RSA Prime Generation and Its Countermeasure
IEEE Access, 2019 We analyze the security of RSA prime generation implemented on embedded devices by a practical power analysis attack. Unlike previous differential power analysis-based attack on primality tests of RSA prime generation exploiting the deterministic ...
Sangyub Lee +3 more
doaj +1 more source
Genefer: Programs for Finding Large Probable Generalized Fermat Primes
Journal of Open Research Software, 2015 Genefer is a suite of programs for performing Probable Primality (PRP) tests of Generalised Fermat numbers 'b'2'n'+1 (GFNs) using a Fermat test. Optimised implementations are available for modern CPUs using single instruction, multiple data (SIMD ...
Iain Arthur Bethune, Yves Gallot
doaj +1 more source
Primality test via quantum factorization
, 1997 We consider a probabilistic quantum implementation of a variation of the Pocklington-Lehmer N - 1 primality test using Shor's algorithm. O(log3 N log log N log log log N) elementary q-bit operations are required to determine the primality of a number N ...
Chau, HF, Lo, HK
core +1 more source
The Miller–Rabin test with randomized exponents
Journal of Mathematical Cryptology, 2009 We analyze a variant of the well-known Miller–Rabin test, that may be useful in preventing side-channel attacks to the random prime generation on smart cards: In the Miller–Rabin primality test for a positive integer n, one computes repeatedly the ...
Böckle Gebhard
doaj +1 more source