Results 271 to 280 of about 2,924 (299)
Some of the next articles are maybe not open access.
Integer Factorization Using Hadoop
2011 IEEE Third International Conference on Cloud Computing Technology and Science, 2011Integer factorization is an interesting but a hard problem and stays at the core of many security mechanisms. Conventional approaches to factor big integer numbers often require powerful computers and a great effort in software development. In this paper, we present a different approach to this problem by running the quadratic sieve algorithm in the ...
Son Thanh Nguyen +3 more
openaire +1 more source
Factoring medium-sized integers
Comput. J., 1984In this short note factoring algorithms are compared to see how they behave for ``medium sized'' integers, i.e. between 14 and 20 digits. The conclusion is that after removing small factors by trial division and having used a probabilistic primality test, one should use the continued fraction algorithm. No details are given.
R. J. Macmillan, James H. Davenport
openaire +1 more source
On the oracle complexity of factoring integers
Computational Complexity, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Factors of a Square-Free Integer
Canadian Mathematical Bulletin, 1968This note is concerned with the number C(n) of ordered non-trivial factorizations of an integer n in the special case where n is square free. If F (m) denotes C(p1…Pm) where pi. are distinct primes, it is shown thatand that
openaire +2 more sources
On the number of prime factors of integers
The science reports of the Kanazawa University=金沢大学理科報告, 1969Not ...
Eda, Yoshikazu, Yamano, Gosuke
openaire +2 more sources
International Journal of Mathematics Trends and Technology
Considering the breakthrough that happened recently in math, which established the condition for primality versus composite numbers, the decomposition of large numbers has been put to rest. To fully comprehend factorization of integers, this paper presents this issue with regard to the area of cryptography.
openaire +1 more source
Considering the breakthrough that happened recently in math, which established the condition for primality versus composite numbers, the decomposition of large numbers has been put to rest. To fully comprehend factorization of integers, this paper presents this issue with regard to the area of cryptography.
openaire +1 more source
Factorization of Integer-Valued Polynomials with Square-Free Denominator
Communications in Algebra, 2015Giulio Peruginelli
exaly

