A deterministic algorithm for integer factorization
نویسندگان
چکیده
منابع مشابه
Faster deterministic integer factorization
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N 1/4 logN)), where Mint(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan–Gaudry–Schost, following the Pollard–Strassen approach. We show that this bound can be improved by a factor of √
متن کاملDeterministic Integer Factorization Algorithms
This note presents a deterministic integer factorization algorithm of running time complexity O(N), ε > 0. This improves the current performances of deterministic integer factorization algorithms rated at O(N) arithmetic operations. Equivalently, given the least (log N)/6 bits of a factor of N = pq, where p and q are primes, the algorithm factors the integer in polynomial time O(log(N)), c ≥ 0 ...
متن کاملA Fast+practical+deterministic Algorithm for Triangularizing Integer Matrices
This paper presents a new algorithm for computing the row reduced echelon form triangularization H of an n m integer input matrix A. The cost of the algorithm is O(nmr 2 log 2 rjjAjj + r 4 log 3 rjjAjj) bit operations where r is the rank of A and jjAjj = max ij jA ij j. This complexity result assumes standard (quadratic) integer arithmetic but still matches, in the paramaters n, m and r, the be...
متن کاملMapReduce for Integer Factorization
Integer factorization is a very hard computational problem. Currently no e cient algorithm for integer factorization is publicly known. However, this is an important problem on which it relies the security of many real world cryptographic systems. I present an implementation of a fast factorization algorithm on MapReduce. MapReduce is a programming model for high performance applications develo...
متن کاملParticle Swarm Optimization Algorithm for Integer Factorization Problem (IFP)
This paper presents particle swarm optimization (PSO) method to find the prime factors of a composite number. Integer factorization is a well known NP hard problem and security of many cryptosystem is based on difficulty of integer factorization. A particle swarm optimization algorithm for integer factorization has been devised and tested on different 100 numbers. It has been found that the PSO...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2015
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom3037