Publication Type
Conference Proceeding Article
Version
publishedVersion
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
City or Country
Berlin
Citation
BAO, Feng; DENG, Robert H.; Geiselmann, Willi; Schnorr, Claus; Steinwandt, Rainer; and WU, Hongjun.
Cryptanalysis of two sparse polynomial based public key cryptosystems. (2001). Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13–15: Proceedings. 1992, 153-164.
Available at: https://ink.library.smu.edu.sg/sis_research/1108
Copyright Owner and License
Publisher
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/3-540-44586-2_11