Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pierre-Yvan Liardet

dblp:32/4367 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 4Security and privacy · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Hardware security and side channels · 76% Cryptographic primitives and cryptanalysis · 24%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware security and side channels
side-channel countermeasures
0.122004
Leak Resistant Arithmetic · CHES 2004
Preventing SPA/DPA in ECC Systems Using the Jacobi Form · CHES 2001
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.012001
Preventing SPA/DPA in ECC Systems Using the Jacobi Form · CHES 2001
Hardware security and side channels
side-channel attack
0.012001
Preventing SPA/DPA in ECC Systems Using the Jacobi Form · CHES 2001
Hardware security and side channels › side-channel attack › power analysis
simple power analysis
0.012001
Preventing SPA/DPA in ECC Systems Using the Jacobi Form · CHES 2001

Methods — techniques the papers use, named apart from their topics

jacobi form · 0.0
YearPublicationVenuePosition
2020 Efficient Integrated Circuits Characterization Through Computer Vision Assistance
abstract
Industry tends to optimize accuracy and time efficiency of every process analyzing its constraints and limits. Several tasks requiring high precision and reproducibility must be automated. In the context of secure Integrated Circuits (ICs) characterization, tasks such as power analysis are commonly automated. However, very few automations exist for tools calibration, while recent characterization schemes encounter mechanical constraints. Computer vision, flexible tool used in various fields, gives opportunities to address these constraints. In the case of laser fault injections, several positioning adjustments are required to ensure a maximal energy transmission in a targeted point. An accurate focalization of the laser beam is reached by using an autofocus system. Such a system is obtained by analyzing the camera view of the IC in the time-frequency domain. Whatever the method to disturb an IC, every secure characterization should be reproducible. By exploiting computer vision assistance, fault injection can be automated by mixing vision techniques to build a full or partial view of an IC and automatically identify the targeted IC and focus the perturbation on a chosen pattern in the image. A reliable pattern detection is implemented by studying spatial consistency of image's remarkable features represented by graphs. This paper presents several computer vision techniques to address above problems.
Raphael Abele, Jean-Luc Damoiseaux, Daniele Fronte, Pierre-Yvan Liardet, Jean-Marc Boï, Djamel Merad
ETFA4
2020 Graph Matching Applied For Textured Pattern Recognition
abstract
This paper addresses the detection of noisy structures in the context of infrared microscopy using labeled undirected graph matching. The selection of robust features as labels is determinant in this case of study, where hard conditions are dealt with: few relevant topological information, a potentially huge number of outliers and low contrasted images resulting in noisy graphs. Firstly, the image texture is reliably caught through a scale, rotation and intensity invariant histogram of oriented gradients. Secondly, in structures presenting numerous symmetries, the graph shape is locally registered while discriminated using weight from a super-increasing series. Coupled to the flexibility of the graph tensor product-based similarity metric, the matching framework achieves satisfying results.
Raphael Abele, Jean-Luc Damoiseaux, Daniele Fronte, Pierre-Yvan Liardet, Jean-Marc Boï, Djamel Merad
ICIP4
2018 Autofocus in infrared microscopy
abstract
Autofocus (AF) is a widely investigated subject in the fields of natural scene images, industrial assembly and biologic microscopy. This paper proposes a new effective AF method for infrared (IR) microscopy in the context of the Integrated Circuit industry (IC). The proposed method operates in the wavelet domain using a custom orthogonal wavelet for the 2D Discrete Wavelet Transform (DWT). The quality criterion of our AF algorithm relies on the standard deviance of the DWT coefficients, computed per subband and per level. Tested on several optical magnifying lenses, our method is robust time-efficient, and usable on-the-fly in the IC location system.
Raphael Abele, Daniele Fronte, Pierre-Yvan Liardet, Jean-Marc Boï, Jean-Luc Damoiseaux, Djamel Merad
ETFA3
2015 Collision for Estimating SCA Measurement Quality and Related Applications
Ibrahima Diop, Mathieu Carbone, Sébastien Ordas, Yanis Linge, Pierre-Yvan Liardet, Philippe Maurine
CARDIS5
2015 Collision Based Attacks in Practice
abstract
Chosen-Message Simple Power Analysis, also called Collision Based Attacks (CBA), have been proposed by Fouque, Yen and Homma. These attacks aim at inducing and detecting collisions during modular operations. However, detecting collisions is a challenging task in real environments. Doing it in an automated manner is even more challenging. In this paper, we propose and compare some methods and criteria allowing to automatically (without any visual inspection) detect the occurrence of collisions in leakage traces acquired on modern (and thus noisy) circuits.
Ibrahima Diop, Pierre-Yvan Liardet, Yanis Linge, Philippe Maurine
DSD2
2013 Voltage Spikes on the Substrate to Obtain Timing Faults
abstract
Fault attacks are widely deployed against secure devices by hardware evaluation centers. While the least expensive fault injection techniques, like clock or voltage glitches, are well taken into account in secure devices by dedicated hardware counter-measures, more advanced techniques, such as light based attacks, require huge investments. This paper presents a new way to induce faults at a moderate cost that may defeat already in place hardware counter-measures. To demonstrate its effectiveness we applied this technique on an ASIC component. For this demonstration, fault exploitation is operated using the classic Bell core attack applied on a modular exponentiation supported by a modular arithmetic co-processor.
Karim Tobich, Philippe Maurine, Pierre-Yvan Liardet, Mathieu Lisart, Thomas Ordas
DSD3
2011 Shape analysis for power signal cryptanalysis on secure components
Frédérique Robert-Inacio, Alain Trémeau, Mike Fournigault, Yannick Teglia, Pierre-Yvan Liardet
J. Syst. Softw.5
2004 Leak Resistant Arithmetic
Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet, Yannick Teglia
CHES3
2001 Preventing SPA/DPA in ECC Systems Using the Jacobi Form
Pierre-Yvan Liardet, Nigel P. Smart
CHES1