Timeline for In which case number field sieve/index calculus is faster for solving discrete logarithm?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2021 at 22:43 | comment | added | Daniel S | For 512-bit $P$ we can quote actual performance figures. The Logjam attack (en.wikipedia.org/wiki/Logjam_(computer_security)) was able to use the number field sieve to break such a system with a few thousand core weeks. 256-bit $P$ would be even more insecure. | |
| Mar 5, 2021 at 22:28 | comment | added | J. Doe | Given that order at which position would be 511-bit $q$ with 512-bit $P$ or 255-bit $q$ with 256-bit $P$? | |
| Mar 5, 2021 at 21:59 | history | answered | Daniel S | CC BY-SA 4.0 |