Comment on Why cryptography is not based on NP-complete problemsparentComments−westurner1ySAT Solvers, GA, LLMs, brute forceBirthday paradox probability changes with memoization.Rainbow tables trade CPU for storage for lookup; but salting, double hashing, and key derivation functions with many rounds like pbkdf and argon2.
Comments
SAT Solvers, GA, LLMs, brute force
Birthday paradox probability changes with memoization.
Rainbow tables trade CPU for storage for lookup; but salting, double hashing, and key derivation functions with many rounds like pbkdf and argon2.