no, that’s definitely not how it is done. Say you want to find a prime of 512 bi...
Réponse publiée sur Quora
no, that’s definitely not how it is done. Say you want to find a prime of 512 bits for a RSA key. Using the form on Online RSA key generation you get for example 7695569724472218968357329983247783518365587380788656749355931322901061644229490935790270202575436100837766691896209961622963876832779623061869802179230227 which has 154 decimals. So its square root has 77 decimals, which means your method consists in trying to divide the number above by all primes up to 1077 . Now if you use a Prime-counting function - Wikipedia you’ll find there are about 5.67*1074 such primes. No supercomputer can try the divisions in the lifetime of the Universe.
Sorry, but I downvote you because you should “know” your answer is good, not “believe” it.
Sur le même sujet
- What ? Russell’s proof ? No. He precisely developed formal logic to circumvent i...
- numbers are correct, but there is no deforestation since long :In total, between...
- actually we had banking secrecy instead of trusts ;-)Some rich people create Fou...
- Alas, you pictured probably the most deadly place in Switzerland.Matterhorn is o...
- in Switzerland, people can raise “Popular initiatives” to modify the Constitutio...