One-way Functions In Reversible Computations
| dc.creator | Chau, H. F. | |
| dc.creator | Lo, H. -K. | |
| dc.date | 1995-06-09 | |
| dc.date | 1996-12-01 | |
| dc.date.accessioned | 2026-07-07T09:05:04Z | |
| dc.date.available | 2026-07-07T09:05:04Z | |
| dc.description | One-way functions are used in modern cryto-systems as doortraps because their inverse functions are supposed to be difficult to compute. Nonetheless with the discovery of reversible computation, it seems that one may break a one-way function by running a reversible computer backward. Here, we argue that reversible computation alone poses no threat to the existence of one-way functions because of the generation of ``garbage bits'' during computations. Consequently, we prove a necessary and sufficient condition for a one-to-one function to be a one-way in terms of the growth rate of the total number of possible garbage bit configurations with the input size. | |
| dc.description | In REVTEX 3.0, with one figure. Minor changes. To appear in Cryptologia | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9506012 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9506012 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/149603 | |
| dc.subject | Quantum Physics | |
| dc.title | One-way Functions In Reversible Computations | |
| dc.type | text |