Directions in Polynomial Reconstruction Based Cryptography(<Special Section>Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Cryptography and Coding Theory are closely related in many respects. Recently, the problem of "decoding Reed Solomon codes" (also known as "polynomial reconstruction") was suggested as an intractability assumption to base the security of protocols on. This has initiated a line of cryptographic research exploiting the rich algebraic structure of the problem and its variants. In this paper we give a short overview of the recent works in this area as well as list directions and open problems in Polynomial Reconstruction Based Cryptography.

• 社団法人電子情報通信学会の論文
• 2004-05-01

著者

• Yung Moti

  Department Of Computer Science Columbia University

• KIAYIAS Aggelos

  Department of Computer Science & Engineering, University of Connecticut

• Kiayias Aggelos

  Department Of Computer Science & Engineering University Of Connecticut

関連論文

• 侵入攻撃に強い公開鍵暗号
• 侵入攻撃に強い公開鍵暗号
• 侵入攻撃に強い公開鍵暗号
• Directions in Polynomial Reconstruction Based Cryptography(Discrete Mathematics and Its Applications)

スポンサーリンク