Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes

DOI10.1109/TIT.2008.921876zbMath1328.94070MaRDI QIDQ3604595

Aggelos Kiayias, Mordechai M. Yung

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (4)

Highly efficient OT-based multiplication protocols ⋮ E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ A Highly Scalable RFID Authentication Protocol

This page was built for publication: Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes