Relating Boolean gate truth tables to one-way functions

被引：4

作者：

Gomathisankaran, Mahadevan ^{[1
]}

Tyagi, Akhilesh ^{[2
]}

机构：

[1] Princeton Univ, Princeton, NJ 08544 USA

[2] Iowa State Univ, Ames, IA USA

来源：

2008 IEEE INTERNATIONAL CONFERENCE ON ELECTRO/INFORMATION TECHNOLOGY | 2008年

关键词：

D O I：

10.1109/EIT.2008.4554258

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1 / +

页数：2

共 8 条

[1]

[Anonymous], 1994, Int, V4, P368, DOI 10.1007/bf01622200

[2]

BLACK J, 2002, CRYPTO 02, P320

[3] CRYPTOGRAPHY AND COMPUTER PRIVACY [J].

FEISTEL, H .

SCIENTIFIC AMERICAN, 1973, 228 (05) :15-23

[4]

GASSEND B., 2003, P 9 INT S HIGH PERF

[5]

Lie D, 2000, ACM SIGPLAN NOTICES, V35, P168, DOI 10.1145/384264.379237

[6]

Merkle R. C., 1980, P IEEE S SEC PRIV

[7]

Rogaway P, 2004, LECT NOTES COMPUT SC, V3017, P371

[8]

Suh G Edward, 2003, Proceedings of the 17th annual international conference on Supercomputing, P357

← 1 →