
October 18th, 2003, 03:52 PM
#1
RSA Challenge
I am working on learning cryptography and I stumbled across http://www.rsasecurity.com/rsalabs/c...ngenumbers.txt. I was wondering er, as stupid as it sounds, I am supposed to get a key out of that, and/or factor the modulus?

October 18th, 2003, 04:11 PM
#2
Member
Hey dude,
the url you gave us is incorrect you should click the edit button just above your post and correct it and I will try my best to help... I have just done my research and found this http://www.rsasecurity.com/rsalabs/c...g/numbers.html is this what you was after
p.s. in case you didn't know though I suspect you do instead of copying the text word by word just hightlight the url and press ctrl + c then go to the place where you want the url and press ctrl + v

October 18th, 2003, 04:13 PM
#3
Just remove the period from the end of the URL.
AntiOnline Quick Forum Version 2b Click Here
10010101000000110010001100111

October 18th, 2003, 04:21 PM
#4
Member
cheers so it is http://www.rsasecurity.com/rsalabs/c...ngenumbers.txt
p.s. spools.exe I just happen to be listening to a soulfly album for the first time right now, and coincidently, it is the first time I have seen you here

October 18th, 2003, 10:49 PM
#5
Now that we've corrected my link, back to the original question? Am I just supposed to factor the number into two prime numbers (factor the modulus) or get a plaintext message out of it?

October 19th, 2003, 02:20 AM
#6
Originally posted here by PM8228
Now that we've corrected my link, back to the original question? Am I just supposed to factor the number into two prime numbers (factor the modulus) or get a plaintext message out of it?
There is no plaintext message in this challenge.
What RSA have supplied is n (that very long decimal number), which in turn is equal to p*q,
where p & q are both very large prime numbers.
The larger the number, the higher the prize
The reason for the challenge is that the entire security of RSA relies on the fact that they can make n public, whilst keeping p & q secret.
You'll need to read up on the maths behind this to see why this is so important.
You can also see by looking at their site, the estimated time it would take to break using a network of normal PCs, which starts to get ridiculous at about 1024 bit length.

October 19th, 2003, 11:00 PM
#7
Just making sure what I had to break. I have "The Mathematical Guts of RSA Encryption" right next to me. Maybe I just didnt read it right. Either way, Thanks. Hopefully I will find a new method :o
It is I, me

November 3rd, 2003, 04:40 AM
#8
Senior Member
Originally posted here by PM8228
Just making sure what I had to break. I have "The Mathematical Guts of RSA Encryption" right next to me. Maybe I just didnt read it right. Either way, Thanks. Hopefully I will find a new method :o
It is I, me
how did u get it?

November 3rd, 2003, 03:49 PM
#9
How RSA works? It is a well known process that goes something like this...
1) find two large (1024+ bit) numbers
2) Find E so that it is relatively prime with (P1)(Q1)
3) Find D, the relative inverse of E?
4)....
I forget the rest.
Google: "The Mathematical Guts of RSA Encryption" The first link should be a good one. BTW, BESS will block it under the category, "illegal." What the hell is with that? It is hardly illegal.
Sam

November 4th, 2003, 09:20 AM
#10
So with that, how do you plan to factor a 174 digit number? Unless you have a supercomputer or a very nice cluster, I think you are going to need a little more than how RSA works.
But if you do have any good ideas, drop a line; I will try and give you a hand (I like money!)
You shall no longer take things at second or third hand,
nor look through the eyes of the dead...You shall listen to all
sides and filter them for your self.
Walt Whitman
Posting Permissions
 You may not post new threads
 You may not post replies
 You may not post attachments
 You may not edit your posts

Forum Rules

