• Aucun résultat trouvé

Code-based cryptography: A way to secure communications

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Code-based cryptography: A way to secure communications"

Copied!
2
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

HAL Id: hal-02018870

https://hal.inria.fr/hal-02018870

Submitted on 14 Feb 2019

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished 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.

Code-based cryptography: A way to secure

communications

Tania Richmond, Pierre-Louis Cayrel, Viktor Fischer

To cite this version:

(2)

Context:

Make secure communications.

Objectives:

Find an alternative to currently used methods in cryptography

in order to avoid side-channel attacks.

Publications:

M. Petrvalsky, T. Richmond, M. Drutarovsky, P.-L. Cayrel and V. Fischer. Countermeasure against the SPA

Attack on an Embedded McEliece Cryptosystem. Accepted in MAREW 2015.

V. Dragoi, P.-L. Cayrel, B. Colombier and T. Richmond. Polynomial structures in code-based cryptography. In Progress in Cryptology - INDOCRYPT 2013, pp. 286-296, Springer International Publishing.

How?

Implementing existing protocols and testing side-channel attacks.

Then find mathematical methods to make them more secure.

Experiments:

Conclusion:

We improved security of cryptographic protocols making

them more resilient against side-channel attacks.

Perspectives:

Provide a complete and secure implementation.

Références

Télécharger maintenant ( PDF - 2 Page - 644.95 KB )

Documents relatifs

Polynomial structures in code-based cryptography

Polynomial structures in code-based cryptography Vlad Dragoi, Pierre-Louis Cayrel, Brice Colombier, Tania Richmond.. To cite

Side-Channel Attacks meet Secure Network Protocols

rounds to attack, the algorithm for symbolic processing of an initial state gives the number of possible master keys to be recovered by an attacker.. Though, the attacker does not

Provably Secure Countermeasures against Side-channel Attacks

It is shown that a second-order masking scheme secure in the Hamming weight model can be broken with a first-order attack on a device leaking in the Hamming distance model.. This

Études romanesques, "Dialogue franco-ukrainien sur le roman", n° 6, 2000

De la stylistique traditionnelle et du structuralisme à l'analyse de la littérature comme discours, ce qui change, c'est la nature profonde du recours à la linguistique qui

A fully Bayesian approach to the parcel-based detection-estimation of brain activity in fMRI.

Bayesian model comparison allows us to emphasize on artificial datasets first that inhomogeneous gamma-Gaussian mixture models outperform Gaussian mixtures in terms

Error-correcting pairs: a new approach to code-based cryptography

The known efficient bounded distance decoding algorithms of the families of codes proposed for code-based cryptography, like Reed- Solomon codes, Goppa codes, alternant codes

Correlation dimension of self-similar surfaces and application to Kirchhoff integrals

[7] Franceschetti G, Iodice A, Migliaccio M and Riccio D 1999 Scattering from natural rough surfaces modeled by fractional Brownian motion IEEE Trans.