Abstract:
The existence of one-way function is still an open problem. 5 submits the notion of k-one-way function. In this paper we discuss the existence of k-one-way function in Boolean circuit. We obtain the following results: (1) Given k≥j>0, if there is a family of functions f
i, which is j-honest and 2k-one-way, then UPSIZE
2j-PSIZE
k-j≠φ; (2) Given k≥j>0, if UPSIZE
∩co-UPSIZE
j-PSIZE
k≠φ, then there exists a family of functions f
i such that f
i is j-honest, k-one-way and?rang (f
i)=∑
*. (3) Given j>0, there exists a family of functions f
i, which is j-honest and ω-one-way iff UPSIZE
2j-PSIZE≠φ.