By Topic

Relating Boolean gate truth tables to one-way functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mahadevan Gomathisankaran ; Princeton University, USA ; Akhilesh Tyagi

We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived one-way functions. We 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. We prove cryptographically relevant properties for these function implementations. Various applications incorporating these one-way functions, specifically memory integrity in processor architecture, are presented.

Published in:

2008 IEEE International Conference on Electro/Information Technology

Date of Conference:

18-20 May 2008