Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems

Authors:
Feng Bao;Robert H. Deng;Willi Geiselmann;Claus-Peter Schnorr;Rainer Steinwandt;Hongjun Wu
Affiliations:
-;-;-;-;-;-
Venue:
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Year:
2001

Citing 5
Cited 2

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
An Identification Scheme Based on Sparse Polynomials

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
NTRU: A Ring-Based Public Key Cryptosystem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Cryptographic Applications of Sparse Polynomials over Finite Rings

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology

Attacking the Affine Parts of SFLASH

Proceedings of the 8th IMA International Conference on Cryptography and Coding
Cryptographic Applications of Sparse Polynomials over Finite Rings

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

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