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

Denis Réal

dblp:72/3774 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Security and privacy · 5 · 1 first-authorSystems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 3 · 2 first-author

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 · 70% Cryptographic primitives and cryptanalysis · 30%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels
side-channel attack
0.222009
Practical Electromagnetic Template Attack on HMAC · CHES 2009
The Carry Leakage on the Randomized Exponent Countermeasure · CHES 2008
Hardware security and side channels › side-channel attack
electromagnetic side channel
0.112009
Practical Electromagnetic Template Attack on HMAC · CHES 2009
Cryptographic primitives and cryptanalysis › message authentication codes
HMAC
0.112009
Practical Electromagnetic Template Attack on HMAC · CHES 2009
Cryptographic primitives and cryptanalysis
message authentication codes
0.112009
Practical Electromagnetic Template Attack on HMAC · CHES 2009
Hardware security and side channels › side-channel attack
power analysis
0.112008
The Carry Leakage on the Randomized Exponent Countermeasure · CHES 2008
Hardware security and side channels
side-channel countermeasures
0.112008
The Carry Leakage on the Randomized Exponent Countermeasure · CHES 2008

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

template attack · 0.1electromagnetic analysis · 0.1power analysis · 0.1
YearPublicationVenuePosition
2011 Enhancement of simple electro-magnetic attacks by pre-characterization in frequency domain and demodulation techniques
Olivier Meynard, Denis Réal, Florent Flament, Sylvain Guilley, Naofumi Homma, Jean-Luc Danger
DATE2
2011 Power consumption traces realignment to improve differential power analysis
abstract
Cryptographic devices can be subject to side-channel attacks. Among those attacks, Differential Power Analysis (DPA) has proven to be very effective and easy to perform. Several countermeasures have been proposed in the literature. However, the effectiveness of these counter measures is still evaluated by resort-ing to intensive DPA simulations and constitutes a very time-consuming design task. In this paper we show that the knowledge of the structure of the circuit can be exploited to improve performances of the DPA. We propose to realign power consumption traces according timing information (i.e., path delays). We show the usefulness of the proposed method by comparing the efficiency of classic DPA w.r.t. timing aware DPA.
Giorgio Di Natale, Marie-Lise Flottes, Bruno Rouzeyre, Miroslav Valka, Denis Réal
DDECS5
2010 Characterization of the Electromagnetic Side Channel in Frequency Domain
Olivier Meynard, Denis Réal, Sylvain Guilley, Florent Flament, Jean-Luc Danger, Frédéric Valette
Inscrypt2
2009 Practical Electromagnetic Template Attack on HMAC
Pierre-Alain Fouque, Gaëtan Leurent, Denis Réal, Frédéric Valette
CHES3
2009 Enhancing correlation electromagnetic attack using planar near-field cartography
abstract
In the field of the Side Channel Analysis (SCA), the electromagnetic radiation of a cryptographic device is the richest source of information. Indeed, it permits to be more accurate by positioning smartly the EM probe near a given logic, filtering the signal that is not useful regarding a given attack. But this advantage can become easily a drawback if the attacker is unable to position her probe onto the device. Our contribution consists in giving an accurate method detecting an hot spot onto the device, i.e. the position where a correlation electromagnetic attack (CEMA) should be the most successful. This strategy is based on an indicator evaluated during a cartography. Its performance has been tested on an hardware AES implemented on an Altera Stratix II.
Denis Réal, Frédéric Valette, M'hamed Drissi
DATE1
2008 SCARE of an Unknown Hardware Feistel Implementation
Denis Réal, Vivien Dubois, Anne-Marie Guilloux, Frédéric Valette, M'hamed Drissi
CARDIS1
2008 The Carry Leakage on the Randomized Exponent Countermeasure
Pierre-Alain Fouque, Denis Réal, Frédéric Valette, M'hamed Drissi
CHES2
2008 Defeating classical Hardware Countermeasures: a new processing for Side Channel Analysis
abstract
In the field of the side channel analysis, hardware distortions such as glitches and random frequency are classical countermeasures. A glitch influences the side channel amplitude while a random frequency damages the signal both in time and in amplitude. For minimizing these countermeasures effects, some trace treatments based on peak extraction or auto-correlation methods exist. However, none of them takes into account the amplitude mistake. In this paper, we show that this amplitude mistake is created by glitches but also by a random frequency. We propose then a reshaping processing that erases these effects on side channel traces both on the time and amplitude axis. The solution reconstructed a side channel signal, avoiding the hardware countermeasures and the clock relativity consequences which can be meaningful for Side Channel Attacks. Its efficiency is demonstrated on a Differential Power Attack performed on a DES implementation and on a Template Attack performed on a RSA implementation.
Denis Réal, Cécile Canovas, Jessy Clédière, M'hamed Drissi, Frédéric Valette
DATE1
2008 Fault Attack onElliptic Curve Montgomery Ladder Implementation
abstract
In this paper, we present a new fault attack on elliptic curve scalar product algorithms. This attack is tailored to work on the classical Montgomery ladder method when the $y$-coordinate is not used. No weakness has been reported so far on such implementations, which are very efficient and were promoted by several authors. But taking into account the twist of the elliptic curves, we show how, with few faults (around one or two faults), we can retrieve the full secret exponent even if classical countermeasures are employed to prevent fault attacks. It turns out that this attack has not been anticipated as the security of the elliptic curve parameters in most standards can be strongly reduced. Especially, the attack is meaningful on some NIST or SECG parameters.
Pierre-Alain Fouque, Reynald Lercier, Denis Réal, Frédéric Valette
FDTC3