Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Grover's algorithm, even assuming that we have hardware that can efficiently implement it, improves the runtime of a brute force attack on AES-256 from 10^49 * age of the universe to 10^10 * age of the universe. Hardly practical. All symmetric ciphers and all hashes are quantum-proof. Key exchange might become problematic, but that is a different problem


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: