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

Assuming P != NP we still don't have any proof that sha-2 etc can't be reversed (obviously there is a loss of data). It's implausible for now but someday I guarantee we will have the math that makes it trivial. It does not require P = NP.


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

Search: