Published in In *eprint*, 2024
This paper performs a fault analysis on the SNOVA signature scheme, revealing key-recovery vulnerabilities under both transient and permanent fault conditions.
Recommended citation: Gustavo Banegas, Ricardo Villanueva-Polanco. (2024). "A Fault Analysis on SNOVA." In eprint.
Download Paper | Download Slides | Download Bibtex
Published in Preprint / Work in Progress, 2023
This work introduces a framework for evaluating rational isogenies over finite fields using Frobenius techniques, improving efficiency in isogeny-based cryptographic protocols.
Recommended citation: Gustavo Banegas, Valerie Gilchrist, Anaelle Le Devehat, Benjamin Smith. (2023). "Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields." Preprint.
Download Paper | Download Slides | Download Bibtex
Published in In *ACNS-SCI 2023*, 2023
This paper accelerates SPHINCS+ signing on mobile CPUs using parallelism and vector extensions, achieving 15x speed-up over sequential implementations.
Recommended citation: Gustavo Banegas, Florian Caullery. (2023). "Multi-Armed SPHINCS+." In ACNS-SCI 2023.
Download Paper | Download Slides | Download Bibtex
Published in Preprint / Work in Progress, 2023
A new side-channel template attack on masked Kyber reveals that pair-pointwise multiplication leaks information even in DPA-protected implementations.
Recommended citation: Estuardo Alpirez Bock, Gustavo Banegas, Chris Brzuska, Łukasz Chmielewski, Kirthivaasan Puniamurthy, Milan Šorf. (2023). "Breaking DPA-Protected Kyber via the Pair-Pointwise Multiplication." Preprint.
Download Paper
Published in In *IACR eprint*, 2022
This paper introduces disorientation fault attacks against CSIDH and CTIDH implementations, exploiting algebraic subroutines to recover secret keys with a modest number of faults.
Recommended citation: Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer, Lorenz Panny, Krijn Reijnders, Jana Sotáková, Monika Trimoska. (2022). "Disorientation Faults in CSIDH." In IACR eprint.
Download Paper | Download Slides | Download Bibtex
Published in Preprint / Working Paper, 2022
This paper proposes a hybrid quantum-classical strategy to recover block cipher keys in the cold boot attack scenario, including results for AES, LowMC, and the post-quantum Picnic scheme.
Recommended citation: Gustavo Banegas, Ricardo Villanueva-Polanco. (2022). "On Recovering Block Cipher Secret Keys in the Cold Boot Attack Setting." Preprint, available on arXiv.
Download Paper | Download Slides | Download Bibtex
Published in In *24th Information Security Conference* (ISC), 2021
DEVA introduces a decentralized and verifiable secure aggregation framework for federated learning, preserving user privacy while ensuring correctness and robustness.
Recommended citation: Georgia Tsaloli, Bei Liang, Carlo Brunetta, Gustavo Banegas, Aikaterini Mitrokotsa. (2021). "DEVA: Decentralized, Verifiable Secure Aggregation for Privacy-Preserving Learning." In 24th Information Security Conference (ISC).
Download Paper | Download Slides | Download Bibtex
Published in Preprint / Work in Progress, 2021
Wavelet is a post-quantum code-based signature scheme with fast verification on embedded devices, demonstrating efficiency and practicality at NIST security level 1.
Recommended citation: Gustavo Banegas, Thomas Debris-Alazard, Milena Nedeljković, Benjamin Smith. (2021). "Wavelet: Code-based Post-Quantum Signatures with Fast Verification on Microcontrollers." Preprint.
Download Paper | Download Slides | Download Bibtex
Published in In *IACR Transactions on Cryptographic Hardware and Embedded Systems* (TCHES), 2021
This work presents CTIDH, a new key space and algorithm that jointly enable fast, constant-time CSIDH, significantly reducing multiplication and cycle counts.
Recommended citation: Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, Michael Meyer, Benjamin Smith, Jana Sotáková. (2021). "CTIDH: Faster Constant-Time CSIDH." In IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES).
Download Paper | Download Slides | Download Bibtex
Published in Preprint / Work in Progress, 2021
This paper evaluates post-quantum signature schemes for securing software updates on resource-constrained IoT devices, based on the SUIT standard.
Recommended citation: Gustavo Banegas, Koen Zandberg, Adrian Herrmann, Emmanuel Baccelli, Benjamin Smith. (2021). "Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices." Preprint.
Download Paper | Download Slides | Download Bibtex
Published in In *Australasian Conference on Information Security and Privacy* (ACISP), 2021
We propose a non-interactive and secure verifiable aggregation protocol suitable for decentralized, privacy-preserving learning scenarios.
Recommended citation: Carlo Brunetta, Georgia Tsaloli, Bei Liang, Gustavo Banegas, Aikaterini Mitrokotsa. (2021). "Non-Interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning." In Australasian Conference on Information Security and Privacy (ACISP).
Download Paper | Download Slides | Download Bibtex
Published in In *IACR Transactions on Cryptographic Hardware and Embedded Systems* (TCHES), 2020
This paper optimizes quantum circuits for solving discrete logarithms over binary elliptic curves, reducing qubit and gate requirements to enable more feasible attacks with Shor’s algorithm.
Recommended citation: Gustavo Banegas, Daniel J. Bernstein, Iggy van Hoof, Tanja Lange. (2020). "Concrete Quantum Cryptanalysis of Binary Elliptic Curves." In IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES).
Download Paper | Download Slides | Download Bibtex
Published in PhD Thesis, 2019
This PhD thesis explores both the design and cryptanalysis of post-quantum cryptographic schemes, focusing on quantum attacks and practical implementations.
Recommended citation: Gustavo Banegas. (2019). "Selected Constructive and Destructive Approaches to Post-Quantum Cryptography." PhD Thesis.
Download Paper | Download Slides | Download Bibtex
Published in In *International Conference on Cryptology and Information Security in Latin America* (Latincrypt), 2019
This paper presents a reaction attack targeting LRPC code-based cryptosystems, showing that decoding failures can leak information about the secret key structure.
Recommended citation: Simona Samardjiska, Paolo Santini, Edoardo Persichetti, Gustavo Banegas. (2019). "A Reaction Attack against Cryptosystems based on LRPC Codes." In International Conference on Cryptology and Information Security in Latin America (Latincrypt).
Download Paper | Download Slides | Download Bibtex
Published in In *International Conference on Cryptology and Information Security in Latin America* (Latincrypt), 2019
This work proposes a constant-time algorithm for finding roots in binary extension fields ( \mathbb{F}_{2^m} ), with applications to cryptography and countermeasures against timing attacks.
Recommended citation: Douglas Marcelino Beppler Martins, Gustavo Banegas, Ricardo Felipe Custodio. (2019). Don\'t Forget Your Roots Constant-Time Root Finding over \( \mathbb{F}_{2^m} \). In International Conference on Cryptology and Information Security in Latin America (Latincrypt).
Download Paper | Download Slides | Download Bibtex
Published in *Code-Based Cryptography Workshop 2019*, 2018
This paper revisits the DAGS key encapsulation mechanism, adapting its algorithms to a new KEM framework and proposing binary code parameters.
Recommended citation: Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiecoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane N’diaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini. (2018). "DAGS: Reloaded Revisiting Dyadic Key Encapsulation." In Code-Based Cryptography Workshop 2019.
Download Paper | Download Slides | Download Bibtex
Published in In *Journal of Mathematical Cryptology*, 2018
This work introduces DAGS, a code-based key encapsulation mechanism using dyadic Goppa codes. It provides efficiency and security in the context of post-quantum cryptography.
Recommended citation: Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiecoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane N’diaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini. (2018). "DAGS: Key Encapsulation using Dyadic GS Codes." In Journal of Mathematical Cryptology.
Download Paper | Download Slides | Download Bibtex
Published in In *MathCrypt 2018*, 2018
This paper introduces optimized techniques for dyadic matrix operations, relevant for compact code-based cryptography like DAGS.
Recommended citation: Gustavo Banegas, Paulo S. L. M. Barreto, Edoardo Persichetti, Paolo Santini. (2018). "Designing Efficient Dyadic Operations for Cryptographic Applications." In MathCrypt 2018.
Download Paper | Download Slides | Download Bibtex
Published in In *Journal of Cryptographic Engineering* (JCEN), 2018
This work introduces a new class of irreducible pentanomials over ( \mathbb{F}_2 ), enabling efficient polynomial-based multiplication with improved XOR and AND complexity.
Recommended citation: Gustavo Banegas, Ricardo Felipe Custodio, Daniel Panario. (2018). "A New Class of Irreducible Pentanomials for Polynomial-Based Multipliers in Binary Fields." In Journal of Cryptographic Engineering (JCEN).
Download Paper | Download Slides | Download Bibtex
Published in *NIST Submission*, 2017
This is the original NIST PQC Round 1 submission for the DAGS KEM, based on dyadic Goppa codes.
Recommended citation: Gustavo Banegas, Paulo S. L. M. Barreto, Brice Odilon Boidje, Pierre-Louis Cayrel, Gilbert Ndollane Dione, Kris Gaj, Cheikh Thiecoumba Gueye, Richard Haeussler, Jean Belo Klamti, Ousmane N’diaye, Duc Tri Nguyen, Edoardo Persichetti, Jefferson E. Ricardini. (2017). "DAGS: Key Encapsulation using Dyadic GS Codes." NIST Post-Quantum Cryptography Standardization Submission.
Download Paper | Download Slides | Download Bibtex
Published in In *Selected Areas in Cryptography* (SAC), 2017
This work introduces a quantum algorithm that achieves asymptotic speedup in multi-target preimage search, revising assumptions behind AES’s post-quantum security.
Recommended citation: Gustavo Banegas, Daniel J. Bernstein. (2017). "Low-Communication Parallel Quantum Multi-Target Preimage Search." In Selected Areas in Cryptography (SAC).
Download Paper | Download Slides | Download Bibtex