Low Weight Discrete Logarithms and Subset Sum in $2^{0.65n}$ with Polynomial Memory

Name: Low Weight Discrete Logarithms and Subset Sum in $2^{0.65n}$ with Polynomial Memory
Uploaded: 2020-01-01
Duration: 24 min 24 s
Description: Low Weight Discrete Logarithms and Subset Sum in $2^{0.65n}$ with Polynomial Memory — a 2020 Eurocrypt 2020 security conference talk on crypto (24:24 min). Watch the full video, indexed free on the Breach Arc Archive.

Eurocrypt 2020 · 2020 · 24:24

▶

Low Weight Discrete Logarithms and Subset Sum in $2^{0.65n}$ with Polynomial Memory — a 2020 Eurocrypt 2020 security conference talk on crypto (24:24 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive