# Tag Info

Accepted

### Big prime factor of the prime number you feed to Diffie Hellman

My question is: HOW BIG of a prime factor does (N-1) need to have, in order for Diffie-Hellman to be considered secure, Background: if Diffie-Hellman, we have a generator $g$; the size of the ...
• 148k
Accepted

### Reduction from factoring to RSA and the Oracle RSA problem

About the Generic Model of Computation, in "On the Analysis of Cryptographic Assumptions in the Generic Ring Model" by Jager and Schwenk they state that, "We prove in the generic ring ...
• 322

• 350
1 vote
Accepted

### RSA given 30% MSB of p and 30%MSB of q

Since the reference given in the other answer is 18 years old, as well as being erroneous w.r.t. division as pointed out by @fgrieu, I did some digging around for more recent results/updates on ...
• 22.8k
1 vote

### RSA given 30% MSB of p and 30%MSB of q

No, knowing the MSB of p you could calculate the MSB of q dividing it by n, so knowing MSB of p AND q is redundant. ~50% with coppersmith is the best u can do (for now...) https://cacr.uwaterloo.ca/...
• 59
1 vote

### Can a very efficient RSA factoring algorithm be worth money?

There may be secrets protected by RSA that would be worth a million dollars to uncover. But there’s a problem: If I sent out ten encrypted messages, and you don’t know which one contains the valuable ...
• 1,272
1 vote

### Can a very efficient RSA factoring algorithm be worth money?

To add to the perfectly fine other answer: Your question "how long must it take" depends on the computing power you have, and can only be answered in the context of specific hardware and ...
• 22.8k

Only top scored, non community-wiki answers of a minimum length are eligible