In this paper, the authors present a schema to build one way functions from a family of Boolean gates. Moreover, the authors relate characteristics of these Boolean gate truth tables to properties of the derived one-way functions.
The UNT College of Engineering strives to educate and train engineers and technologists who have the vision to recognize and solve the problems of society. The college comprises six degree-granting departments of instruction and research.
In this paper, the authors present a schema to build one way functions from a family of Boolean gates. Moreover, the authors relate characteristics of these Boolean gate truth tables to properties of the derived one-way functions.
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of North Texas' products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Abstract: In this paper, the authors present a schema to build one way functions from a family of Boolean gates. Moreover, the authors relate characteristics of these Boolean gate truth tables to properties of the derived one-way functions. The authors believe this to be the first attempt at establishing cryptographic properties from the Boolean cube spaces of the component gates. This schema is then used to build a family of compression functions, which in turn can be used to get block encryption and hash functions. These functions are based on reconfigurable gates. The authors prove cryptographically relevant properties for these function implementations. Various applications incorporating these one-way functions, specifically memory integrity in processor architecture, are presented.
This paper is part of the following collection of related materials.
UNT Scholarly Works
Materials from the UNT community's research, creative, and scholarly activities and UNT's Open Access Repository. Access to some items in this collection may be restricted.
Gomathisankaran, Mahadevan & Tyagi, Akhilesh.Relating Boolean Gate Truth Tables to One-Way Functions,
paper,
March 3, 2008;
[New Rochelle, New York].
(https://digital.library.unt.edu/ark:/67531/metadc132996/:
accessed September 12, 2024),
University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu;
crediting UNT College of Engineering.
