Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems

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].

DOI: 10.1007/3-540-44586-2_11

Extracted Key Phrases

Cite this paper

@inproceedings{Bao2001CryptanalysisOT, title={Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems}, author={Feng Bao and Robert H. Deng and Willi Geiselmann and Claus-Peter Schnorr and Rainer Steinwandt and Hongjun Wu}, booktitle={Public Key Cryptography}, year={2001} }