Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
2
Impact
~599 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Sep
24
awarded  Autobiographer
Jul
20
awarded  Student
May
13
asked What constitutes a “description of B” for probabilistic encryption as defined in Cryptology 6.3.4?
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?