Relating Boolean Gate Truth Tables to One-Way Functions

PDF Version Also Available for Download.

Description

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.

Physical Description

7 p.

Creation Information

Gomathisankaran, Mahadevan & Tyagi, Akhilesh March 3, 2008.

Context

This paper is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 180 times . More information about this paper can be viewed below.

Who

People and organizations associated with either the creation of this paper or its content.

Authors

Publisher

Provided By

UNT College of Engineering

The UNT College of Engineering promotes intellectual and scholarly pursuits in the areas of computer science and engineering, preparing innovative leaders in a variety of disciplines. The UNT College of Engineering encourages faculty and students to pursue interdisciplinary research among numerous subjects of study including databases, numerical analysis, game programming, and computer systems architecture.

Contact Us

What

Descriptive information to help identify this paper. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

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.

Physical Description

7 p.

Notes

© 2008 IEEE. Reprinted, with permission, from Mahadevan Gomathisankaran and Akhilesh Tyagi, Relating Boolean Gate Truth Tables to One-Way Functions, May 2008.

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.

Source

  • IEEE International Conference on Electro/Information Technology, 2008, Ames, Iowa, United States

Language

Item Type

Collections

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.

What responsibilities do I have when using this paper?

When

Dates and time periods associated with this paper.

Creation Date

  • March 3, 2008

Added to The UNT Digital Library

  • Jan. 16, 2013, 12:47 p.m.

Description Last Updated

  • April 28, 2014, 2:11 p.m.

Usage Statistics

When was this paper last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 180

Interact With This Paper

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Gomathisankaran, Mahadevan & Tyagi, Akhilesh. Relating Boolean Gate Truth Tables to One-Way Functions, paper, March 3, 2008; [New Rochelle, New York]. (digital.library.unt.edu/ark:/67531/metadc132996/: accessed June 27, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.