« first day (1454 days earlier)      last day (3227 days later) » 

SEJPM
SEJPM
6:22 PM
soo, 6th july has arrived and date hasn't changed yet...
Let's see if we actually learn the second-round CAESAR candidates today
 
 
2 hours later…
SEJPM
SEJPM
8:15 PM
I'm not sure what to do about the following question:
0
Q: computational complexity class of decryption of AES

DotdatsI haven't really seen what computational complexity class of decryption of AES is. Can anyone provide reference papers or answers here?

encryption aes complexity
The question by itself allows two interpretations: Does the author want to know how fast decryption works and how to express this by means like P and NP? Or does he want to know how fast it is possible to break unknown plaintexts by means like P and NP?
From the comments it is obvious that he wanted the second question, but already have a (good?) answer to the first one, meaning we'd make this answer obsolete if we edit the question now to clarify it.
So what to do about the question? Abandon it? Close it? Make the author re-post it more clearly and edit the question so it fits the first question?
 

« first day (1454 days earlier)      last day (3227 days later) »