Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

Name: Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
Uploaded: 2020-01-01
Duration: 22 min 3 s
Description: Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields — a 2020 Crypto 2020 security conference talk on crypto (22:03 min). Watch the full video, indexed free on the Breach Arc Archive.

Crypto 2020 · 2020 · 22:03

▶

Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields — a 2020 Crypto 2020 security conference talk on crypto (22:03 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive