Abstract
The problem of computing roots of a polynomial over the ring ℤn is equivalent to factoring n. Starting from this intractable pro- blem we construct a public key encryption scheme where the message blocks are encrypted as roots of a polynomial over ℤn 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 sche- mes 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 func- tion, 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.
Chapter PDF
References
M. Ben-Or, Probabilistic Algorithms in Finite Fields. Proc. IEEE FOCS 1981, pp. 394–398.
A. Fiat and M. Naor, Broadcast Encryption. Pre-Proceedings of CRYPTO’ 93, 39.1–39.10.
S. Goldwasser, S. Micali and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. Vol. 17 No. 2 (1988), pp. 281–308.
M. O. Rabin, Digital Signatures and Public-Key Functions as Intractable as Factorization. MIT/LCS/TR-212, Jan 1979. Cited after B. Schneier.
M. O. Rabin, Probabilistic Algorithms in Finite Fields. SIAM J. Comput. 9(1980), pp. 273–280.
A. Shamir, On the Generation of Multivariate Polynomials which are Hard to Factor. Preprint.
B. Schneier, Applied Cryptography. Wiley 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwenk, J., Eisfeld, J. (1996). Public Key Encryption and Signature Schemes Based on Polynomials over ℤn . In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive