Revision as of 05:56, 30 October 2006 edit 24.149.47.116 (talk) No edit summary ← Previous edit		Revision as of 06:40, 11 February 2007 edit undo 69.228.105.107 (talk) No edit summary Next edit →
Line 156: : Don't have that book, but if your book says "P<math>\neq</math>NP implies one way functions", then it's certainly talking about complexity (worst-case) one way functions, not cryptographic (average-case) one-way functions. It can get confusing, but no one really does anything with worst-case OWFs these days. [[User:Blokhead\|Blokhead]] 03:09, 30 October 2006 (UTC) 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

Talk:One-way function: Difference between revisions