Abstract
The authors present one-way functions, which play an important role in cryptography. A one-way function can be computed efficiently, but its inverse is very difficult to compute. Like most cryptographic algorithms these functions rely on findings from number theory. For example, two prime numbers of several hundred digits can be multiplied very quickly by a computer, however, given only the product of these numbers, it is extremely difficult to factorize the product into the two prime factors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Reischuk, R., Hinkelmann, M. (2011). One-Way Functions - Mind the Trap - Escape Only for the Initiated. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)