Constructions of Freebly-One-Way Families of Permutations
暂无分享,去创建一个
[1] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[2] Leonid A. Levin,et al. One way functions and pseudorandom generators , 1987, Comb..
[3] Jeffrey C. Lagarias,et al. One-Way Functions and Circuit Complexity , 1987, Inf. Comput..
[4] John E. Savage,et al. The Complexity of Computing , 1976 .
[5] Stephen Wayne Boyack. The robustness of combinatorial measures of Boolean matrix complexity , 1985 .
[6] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[7] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[8] Gilles Brassard,et al. Relativized cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).