Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the amount of decrease in the probability of decrypting a data encrypted using an AES algorithm? (That is by introducing each round out of ten whole rounds, how the probability of decryption is reduced?)

share|improve this question

closed as not a real question by Paŭlo Ebermann Mar 27 '13 at 0:03

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

Why are you asking the same question twice? – CodesInChaos Mar 26 '13 at 8:34
Sorry, your question as it is is not understandable. Could you try to reword it so it makes some sense? – Paŭlo Ebermann Mar 27 '13 at 0:03
See also this similar (but a bit clearer) question:… – Paŭlo Ebermann Mar 27 '13 at 0:21

I'm assuming there are holes in your question, but I'll answer it as is and then you'll probably want to change the question. Although please also see this question as it might answer your question too.

The probability of decrypting an AES encrypted ciphertext is $1$ if you have the right key and (practically) $0$ if you have the wrong key. This is independent of rounds, key size, ciphertext length, padding, etc.

share|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.