Evaluation of Polynomial Reconstruction Problem using Lagrange Interpolation Method

Author

Sadkhan, Sattar B. ; Ruma, K.H.

Author_Institution

Dept. of Comput. Sci., AL-Nahrain Univ.

Volume

1

fYear

0

fDate

0-0 0

Firstpage

1399

Lastpage

1403

Abstract

The polynomial reconstruction problem (PRP) has been introduced in 1999 as a new hard problem. Several cryptographic primitives established on this problem have been constructed. Then it has been studied from the point of view of robustness, and several important properties have been discovered and proved. Furthermore many asymmetric cipher based on the PRP has been constructed. This paper provides an evaluation analysis of the application of Lagrange interpolation method in Augot´s cryptosystem that is based on the polynomial reconstruction problem. It was clear that the Lagrange interpolation can be considered as a suitable method for PRP in comparison with Berelkamp-Welsh algorithm or with the direct method

Keywords

cryptography; interpolation; polynomials; Berelkamp-Welsh algorithm; Lagrange interpolation; asymmetric cipher; cryptography; cryptosystem; polynomial reconstruction problem; Computer science; Galois fields; Interpolation; Lagrangian functions; Polynomials; Protocols; Public key; Public key cryptography; Robustness; Security;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Communication Technologies, 2006. ICTTA '06. 2nd

Conference_Location

Damascus

Print_ISBN

0-7803-9521-2

Type

conf

DOI

10.1109/ICTTA.2006.1684586

Filename

1684586