Abstract
An identity-based non-interactive public key distribution system was presented by these authors at Eurocrypt’ 91 [2]. It is based on the observation that for an appropriate choice of m, computing discrete logarithms in Z m* is feasible if and only if the factorization of m is known. This observation allows one to set up an exponential key distribution system in which a user’s (say Alice’s) public key is equal to her identity I A. A trusted authority who knows the factorization of m is required for computing (during registration) Alice’s secret key S A as the discrete logarithm of I A to some base g, where g is an element of Z m* with maximal order.
Chapter PDF
Similar content being viewed by others
References
A.J. Lenstra, private communication with Y. Yacobi.
U.M. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology — EUROCRYPT’ 91, D. Davies, Ed., Lecture Notes in Computer Science, vol. 547, pp. 498–507, Springer-Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurer, U.M., Yacobi, Y. (1993). A Remark on a Non-interactive Public-Key Distribution System. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_39
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive