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

Assuming the ability to launch Chosen Plaintext Attacks (CPA), how many oracle calls does an attacker need to break the affine cipher? How does it work?

share|improve this question
What happens if the attacker asks the oracle to encrypt $x = 0$? – Thomas Feb 25 '13 at 9:13

The answer is 1 I think because if we apply a chosen plain text attack, then we need at least 2 encrypted alphabets and two plaintext alphabets corresponding to the related encrypted alphabets. Then we will have two variable and two equations.

By solving those you can get the additive key as well as the multiplicative key.

share|improve this answer

The answer is one. Choose the alphabet as the plaintext message and send it to the oracle.

Assuming I haven't fully answered your homework question yet, your job is to think about what the oracle's reply would look like, and how you might use it to help break other messages.

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.