Juan Grados 0002

dblp:264/3997-2 · also Juan del Carmen Grados Vasquez · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0002-3863-3714ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 1 first-author · 5 since 2021
YearPublicationVenuePosition
2025 The Window Heuristic: Automating Differential Trail Search in ARX Ciphers with Partial Linearization Trade-offs
Emanuele Bellini 0002, David Gérault, Juan Grados 0002, Thomas Peyrin
CT-RSA3
2023 Fully Automated Differential-Linear Attacks Against ARX Ciphers
Emanuele Bellini 0002, David Gérault, Juan Grados 0002, Rusydi H. Makarim, Thomas Peyrin
CT-RSA3
2023 CLAASP: A Cryptographic Library for the Automated Analysis of Symmetric Primitives
Emanuele Bellini 0002, David Gérault, Juan Grados 0002, Yun Ju Huang, Rusydi H. Makarim, Mohamed Rachidi
SAC3
2023 Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró
Murilo Coutinho, Iago Passos, Juan Grados 0002, Santanu Sarkar 0001, Fábio L. L. Mendonça, Rafael Timóteo de Sousa Júnior, Fábio Borges
J. Cryptol.3
2022 Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró
Murilo Coutinho, Iago Passos, Juan Grados 0002, Fábio L. L. Mendonça, Rafael Timteo de Sousa, Fábio Borges
ASIACRYPT (1)3
2015 An Efficient One-Bit Model for Differential Fault Analysis on Simon Family
abstract
In this paper, we describe a family of symmetric cryptographic algorithms and present its cryptanalysis. Specifically, we use differential fault analysis to show a fault attack threat to the block cipher family named Simon. In addition, we present the improvement of a fault attack based on a differential attack method. Moreover, we are the first to to extract the entire secret key using only one round. This property is important because an attacker has to control the hardware to inject faults. However, if the attacker has control of only few hardware components and they compute only one round, previous attacks are not able to recover the entire key. With this side-channel analysis, an attacker can inject faults in one round of Simon with block of 96 or 128 bits to recover therespective entire key of 96 or 128 bits without using SAT solver neither computing Grobner bases. The key can be recoveredusing only differential fault analysis.
Juan Grados 0002, Fábio Borges, Renato Portugal, Pedro C. S. Lara
FDTC1