Public key encryption and signature schemes based on polynomials over Zn

Authors:
Jörg Schwenk;Jörg Eisfeld
Affiliations:
Deutsche Telekom AG, Forschungszentrum, Darmstadt, Germany;Justus-Liebig-Universität Gießen, Mathematisches Institut, Gießen, Germany
Venue:
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Year:
1996

Citing 4
Cited 0

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Probabilistic algorithms in finite fields

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of computing roots of a polynomial over the ring Zn, is equivalent to factoring n. Starting from this intractable problem we construct a public key encryption scheme where the message blocks are encrypted as roots of a polynomial over Zn and a signature scheme where the signature belonging to a message is a (set of) root(s) of a polynomial having the message blocks as coefficients. These schemes can be considered as extensions of Rabin's encryption and signature scheme. However, our signature scheme has some new properties: a short signature can be generated for a long message without using a hash function, and the security features of the scheme can be chosen either to be similar to those of the RSA scheme or to be equivalent to those of Rabin's scheme.