Why cryptography is not based on NP-complete problems (blintzbase.com) | HN Screenshots

YHacker Newsscreenshots

Screenshot of blintzbase.com: Why cryptography is not based on NP-complete problems

First screen, captured 1 year ago.

Looks similar

Screenshot of gruhn.me: NP-overrated

NP-overrated (gruhn.me)

226 points by theanonymousone 2 months ago | 159 comments

Screenshot of buttondown.com: The Halting Problem is a terrible example of NP-Harder

The Halting Problem is a terrible example of NP-Harder (buttondown.com)

87 points by BerislavLopac 1 year ago | 92 comments

Screenshot of buttondown.email: Problems harder than NP-Complete

Problems harder than NP-Complete (buttondown.email)

234 points by azhenley 3 years ago | 89 comments

Screenshot of blog.enamya.me: Why Bcrypt Can Be Unsafe for Password Hashing?

Why Bcrypt Can Be Unsafe for Password Hashing?(blog.enamya.me)

11 points by enamya 11 months ago | 12 comments

Screenshot of jeremykun.com: Updates on HEIR, the Homomorphic Encryption Compiler Project

Updates on HEIR, the Homomorphic Encryption Compiler Project (jeremykun.com)

32 points by turtleyacht 1 month ago | 0 comments

Screenshot of myme.no: Programming is hard

Programming is hard (myme.no)

85 points by ingve 3 years ago | 77 comments