network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 3 months |
| seen | Feb 11 at 21:17 | |
| stats | profile views | 1 |
I am a student. A perpetual student.
|
Feb 10 |
comment |
Is AES reducible to an NP-complete problem? The question is motivated by the fact that I've heard it mentioned multiple times that all of our modern-day cryptography would be instantly broken if P = NP, and someone demonstrated an algorithm for solving NP problems in polynomial time. |
|
Feb 10 |
comment |
Is AES reducible to an NP-complete problem? I thought that PKC is NP-hard because its security relies on the difficulty of factoring large integers. |
|
Feb 10 |
asked | Is AES reducible to an NP-complete problem? |
