Polynomial Reconstruction Based Cryptography (A Short Survey)

Aggelos Kiayias, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Cryptography and Coding Theory are closely knitted in many respects. Recently, the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) was suggested as an intractability assumption upon which the security of cryptographic protocols can be based. This has initiated a line of research that exploited the rich algebraic structure of the problem and related subproblems of which in the cryptographic setting. Here we give a short overview of recent works on the subject and the novel applications that were enabled due to this development.
Original languageEnglish
Title of host publicationSelected Areas in Cryptography
Subtitle of host publication8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16--17, 2001 Revised Papers
EditorsSerge Vaudenay, Amr M. Youssef
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages129-133
Number of pages5
ISBN (Electronic)978-3-540-45537-0
ISBN (Print)978-3-540-43066-7
DOIs
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume2259
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Polynomial Reconstruction Based Cryptography (A Short Survey)'. Together they form a unique fingerprint.

Cite this