Primality testing and 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 factorisation algorithms have improved greatly, to the point where it is now easy to factor a 60-decimal digit...[Show more]
|Collections||ANU Research Publications|
|1667-01.2003-07-10T04:12:25Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-90-03.pdf||195.6 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.