scispace - formally typeset
B

Benoît Gérard

Researcher at Université catholique de Louvain

Publications -  51
Citations -  1662

Benoît Gérard is an academic researcher from Université catholique de Louvain. The author has contributed to research in topics: Block cipher & Phosphene. The author has an hindex of 21, co-authored 51 publications receiving 1456 citations. Previous affiliations of Benoît Gérard include French Institute for Research in Computer Science and Automation & University of Rennes.

Papers
More filters
Journal ArticleDOI

Pattern recognition with the optic nerve visual prosthesis

TL;DR: A volunteer with retinitis pigmentosa and no residual vision was chronically implanted with an optic nerve electrode connected to an implanted neurostimulator and antenna for electrical activation of the nerve which resulted in phosphene perception.
Book ChapterDOI

An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks

TL;DR: In this article, a Bayesian extension of non-profiled side-channel attacks is proposed to rate key candidates according to their respective probabilities, and a new deterministic algorithm is provided to optimally enumerate key candidates from any number of (possibly redundant) lists of any size, given that the subkey information is provided as probabilities, at the cost of limited memory requirements.
Proceedings ArticleDOI

Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers

TL;DR: This paper investigates the security of the BLISS lattice-based signature scheme, one of the most promising candidates for postquantum-secure signatures, against side-channel attacks, and shows that a single execution of the strongSwan signature algorithm is actually sufficient for full key recovery.
Book ChapterDOI

Block ciphers that are easier to mask: how far can we go?

TL;DR: A detailed security analysis of this new cipher taking its design specificities into account is provided, leading us to exploit innovative techniques borrowed from hash function cryptanalysis (that are sometimes of independent interest).
Book ChapterDOI

Security Evaluations beyond Computing Power

TL;DR: A key rank estimation algorithm is described that provides tight bounds for the security level of leaking cryptographic devices and is able to analyze the full complexity of “standard” (i.e. divide-and-conquer) side-channel attacks, in terms of their tradeoff between time, data and memory complexity.