Results 1 to 10 of about 142,337 (88)
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 +3 more sources
Asymptotic ω-Primality of Finitely Generated Cancelative Commutative Monoids
Mathematics, 2023 The computation of ω-primality has been object of study, mainly, for numerical semigroups due to its multiple applications to the Factorization Theory. However, its asymptotic version is less well known.
Juan Ignacio García-García +2 more
doaj +2 more sources
On the primality of totally ordered q-factorization graphs [PDF]
Canadian Journal of Mathematics, 2022 We introduce the combinatorial notion of a q-factorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with three decorations:
A. Moura, C. Silva
semanticscholar +4 more sources
Polynomial Factorization and Primality Criterion for Fermat Numbers
INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH, 2022 Let p be a prime integer and let k ∈N. We purpose a factorization of X2k +1 (mod p) allowing ti give a primality criterion for Fermat numbers.
Oumar Fall
semanticscholar +4 more sources
Factorization and Primality Tests [PDF]
The American Mathematical Monthly, 1984 (1984). Factorization and Primality Tests. The American Mathematical Monthly: Vol. 91, No. 6, pp. 333-352.
J. Dixon
semanticscholar +6 more sources
International Journal of Modern Physics C, 2003 This article is based mainly on lectures given by the author in the Cryptography section of the Algebraic Number Theory Workshop held at HRI, Allahabad, in November, 2000. The question we address here is how to decide whether a given integer n > 1 is prime or composite, and to find the factors of a composite n.
Lo, HK, Chau, HF
+18 more sources
Primality test via quantum factorization [PDF]
, 1995 We consider a probabilistic quantum implementation of a variation of the Pocklington-Lehmer N-1 primality test using Shor's algorithm. \mbox{O}((\log N)^3 \log\log N \log\log\log N ) elementary q-bit operations are required to determine the primality of ...
Chau, H F, Lo, H K
core +3 more sources
Evaluating RSA encryption: Primality testing, pollards algorithms, and security challenges
Theoretical and Natural Science, 2023 In the dynamic realm of cryptography, Rivest, Shamir, and Adleman (RSA) encryption stands as a pivotal element in ensuring secure communications.
Ziqian Liu
semanticscholar +1 more source