Abstract
One-way functions are used in modern crypto-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 one-way in terms of the growth rate of the total number of possible garbage bit configurations with the input size.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
