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.
Original language | English |
---|---|
Title of host publication | Algorithms Unplugged |
Editors | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner |
Number of pages | 9 |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer Berlin Heidelberg |
Publication date | 12.2011 |
Pages | 131-139 |
ISBN (Print) | 978-3-642-15327-3 |
ISBN (Electronic) | 978-3-642-15328-0 |
DOIs | |
Publication status | Published - 12.2011 |