I understand that many cryptographic algorithms depend on the difficulty of large prime factorization.
Will a list of all prime numbers upto certain number of bits make it easy for an attacker to compromise such algorithms?
$\begingroup$
$\endgroup$
3
-
2$\begingroup$ Does this How big an RSA key is considered secure today? satisfies you? and this Adi Shamir's secret database of all primes and Is it feasible to build an index of prime factors? and this is an another attack way The GCD strikes back to RSA in 2019 - Good randomness is the only solution? $\endgroup$– kelalakaOct 14, 2020 at 16:51
-
$\begingroup$ @kelalaka Thank you! Very important, useful, and interesting read list. $\endgroup$– Ritesh SinghOct 14, 2020 at 16:53
-
$\begingroup$ The last one ( index of prime factors) is your dupe, AFAIK. $\endgroup$– kelalakaOct 14, 2020 at 16:54
Add a comment
|