Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

New answers tagged

1 vote

Would calculating the nth prime ruin encryption?

Finding the n-th prime, given n, is quite feasible for say 30 digit n. But it’s completely irrelevant to cryptography. Finding the n-th prime requires knowledge of all the smaller primes (because if q ...
gnasher729's user avatar
  • 1,256
0 votes

Would calculating the nth prime ruin encryption?

@Kodlu I provide an empirical bound for $prime-number$ which is weird so test it before judge the algebra : The inverse of the prime counting function is roughly : $$\pi^{-1}(x)\simeq p\left(x\right)=\...
1 vote

How to better generate large primes: sieving and then random picking or random picking and then checking?

If you look at 1024 bit numbers, about one in 700 is a prime. Eventually you check a prime, the effort for that is about 50 or 64 rounds of the Miller-Rabin test. If you just pick random numbers, one ...
gnasher729's user avatar
  • 1,256

Top 50 recent answers are included