I'm working on encrypting a small message using RSA. Are there any types of primes or primes of particular property that would make RSA decryption particularly difficult?(adsbygoogle = window.adsbygoogle || []).push({});

Furthermore are there any better ways that just randomly trying to factorise to break RSA encryption or is there some particularly good way?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# RSA help please

Loading...

Similar Threads for help please |
---|

B Help understanding a proof |

**Physics Forums | Science Articles, Homework Help, Discussion**