Abstract
AbstractTo design a reliable system, it is very important to protect data stored or transmitted from intentional forgery in communications network. As a practical means of protecting data or software, it is pointed out by Naor and Yung that a family of one‐way hash functions is useful and can be classified into a universal one‐way hash function family (UOHF) and a collision intractable one‐way hash function family (CIHF). The construction for a UOHF is possible under a weak assumption, i.e., one‐way functions exist. However, the construction for a CIHF is not known to be possible under such a weak assumption.This paper presents a simple construction for a CIHF that is based on the hardness of factoring large composite numbers. The idea on the construction here is completely different from those reported so far and can be expected to provide a theoretical breakthrough to the construction for a CIHF under a general assumption.
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 callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: 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.
