A Kilobit Hidden SNFS Discrete Logarithm Computation

Learn about a groundbreaking computation in cryptography presented at Eurocrypt 2017. Explore the kilobit hidden SNFS discrete logarithm computation through this 21-minute conference talk. Delve into topics such as prime numbers, polynomial selection, and the Special Number Field Sieve (SNFS). Examine the Digital Signature Algorithm, DSA primes, and generated primes. Analyze the results and safety implications of this computation. Investigate remaining primes, RFC 5104, NIST test data, and Gordon's trapdoor. Gain insights into important considerations for cryptographic security and discrete logarithm problems.

Introduction
Review
Primes
Practice
Polynomial Selection
SNFS
Digital Signature Algorithm
Eurocrypt 1992
DSA Prime
Generated Prime
Results
Is it safe
Remaining Primes
RFC 5104
NIST test data
Gordons trapdoor
Considerations