One-Way Permutations in NC0

We prove that there is a family of permutations which are computable by a family of NC0 circuits while their inverses are P-hard to compute. Thus, these permutations are one-way from the point of view of parallel computation.

[1]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[2]  J. Doug Tygar,et al.  Efficient Parallel Pseudo-Random Number Generation , 1985, CRYPTO.

[3]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[5]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7]  Jeffrey C. Lagarias,et al.  One-Way Functions and Circuit Complexity , 1986, Inf. Comput..