Enhanced Classical & Quantum Algorithms for the Subset-Sum Problem 🔍
Discover cutting-edge improvements in classical and quantum algorithms tackling the Subset-Sum problem, presented at Asiacrypt 2020 by Bonnetain et al. for better efficiency and security insights.
IACR
256 views • Dec 2, 2020
About this video
Paper by Xavier Bonnetain, Rémi Bricout, André Schrottenloher, Yixin Shen presented at Asiacrypt 2020
See https://iacr.org/cryptodb/data/paper.php?pubkey=30698.
The conference program is at https://asiacrypt.iacr.org/2020/program.php
See https://iacr.org/cryptodb/data/paper.php?pubkey=30698.
The conference program is at https://asiacrypt.iacr.org/2020/program.php
Video Information
Views
256
Duration
17:44
Published
Dec 2, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.