Gaël Thomas 0002

dblp:83/6740-2 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0002-9444-1071ORCID · corroborated

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

Security and privacy · 5 · 3 since 2021Systems, architecture and hardware · 1
YearPublicationVenuePosition
2026 ISI: A New Tool for Instruction Integrity against Fault Injection Attacks Using Low-Latency MAC
Fatimaezzahraa Boutagouaouin, Emmanuel Amankwah, Vianney Lapotre, Hélène Le Bouder, Gaël Thomas 0002
SECRYPT (1)5
2023 Blind Side Channel Analysis Against AEAD with a Belief Propagation Approach
Modou Sarry, Hélène Le Bouder, Eïd Maaloouf, Gaël Thomas 0002
CARDIS4
2022 Blind Side Channel on the Elephant LFSR
abstract
International audience
Awaleh Houssein Meraneh, Christophe Clavier, Hélène Le Bouder, Julien Maillard, Gaël Thomas 0002
SECRYPT5
2016 Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: Lilliput
abstract
While Generalized Feistel Networks (GFNs) have been widely studied in the literature as a building block of a block cipher, we recall in this paper the results of [1] where a unified vision to easily represent them through a matrix representation is proposed. We also introduce a new class of such schemes called Extended Generalized Feistel Networks well suited for cryptographic applications. We instantiate this particular construction into a lightweight block cipher called Lilliput analyzing its security and its hardware performances.
Thierry P. Berger, Julien Francq, Marine Minier, Gaël Thomas 0002
IEEE Trans. Computers4
2014 On Fault Injections in Generalized Feistel Networks
abstract
In this paper, we propose a generic method to assess the vulnerability to Differential Fault Analysis of generalized Feistel networks (GFN). This method is based on an in-depth analysis of the GFN properties. First the diffusion of faults is studied, both at the block level and at the S-box level, in order to have a fault which maximizes the number of S-boxes impacted by a fault. Then the number of faults in an S-box required to find the key is evaluated. By combining these results, a precise assessment of the vulnerability to fault attacks of GFN can be made. This method is then used on several examples of Feistel ciphers.
Hélène Le Bouder, Gaël Thomas 0002, Yanis Linge, Assia Tria
FDTC2
2013 Extended Generalized Feistel Networks Using Matrix Representation
Thierry P. Berger, Marine Minier, Gaël Thomas 0002
Selected Areas in Cryptography3