Candidate One-Way Functions Based on Expander Graphs

• Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation pp. 76 - 87
• Main Author: Goldreich, Oded
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2011
• Series: Lecture Notes in Computer Science
• Subjects: Expander Graphs; One-Way Functions
• ISBN: 3642226698; 9783642226694
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-22670-0_10

We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets of input bits, to which a hard-wired random predicate is applied. Thus, the function is extremely easy to evaluate: All that is needed is to take multiple projections of the input bits, and to use these as entries to a look-up table. It is feasible for the adversary to scan the look-up table, but we believe it would be infeasible to find an input that fits a given sequence of values obtained for these overlapping projections. The conjectured difficulty of inverting the suggested function does not seem to follow from any well-known assumption. Instead, we propose the study of the complexity of inverting this function as an interesting open problem, with the hope that further research will provide evidence to our belief that the inversion task is intractable.