Alessandro Budroni
Orcid: 0000-0002-3544-5128
According to our database1,
Alessandro Budroni authored at least 26 papers
between 2016 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2026
One Pair to Rule Them All: An Optimal Algorithm for Solving Code Equivalence via Codeword Search.
IACR Cryptol. ePrint Arch., 2026
Proceedings of the Post-Quantum Cryptography - 17th International Workshop, 2026
Two Is All It Takes: Asymptotic and Concrete Improvements for Solving Code Equivalence.
Proceedings of the Public-Key Cryptography - PKC 2026, 2026
2025
IACR Cryptol. ePrint Arch., 2025
IACR Commun. Cryptol., 2025
Runtime Code Generation for Constant-Time Secret-Indexed Array Accesses: Applications to PERK and NTRU.
Proceedings of the Progress in Cryptology - LATINCRYPT 2025, 2025
2024
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024
Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024
2023
Further Improvements of the Estimation of Key Enumeration with Applications to Solving LWE.
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
Appl. Algebra Eng. Commun. Comput., 2022
2021
2020
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020
Proceedings of the Information and Communications Security - 22nd International Conference, 2020
2019
The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019
2018
2017
2016
Proceedings of the Working Notes Proceedings of the MediaEval 2016 Workshop, 2016