Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
4
Newest
 Supporter
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 1 vote cast
Oct
19
awarded  Scholar
Oct
19
awarded  Supporter
Oct
19
accepted Is there a difference between asking for a signature and asking for a decryption in challenge-response authentication?
Oct
19
asked Is there a difference between asking for a signature and asking for a decryption in challenge-response authentication?
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?