On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation
On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation
Fabrice Boudot
2017 · DBLP: journals/iacr/Boudot17
IACR Cryptology ePrint Archive · 5 Citations
TLDR
The pre-computation phase for a 768-bit discrete logarithm problem, that allows for example to build a massive decryption tool of IPsec traffic protected by the Oakley group 1, was feasible in reasonable time using technologies available before the year 2000.