Revision as of 06:40, 11 February 2007 edit 69.228.105.107 (talk) No edit summary ← Previous edit		Revision as of 13:50, 24 July 2007 edit undo 71.194.163.223 (talk) No edit summary Next edit →
Line 158: I am quite certain that having a constructive proof of P=NP would bring you no closer to reversing SHA-1 or SHA-256. --- Joshua == One-Time Pad? == This article says that the existence of a one-way function implies the existence of a private-key encryption scheme. Isn't this trivially true, due to the existence of the one-time pad? [[User:71.194.163.223\|71.194.163.223]] 13:50, 24 July 2007 (UTC)

Talk:One-way function: Difference between revisions