Home

UNSOLVED PROBLEMS

in Number Theory, Logic, and Cryptography


Up
Introduction
What's New?
FAQ
Chromatic Number
Collatz
Dorabella Cipher
Euler's Brick
Goldbach
Legendre
Odd Perfect Number
Riemann Hypothesis
RSA Challenge
Square of Squares
Twin Primes
Voynich Manuscript
Zodiac
Solutions
Math Tuition

 

RSA Challenge

Factoring large (very large) numbers is hard (very hard).  Indeed, most of the security features of the online world depend on this fact.  To aid in research into factorization, and to check that no-one can break the system used to encrypt sensitive data, RSA laboratories have provided a challenge to factor several large numbers.  Only one such number, RSA-1024, is given here:

13506641086599522334960321627880596993888147560566
70275244851438515265106048595338339402871505719094
41798207282164471551373680419703964191743046496589
27425623934102086438320211037295872576235850964311
05640735015081875106765946292055636855294752135008
52879416377328533906109750544334999811150056977236
890927563

 

The problem is to find the factors of this 309-digit number.

 

For further information, please see:

[1] http://www.rsasecurity.com/rsalabs/node.asp?id=2091

[2] http://mathworld.wolfram.com/PrimeFactorizationAlgorithms.html

[3] http://citeseer.ist.psu.edu/327036.html

 

 

* There are currently 0 proposed solutions on the solutions page.


Home ] Introduction ] What's New? ] FAQ ] Chromatic Number ] Collatz ] Dorabella Cipher ] Euler's Brick ] Goldbach ] Legendre ] Odd Perfect Number ] Riemann Hypothesis ] [ RSA Challenge ] Square of Squares ] Twin Primes ] Voynich Manuscript ] Zodiac ] Solutions ] Math Tuition ]


       Site developed and maintained by Tim Roberts .
       Last modified: August 01, 2007                        v 016