Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice

DOI10.1007/s10623-007-9055-8zbMath1132.94005OpenAlexW2007885832MaRDI QIDQ2384012

Aggelos Kiayias, Mordechai M. Yung

Publication date: 20 September 2007

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9055-8

zbMATH Keywords

probabilistic analysisReed-Solomon codeslist decodingcoding-theoretic cryptography

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• The tail of the hypergeometric distribution
• Decoding of Reed Solomon codes beyond the error-correction bound
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice
• Public Key Cryptography – PKC 2004