Cedric Tavernier - Academia.edu (original) (raw)

Uploads

Papers by Cedric Tavernier

Journal of Cryptographic Engineering, Aug 31, 2018

Side Channel Attacks (SCA) and Fault Injection Attacks (FIA) allow an opponent to have partial ac... more Side Channel Attacks (SCA) and Fault Injection Attacks (FIA) allow an opponent to have partial access to the internal behavior of the hardware. Since the end of the nineties, many works have shown that this type of attacks constitute a serious threat to cryptosystems implemented in embedded devices. In the state of the art, there exist several countermeasures to protect symmetric encryption (especially AES-128). Most of them protect only against one of these two attacks (SCA or FIA). A method called ODSM has been proposed to withstand SCA and FIA , but its implementation in the whole algorithm is a big open problem when no particular hardware protection is possible. In the present paper, we propose a practical masking scheme specifying ODSM which makes it possible to protect the symmetric encryption against these two attacks.

Journal of physics, Feb 1, 2019

We propose a new type of public-key cryptosystems (PKC) which is based on repetition of different... more We propose a new type of public-key cryptosystems (PKC) which is based on repetition of different error-correcting codes. We give a brief analysis of some well known attacks on code-based PKC, including structural ones and show that the scheme could be used as a perspective post-quantum PKC.

2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)

Journal of Physics: Conference Series, 2019

Among the key management infrastructures, we distinguish certificate based infrastructure (public... more Among the key management infrastructures, we distinguish certificate based infrastructure (public key infrastructure (PKI), SPKI, PGP...) and IBE (Identity Based Encryption). Each one has its own advantages and disadvantages. For PKI, huge drawbacks come from the management of certificates, revocation, confidence...[8, 7]. Regarding the Boneh and Franklin’s IBE [6] two main drawbacks were: the key escrow problem and the fact that all the authority is attributed to a single entity which is the PKG (Private Key Generator) that could usurp the identity of each user. In this article we present a new key management architecture which combines the advantages of a PKI and Boneh and Franklin IBE scheme. This architecture is based on known mathematical operations on elliptic curves pairing (Optimal-Ate pairing [9] on the Barreto Naehrig curve [3]), and basic operations in finite fields.

Procede de codage d'une information circulant dans un reseau comprenant au moins un nœud emet... more Procede de codage d'une information circulant dans un reseau comprenant au moins un nœud emetteur de l'information, un nœud destinataire, utilisant un systeme de chiffrement a cle publique, caracterise en ce qu'il comporte au moins les etapes suivantes : generer une cle publique en utilisant une matrice de generation de cle publique NG constituee de u colonnes et u lignes, un element d'une colonne ou d'une ligne etant un bloc forme par la matrice G de generation de code, et en executant l'operation suivante : soit Rl une matrice inversible aleatoire constituant une cle privee et RP une matrice obtenue par permutation aleatoire constituant une cle privee NG, la matrice la cle publique est donnee par la matrice PUK = Rl(multiplication matricielle par bloc) NG(multiplication matricielle)RP utiliser la cle privee et la cle publique obtenue pour coder et decoder les informations transmises dans le reseau.

2008 3rd International Symposium on Wireless Pervasive Computing, 2008

This paper presents a privacy protection scheme, suitable for devices limited in CPU and/or in me... more This paper presents a privacy protection scheme, suitable for devices limited in CPU and/or in memory capabilities, which not only ensures anonymity and confidentiality but has also a limited impact on end-to-end network performance. Such an approach for anonymous communications, inspired by network coding techniques, benefits from recent improvements in list decoding algorithms for Reed-Solomon codes, and takes advantage of multi-path routing capabilities. The combination of these techniques is adapted for constrained and pervasive environments, such as wireless ad hoc networks, as it decreases the processing complexity of the cryptographic/decoding operations and as it ensures better tolerance to packet losses (due to mobility or to bad quality of the radio channel).

Http Www Theses Fr, 2004

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

IEEE Transactions on Information Theory, 2005

2006 IEEE International Symposium on Information Theory, 2006

A new deterministic list decoding algorithm is proposed for general Reed-Muller codes RM (s, m) o... more A new deterministic list decoding algorithm is proposed for general Reed-Muller codes RM (s, m) of length n = 2 m and distance d = 2 m−s. Given n and d, the algorithm performs beyond the bounded distance threshold of d/2 and has a low complexity order of nm s−1 for any decoding radius T that is less than the Johnson bound.