3 ms·
Also not "factored", but rather a discrete logarithm can be taken. The apparent difficulty of factorization underlies some public-key systems (like RSA), while
by schoen 9y ago
Also not "factored", but rather a discrete logarithm can be taken.
The apparent difficulty of factorization underlies some public-key systems (like RSA), while the apparent difficulty of extracting discrete logarithms underlies others (like Diffie-Hellman key exchange and DSA). This research is about the second problem.
- tptacek 9y agoThe problems are closely related, and, in fact, the NFS algorithms are really IFP algorithms.