Title

Cryptanalysis of two sparse polynomial based public key cryptosystems

Publication Type

Conference Proceeding Article

Publication Date

2-2001

Abstract

The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modified SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13–15: Proceedings

Volume

1992

First Page

153

Last Page

164

ISBN

9783540445869

Identifier

10.1007/3-540-44586-2_11

Publisher

Springer Verlag

City or Country

Berlin

Additional URL

http://dx.doi.org/10.1007/3-540-44586-2_11