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

Imagine there is a $n$ bit block cipher. The attacker has harvested some how all possible $2^n$ cipher texts for some given key. Without the knowledge of the distribution of input domain as in frequency counts or some statistical information of input data. Is it possible to perform ciphertext-only attacks? Are there any examples?

Edit: Stated in other way, what does it take to launch ciphertext-only attacks on block ciphers? Can you provide any examples?

share|improve this question
In what kind of attacks are you interested in: Anything that distinguishes the ciphertext (or is it the plaintext) from random? Or something more practical? – fgrieu Feb 1 '14 at 7:09
either way would be of help . – sashank Feb 1 '14 at 14:24

Since for any fixed key the encryption algorithm is a bijection from the set of $n$-bit strings onto itself, the set of all possible ciphertexts is regardless of the key and algorithm always the set of all $n$-bit strings and does not provide any information.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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