scientific article; zbMATH DE number 2009958

zbMath1038.94519MaRDI QIDQ4434878

Matthieu Finiasz, Daniel Augot

Publication date: 26 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560229.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Reed-Solomon codespublic key encryptiondecoding schemespolynomial reconstruction problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Decoding (94B35)

Related Items (6)

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Rank-Metric Codes and Their Applications ⋮ Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This page was built for publication: