A Fault Analysis on SNOVA
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.
Publications
You can also find my articles on my Google Scholar profile.
Journal Articles
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields
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.
Multi-Armed SPHINCS+
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.
Breaking DPA-Protected Kyber via the Pair-Pointwise Multiplication
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.
Disorientation Faults in CSIDH
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.
On Recovering Block Cipher Secret Keys in the Cold Boot Attack Setting
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.
DEVA: Decentralized, Verifiable Secure Aggregation for Privacy-Preserving Learning
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.
Wavelet: Code-based Post-Quantum Signatures with Fast Verification on Microcontrollers
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.
CTIDH: Faster Constant-Time CSIDH
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.
Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices
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.
Non-Interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning
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.
Concrete Quantum Cryptanalysis of Binary Elliptic Curves
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.
Selected Constructive and Destructive Approaches to Post-Quantum Cryptography
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.
A Reaction Attack against Cryptosystems based on LRPC Codes
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.
Don’t Forget Your Roots Constant-Time Root Finding over ( \mathbb{F}_{2^m} )
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.
DAGS: Reloaded Revisiting Dyadic Key Encapsulation
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.
DAGS: Key Encapsulation using Dyadic GS Codes
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.
Designing Efficient Dyadic Operations for Cryptographic Applications
Published in In *MathCrypt 2018*, 2018
This paper introduces optimized techniques for dyadic matrix operations, relevant for compact code-based cryptography like DAGS.
A New Class of Irreducible Pentanomials for Polynomial-Based Multipliers in Binary Fields
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.
DAGS: Key Encapsulation using Dyadic GS Codes
Published in *NIST Submission*, 2017
This is the original NIST PQC Round 1 submission for the DAGS KEM, based on dyadic Goppa codes.
Low-Communication Parallel Quantum Multi-Target Preimage Search
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.