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

This question already has an answer here:

I was wondering if I have the key and the encrypted Hill Cipher message(s). I can definitely figure out the charset involved. But the order is missing. Assuming that I use 37 modulo or higher. How would I go about cracking it?

share|improve this question

marked as duplicate by rath, e-sushi, Gilles, B-Con, Maeher Oct 16 '13 at 6:54

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

You don't. You just decrypt it. I can't think of a language that uses more than 36 letters apart from the Chinese family but then again I'm not a linguist.

Decrypt to a reasonable $n$ and then use the character frequencies to infer the language (and hence the modulo). Some trial and error may be required untill you get it right but for values of $n$ less than $2^{32}$ it shouldn't give you any practical problems on a desktop computer.

share|improve this answer
Assume the cipher uses digits and special characters, so it increases. Or the full ASCII set maybe. modulo 256+ – Omair . Oct 15 '13 at 7:39
Then start with max(modulo) and work your way down. It'll make sense at some point. You must have some notion of how the plaintext should look like so that you have something to compare your decryptions against. – rath Oct 15 '13 at 7:44

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