News for hackers. Stuff that matters.

A comment on Why cryptography is not based on NP-complete problems. Parent comment

Re:Why cryptography is not based on NP-complete problems by Vervious on Wednesday February 12, 2025 @10:06PM (#43032243)
That's completely unrelated, the reliance there is because you want to be able to prove "any statement in NP" in zero knowledge. It then suffices to give a protocol for just 3-colorings, because "any statement in NP" can then be reduced to a 3-coloring.
[ Parent | on HN ]

There are no comments on this comment yet.