Vector and Parallel Algorithms for Integer Factorisation
نویسنده
چکیده
The problem of finding the prime factors of large composite numbers is of practical importance since the advent of public key cryptosystems whose security depends on the presumed difficulty of this problem. In recent years the best known integer factorisation algorithms have improved greatly. It is now routine to factor 60-decimal digit numbers, and possible to factor numbers of more than 110 decimal digits. We describe several integer factorisation algorithms, and consider their suitability for implementation on vector processors and parallel machines. Comments Only the Abstract is given here. The full paper appeared as [4]. For related work, see [1, 2, 3].
منابع مشابه
Integer Factorisation on the AP1000∗
We compare implementations of two integer factorisation algorithms, the elliptic curve method (ECM) and a variant of the Pollard “rho” method, on three machines (the Fujitsu AP1000, VP2200 and VPP500) with parallel and/or vector architectures. ECM is scalable and well suited for both vector and parallel architectures.
متن کاملFactorisation of Large Integers on some Vector and Parallel Computers
A list of technical reports, including some abstracts and copies of some full reports may be found at: Abstract We compare implementations of two integer factorization algorithms, the elliptic curve method (ECM) and a variant of the Pollard \rho" method, on three machines with parallel and/or vector architectures. ECM is scalable and well suited for both vector and parallel architectures. The \...
متن کاملSome Parallel Algorithms for Integer Factorisation
Algorithms for finding the prime factors of large composite numbers are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of the factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in part to Moore’s law and in part to algorithmic improveme...
متن کاملRecent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of solving these problems. This paper considers primarily the integer factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in par...
متن کاملParallel Algorithms for Integer Factorisation
The problem of finding the prime factors of large composite numbers has always been of mathematical interest. With the advent of public key cryptosystems it is also of practical importance, because the security of some of these cryptosystems, such as the Rivest-Shamir-Adelman (RSA) system, depends on the difficulty of factoring the public keys. In recent years the best known integer factorisati...
متن کامل