Relating Boolean Gate Truth Tables to One-Way Functions Metadata

Metadata describes a digital item, providing (if known) such information as creator, publisher, contents, size, relationship to other resources, and more. Metadata may also contain "preservation" components that help us to maintain the integrity of digital files over time.

Title

  • Main Title Relating Boolean Gate Truth Tables to One-Way Functions

Creator

  • Author: Gomathisankaran, Mahadevan
    Creator Type: Personal
    Creator Info: University of North Texas; Princeton University
  • Author: Tyagi, Akhilesh
    Creator Type: Personal
    Creator Info: Iowa State University

Contributor

  • Organizer of meeting: Institute of Electrical and Electronics Engineers
    Contributor Type: Organization

Publisher

  • Name: Institute of Electrical and Electronics Engineers (IEEE)
    Place of Publication: [New Rochelle, New York]

Date

  • Creation: 2008-03-03

Language

  • English

Description

  • Content 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.

Subject

  • Keyword: cryptography
  • Keyword: mechanical factors
  • Keyword: Boolean functions
  • Keyword: cryptography
  • Keyword: data compression
  • Keyword: logic design
  • Keyword: logic gates

Source

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

Collection

  • Name: UNT Scholarly Works
    Code: UNTSW

Institution

  • Name: UNT College of Engineering
    Code: UNTCOE

Rights

  • Rights Access: public

Resource Type

  • Paper

Format

  • Text

Identifier

  • Archival Resource Key: ark:/67531/metadc132996

Degree

  • Academic Department: Computer Science and Engineering

Note

  • Display Note: © 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.
  • Display Note: 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.