Results 41 to 50 of about 37,491 (303)
Implementation of a new primality test [PDF]
, 1987 An implementation of the Cohen-Lenstra version of the Adleman-Pomerance-Rumely primality test is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes.
A. K. Lenstra, H. Cohen
core +2 more sources
METHOD OF TESTING LARGE NUMBERS FOR PRIMALITY
Сучасні інформаційні системиThe current stage of scientific and technological development entails ensuring information security across all domains of human activity. Confidential data and wireless channels of remote control systems are particularly sensitive to various types of ...
Vladimir Pevnev +3 more
doaj +1 more source
A Simple Algorithm for Prime Factorization and Primality Testing
Journal of Mathematics, 2022 We propose a new simple and faster algorithm to factor numbers based on the nature of the prime numbers contained in such composite numbers. It is well known that every composite number has a unique representation as a product of prime numbers.
Kabenge Hamiss
doaj +1 more source
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 2001 The main result of the paper is that primality testing, gcd computation and square-free computation is not in \(AC^0\), that is, can not be accomplished by constant depth, polynomial-size circuits of AND, OR and NOT gates. The technique used by the authors is to reduce the functions that have circuit lower bound known to divisibility and then, using a ...
Eric Allender +2 more
openaire +3 more sources
Analytic Proofs of Baseline Primality Conjecture for Special Cases
, 2019 In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results.
Sherman, Alan T. +3 more
core +1 more source
ON PRIMALITY OF THE SMARANDACHE SYMMETRIC SEQUENCES [PDF]
, 2002 The study of primality for the Smarandache sequences represents a recent research direction on the Smarandache type notions. A few articles that were published recently deal with the primality of the direct and reverse Smarandache sequences.
Tabirca, S., Tabirca, T.
core +1 more source
Distributed primality proving and the primality of (2 +1)/3 [PDF]
, 1989 The aim of this report is to explain the implementation of the elliptic curve primality proving algorithm of Atkin in a distributed way. We describe the use of a Le_Lisp program managed by a bunch of script-shells that run processes on different ...
Morain, F.
core +1 more source
Inverse problems with poisson noise: Primal and primal-dual splitting [PDF]
2011 18th IEEE International Conference on Image Processing, 2011 In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by Poisson noise. A proper data fidelity term (log-likelihood) is introduced to reflect the Poisson statistics of the noise. On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a ...
Dupé, François-Xavier +2 more
openaire +3 more sources
Riemann's Hypothesis and tests for primality
Symposium on the Theory of Computing, 1975 The purpose of this paper is to present new upper bounds on the complexity of algorithms for testing the primality of a number. The first upper bound is 0(n1/7); it improves the previously best known bound of 0(n1/4) due to Pollard [11]. The second upper
G. Miller
semanticscholar +1 more source
Primality testing and Jacobi sums [PDF]
, 1984 We present a theoretically and algorithmically simplified version of a primality testing algorithm that was recently invented by Adleman and Rumely. The new algorithm performs well in practice.
Cohen, H. +3 more
core +1 more source