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

Alain Aubert

dblp:02/3862 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Systems, architecture and hardware · 7Security and privacy · 1Software engineering, systems software and programming languages · 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
Cryptographic primitives and cryptanalysis · 50% Hardware security and side channels · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 50% Embedded and real-time systems · 50%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels
trusted execution environments
0.412019
The Security of ARM TrustZone in a FPGA-Based SoC · IEEE Trans. Computers 2019
Cryptographic primitives and cryptanalysis
random number generation
0.212013
A Very High Speed True Random Number Generator with Entropy Assessment · CHES 2013
Cryptographic primitives and cryptanalysis › random number generation
true random number generator
0.212013
A Very High Speed True Random Number Generator with Entropy Assessment · CHES 2013
Embedded and real-time systems
embedded system security
0.112019
The Security of ARM TrustZone in a FPGA-Based SoC · IEEE Trans. Computers 2019
Reconfigurable computing and FPGAs
FPGA SoC
0.112019
The Security of ARM TrustZone in a FPGA-Based SoC · IEEE Trans. Computers 2019
Cryptographic primitives and cryptanalysis › random number generation
entropy estimation
0.012013
A Very High Speed True Random Number Generator with Entropy Assessment · CHES 2013

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

attack analysis · 0.8
YearPublicationVenuePosition
2019 The Security of ARM TrustZone in a FPGA-Based SoC
abstract
Cybersecurity of embedded systems has become a major challenge for the development of the Internet of Things, of Cloud computing and other trendy applications without devoting a significant part of the design budget to industrial players. Technologies like TrustZone, provided by ARM, support a Trusted Execution Environment (TEE) software architecture and are inexpensive integrated solutions. While this technology allows isolation and secure execution of critical software applications (e.g., banking), recent preliminary works highlighted some security breaches or limitations when the ARM processors are embedded in a FPGA-based heterogeneous SoCs such as the Xilinx Zynq or Intel SoC FPGA devices. This paper highlights the security issue of such complex SoCs and details six efficient attacks on the ARM TrustZone extension in the SoC. A prototype system design on a Xilinx Zynq SoC is the target of the attacks presented in this paper but they could be adapted to other SoCs. This paper also includes recommendations and security solutions to design a trustworthy embedded system with a FPGA-based heterogeneous SoC.
El Mehdi Benhani, Lilian Bossuet, Alain Aubert
IEEE Trans. Computers3
2014 Electromagnetic analysis and fault injection onto secure circuits
abstract
Implementation attacks are a major threat to hardware cryptographic implementations. These attacks exploit the correlation existing between the computed data and variables such as computation time, consumed power, and electromagnetic (EM) emissions. Recently, the EM channel has been proven as an effective passive and active attack technique against secure implementations. In this paper, we resume the recent results obtained on this subject, with a particular focus on EM as a fault injection tool.
Paolo Maistri, Régis Leveugle, Lilian Bossuet, Alain Aubert, Viktor Fischer, Bruno Robisson, Nicolas Moro, Philippe Maurine, Jean-Max Dutertre, Mathieu Lisart
VLSI-SoC4
2013 A Very High Speed True Random Number Generator with Entropy Assessment
Abdelkarim Cherkaoui, Viktor Fischer, Laurent Fesquet, Alain Aubert
CHES4
2013 Electromagnetic analysis on ring oscillator-based true random number generators
abstract
Security of implementation of ciphers in hardware has already been well studied, nevertheless ciphers are not the only hardware block used for cryptography. True random number generators (TRNGs) are also significant cryptography blocks since they are used to provide secret keys, random protection masks, initial values to other security blocks such as ciphers. The security of TRNG implementations is thus of paramount importance. Recently, electromagnetic channel has been used to efficiently attack ring oscillator based TRNG by fault injection. The work presented in this paper shows that by analyzing electromagnetic emanation of the TRNG under attack in varying conditions, it is possible to obtain significant information on the TRNG such as its position and oscillator frequency, in order to improve the previously published electromagnetic attack.
Pierre Bayon, Lilian Bossuet, Alain Aubert, Viktor Fischer
ISCAS3
2012 Comparison of Self-Timed Ring and Inverter Ring Oscillators as entropy sources in FPGAs
abstract
Many True Random Numbers Generators (TRNG) use jittery clocks generated in ring oscillators as a source of entropy. This is especially the case in Field Programmable Gate Arrays (FPGA), where sources of randomness are very limited. Inverter Ring Oscillators (IRO) are relatively well characterized as entropy sources. However, it is known that they are very sensitive to working conditions. This fact makes them vulnerable to attacks. On the other hand, Self-Timed Rings (STR) are currently considered as a promising solution to generate robust clock signals. Although many studies deal with their temporal behavior and robustness in Application Specific Integrated Circuits (ASIC), equivalent study does not exist for FPGAs. Furthermore, these oscillators were not analyzed and characterized as entropy sources aimed at TRNG design. In this paper, we analyze STRs as entropy sources for TRNGs implemented in FPGAs. Next, we compare STRs and IROs when serving as sources of randomness. We show that STRs represent very interesting alternative to IROs: they are more robust to environmental fluctuations and they exhibit lower extra-device frequency variations.
Abdelkarim Cherkaoui, Viktor Fischer, Alain Aubert, Laurent Fesquet
DATE3
2010 Characterization of randomness sources in ring oscillator-based true random number generators in FPGAs
abstract
The paper deals with the characterization of sources of randomness in true random number generators aimed at cryptographic applications implemented in Field Programmable Gate Arrays (FPGA). One of the most often used source of randomness in logic devices is the timing jitter present in clock signals, generated using ring oscillators (RO). In order to estimate the entropy of the generated random bit-stream, it is necessary to characterize the employed timing jitter. Using the simulation of the clock jitter injection into the gates of RO we show that the proportion of jitter from uncorrelated and correlated noise sources on the overall period jitter depends on the number of delay elements (inverters). We also propose a new and precise method of the jitter measurement outside the device based on the use of the differential device outputs in conjunction with a differential oscilloscope probe. The measured standard deviation of the clock period is more than two times smaller than the one obtained using traditional methods. Employing the proposed measurement method we show that the jitter profile of the RO-generated clock and its sensitivity to global jitter sources (e. g. deterministic jitter) is strongly dependent on the architecture and topology of the oscillator.
Boyan Valtchanov, Viktor Fischer, Alain Aubert, Florent Bernard
DDECS3
2006 An adaptive and predictive architecture for parameterised PIV algorithms
abstract
Particle image velocimetry (PIV) algorithms aim at flow visualisation and dynamic flow measurement. All existing PIV techniques are computing intensive and are mainly used in critical conditions. For a given experimental environment, several parameters must be set so that PIV algorithm must be parameterised. A dedicated architecture is therefore unsuitable unless it is adaptive. The aim of this work is to prove that our generic and adaptive FPGA-based system for real-time PIV applications previously designed can easily be modified when some parameters vary. From a unique structure and library of resources, the designer adapts the architecture according to the parameters. Time and resource prediction models help the designer to find the most suitable structure before the implementation process and ensure only one implementation without feedback. As a result, the design flow is fast and reliable
Nathalie Bochard, Alain Aubert, Virginie Fresse
FPT2
2006 System on chip FPGA designs of a parameterized particle image velocimetry algorithm
abstract
In this paper, an efficient architecture for particle image velocimetry algorithm is proposed. The aim of this work is the design of a system of chip FPGA that can be adapted to application characteristics (size of image, pixel clock frequency...). From these specifications, the designer defines the suitable number of processing modules. Required resources and execution time can also be predicted before the implementation process that makes the design flow faster and more secure
Virginie Fresse, Nathalie Bochard, Alain Aubert
ISCAS3