Abstract
Here we learn how certified signatures can be attached to secret messages in the context of public-key encryption. The degree of certitude (in the sense of avoiding random confusions) achievable by this method, which is based on modular arithmetic, appears to exceed by far that of notarized signatures, fingerprinting or, conceivably, even genetic analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. L. Rivest, A. Shamir, L. A. Adleman: A method for obtaining digital signatures and public key cryptosystems. Comm. ACM 21, 120–126 (1978)
A. G. Konheim: Cryptography: A Primer (Wiley, New York 1981) pp. 331–347
E. N. Gilbert, F. J. MacWilliams, N. J. A. Sloane: Codes which detect deception. Bell Syst. Tech. J. 53, 405–424 (1974)
V. Fak: Repeated use of codes which detect deception. IEEE Trans. IT 25, 233–234 (1979)
T. Beth: Sci. Am. December, 70 (1995)
I. Stewart: Sci. Am. February, 124 (1996)
A. Beutelspacher: Cryptology (The Math. Assoc, of America, Washington, DC 1994)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schroeder, M.R. (1997). Certified Signatures. In: Number Theory in Science and Communication. Springer Series in Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03430-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-03430-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62006-8
Online ISBN: 978-3-662-03430-9
eBook Packages: Springer Book Archive