A public key encryption scheme based on the polynomial reconstruction problem

DOI10.1007/3-540-39200-9_14MaRDI QIDQ4434878zbMATH OpenFDO

Authors Daniel Augot, Matthieu Finiasz

Publication date 26 November 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

decoding schemespolynomial reconstruction problempublic key encryptionReed-Solomon codes

Mathematics Subject Classification ID

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

Recommendations

• Public Key Cryptography – PKC 2004
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• Coding and Cryptography
• A lattice based public key cryptosystem using polynomial representations
• Polynomial reconstruction based cryptography (a short survey)

Cited in

(23)

• 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
• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
• Decoding supercodes of Gabidulin codes and applications to cryptanalysis
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• Polly Two: a new algebraic polynomial-based public-key scheme
• scientific article; zbMATH DE number 5846263 (Why is no real title available?)
• Integer Reconstruction Public-Key Encryption
• A public key cryptosystem based on sparse polynomials
• Polynomial reconstruction based cryptography (a short survey)
• Cryptographic hardness based on the decoding of Reed-Solomon codes
• Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem
• Randomized decoding of Gabidulin codes beyond the unique decoding radius
• A type of public cryptosystem using polynomials and pell sequences
• Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice
• Rank-metric codes and their applications
• Coding and Cryptography
• Public Key Cryptography – PKC 2004
• A bivariate polynomial-based cryptographic hard problem and its applications
• Two modifications for Loidreau's code-based cryptosystem
• Generalizing the Augot-Finiasz PKE to other code classes
• PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials

This page was built for publication: A public key encryption scheme based on the polynomial reconstruction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434878)