Cryptographic hardness based on the decoding of Reed-Solomon codes

DOI10.1007/3-540-45465-9_21MaRDI QIDQ4737160zbMATH OpenFDO

Authors Aggelos Kiayias, Moti Yung

Publication date 11 August 2004

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/2380/23800232.htm

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• Polynomial reconstruction based cryptography (a short survey)
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• Secure and practical randomized stream ciphers based on Reed-Solomon codes
• A public key encryption scheme based on the polynomial reconstruction problem
• On the edge-independence number and edge-covering number for regular graphs

Cited in

(6)

• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• On constructing homomorphic encryption schemes from coding theory
• Polynomial reconstruction based cryptography (a short survey)
• Theory of Cryptography
• On the computational hardness of the code equivalence problem in cryptography
• Secure and practical randomized stream ciphers based on Reed-Solomon codes

This page was built for publication: Cryptographic hardness based on the decoding of Reed-Solomon codes

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