| 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. 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. |
|---|---|
| Creator(s): | |
| Creation Date: | March 3, 2008 |
| Partner(s): |
UNT College of Engineering
|
| Collection(s): |
UNT Scholarly Works
|
| Usage: |
Total Uses: 25
Past 30 days: 4
Yesterday: 0
|
| Creator (Author): |
Gomathisankaran, Mahadevan
University of North Texas; Princeton University |
|
|---|---|---|
| Creator (Author): |
Tyagi, Akhilesh
Iowa State University |
|
| Publisher Info: |
Publisher Name: Institute of Electrical and Electronics Engineers (IEEE)
Place of Publication: [New Rochelle, New York]
|
|
| Original Creation Date: | March 3, 2008 | |
| 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. 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. |
|
| Degree: |
Department:
Computer Science and Engineering
|
|
| 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. |
|
| Physical Description: |
7 p. |
|
| Language(s): | ||
| Subject(s): |
|
|
| Keyword(s): | cryptography | mechanical factors | Boolean functions | cryptography | data compression | logic design | logic gates | |
| Source: | IEEE International Conference on Electro/Information Technology, 2008, Ames, Iowa, United States | |
| Contributor(s): |
|
|
| Partner: |
UNT College of Engineering
|
|
| Collection: |
UNT Scholarly Works
|
|
| Identifier: |
|
|
| Resource Type: | Paper | |
| Format: | Text | |
| Rights: |
Access:
Public
|
|
