Gustavo Banegas

Orcid: 0000-0001-5502-2977

According to our database1, Gustavo Banegas authored at least 26 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Breaking DPA-protected Kyber via the pair-pointwise multiplication.
IACR Cryptol. ePrint Arch., 2023

Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields.
IACR Cryptol. ePrint Arch., 2023

Multi-Armed SPHINCS+.
IACR Cryptol. ePrint Arch., 2023

Multi-armed SPHINCS<sup>+</sup>.
Proceedings of the Applied Cryptography and Network Security Workshops, 2023

2022
Disorientation faults in CSIDH.
IACR Cryptol. ePrint Arch., 2022

Efficient supersingularity testing over 픽<sub>p</sub> and CSIDH key validation.
IACR Cryptol. ePrint Arch., 2022

On recovering block cipher secret keys in the cold boot attack setting.
CoRR, 2022

Quantum-Resistant Software Update Security on Low-Power Networked Embedded Devices.
Proceedings of the Applied Cryptography and Network Security, 2022

2021
Concrete quantum cryptanalysis of binary elliptic curves.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

CTIDH: faster constant-time CSIDH.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021

Non-Interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning.
IACR Cryptol. ePrint Arch., 2021

Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices.
IACR Cryptol. ePrint Arch., 2021

Wavelet: Code-based postquantum signatures with fast verification on microcontrollers.
IACR Cryptol. ePrint Arch., 2021

Wavelet: Code-based postquantum signatures with fast verification on microcontrollers.
CoRR, 2021

sf DEVA: Decentralized, Verifiable Secure Aggregation for Privacy-Preserving Learning.
Proceedings of the Information Security - 24th International Conference, 2021

2020
Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing.
Cryptogr., 2020

Statically Aggregate Verifiable Random Functions and Application to E-Lottery.
Cryptogr., 2020

2019
A new class of irreducible pentanomials for polynomial-based multipliers in binary fields.
J. Cryptogr. Eng., 2019

A Reaction Attack against Cryptosystems based on LRPC Codes.
IACR Cryptol. ePrint Arch., 2019

Don't forget your roots: constant-time root finding over 픽<sub>2<sup>m</sup></sub>.
IACR Cryptol. ePrint Arch., 2019

Don't Forget Your Roots: Constant-Time Root Finding over \mathbb F_2^m F 2 m.
Proceedings of the Progress in Cryptology - LATINCRYPT 2019, 2019

2018
Designing Efficient Dyadic Operations for Cryptographic Applications.
IACR Cryptol. ePrint Arch., 2018

DAGS: Reloaded Revisiting Dyadic Key Encapsulation.
IACR Cryptol. ePrint Arch., 2018

2017
DAGS: Key Encapsulation using Dyadic GS Codes.
IACR Cryptol. ePrint Arch., 2017

Low-communication parallel quantum multi-target preimage search.
IACR Cryptol. ePrint Arch., 2017

2014
Attacks in Stream Ciphers: A Survey.
IACR Cryptol. ePrint Arch., 2014


  Loading...