How come keys can stay secure through factorization of primes

Published: 11/07/2019
How come keys can stay secure through factorization of primes
Source: SECURITY.STACKEXCHANGE.COM

Sooo I under n=pq where p and q are both large primes so it making factorizing them inefficient to the point of impossible but there must a a list of prime sets (heard people call them trap doors I think?) That are well know? Like if p and q are both know pairs wouldn't you be able look at n and go well I know this already so I don't need to even work it out I already can tell you it's pq. Or a

Read more
Related news
Comment
FACEBOOK