From post

Finding Many Collisions via Reusable Quantum Walks - Application to Lattice Sieving.

, , , и . EUROCRYPT (5), том 14008 из Lecture Notes in Computer Science, стр. 221-251. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Compressing integer lists with Contextual Arithmetic Trits., и . CoRR, (2022)Lattice Sieving via Quantum Random Walks., и . ASIACRYPT (4), том 13093 из Lecture Notes in Computer Science, стр. 63-91. Springer, (2021)Ternary Syndrome Decoding with Large Weight., , , и . SAC, том 11959 из Lecture Notes in Computer Science, стр. 437-466. Springer, (2019)The Quantum Decoding Problem., и . TQC, том 310 из LIPIcs, стр. 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)QCB: Efficient Quantum-secure Authenticated Encryption., , , , , , и . IACR Cryptol. ePrint Arch., (2020)Quantum security of the Fiat-Shamir transform of commit and open protocols.. IACR Cryptology ePrint Archive, (2019)Finding many Collisions via Reusable Quantum Walks., , , и . IACR Cryptol. ePrint Arch., (2022)A Note on the Quantum Query Complexity of Permutation Symmetric Functions.. ITCS, том 124 из LIPIcs, стр. 19:1-19:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Safely Doubling your Block Ciphers for a Post-Quantum World., , , и . IACR Cryptol. ePrint Arch., (2022)The Quantum Decoding Problem., и . IACR Cryptol. ePrint Arch., (2023)