Drop Down MenusCSS Drop Down MenuPure CSS Dropdown Menu

vendredi 30 janvier 2015

[hal-01088433] Error-correcting pairs: a new approach to code-based cryptography

McEliece proposed the first public-key cryptosystem based on linear error-correcting codes. A code with an efficient bounded distance decoding algorithm is chosen as secret key. It is assumed that the chosen code looks like a random code. 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 or algebraic geometry codes, can be described in terms of error-correcting pairs (ECP). That means that, the McEliece cryptosystem is not only based on the intractability of bounded distance decoding but also on the problem of retrieving an error-correcting pair from the public code. In this article we propose the class of codes with a t-ECP whose error-correcting pair that is not easily reconstructed from of a given generator matrix.



from HAL : Dernières publications http://ift.tt/1FznlfC

Ditulis Oleh : Unknown // 03:34
Kategori:

0 commentaires:

Enregistrer un commentaire

 

Blogger news

Blogroll

Fourni par Blogger.