mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2013-02-05, 23:03   #1
farah
 
Feb 2013

110 Posts
Default Minimal information about RSA prime factorization

Hi

I'm not mathematician and I have very basic knowledge of math. So sorry if my question is so simple.

I want to know is there some known facts about basic information on RSA prime factors? I mean like:

- Prime factors (p and q) of RSA keys have same length or
- You can guess (at least) length of P and Q from given public key or
- You can guess minimum length of one of prime factors
etc.

Is there some known basic information on RSA keys?

Thanks
farah is offline   Reply With Quote
Old 2013-02-05, 23:58   #2
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3·29·83 Posts
Default

p and q have roughly the same length, so that neither is too small, but if they were very similar, they would also be easier to find. So for an RSA key of 1024 bits, p and q are around 512 bits each -- maybe plus or minus a few bits.

However, there are still 2^511 numbers with 512 bits, and so maybe ~2^502 prime numbers with 512 bits which are potentially p or q -- so even knowing the bit length of the factors doesn't help.
Dubslow is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Semi-prime factorization conjecture Alberico Lepore Alberico Lepore 7 2018-02-16 08:27
Prime factorization for RSA210 Kalestiel Factoring 6 2012-11-04 17:58
prime factorization algorithms? MathBoy Math 55 2011-02-11 21:06
Mersenne(prime exponents) factorization science_man_88 Miscellaneous Math 3 2010-10-13 14:32
The most minimal Linux Uncwilly Linux 10 2004-11-24 10:51

All times are UTC. The time now is 06:56.


Sat Jul 17 06:56:58 UTC 2021 up 50 days, 4:44, 1 user, load averages: 1.37, 1.86, 1.73

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.