Thread: Encryption (Caesar cipher)

Hello all

I have been out sick for the last four weeks and came back to a world of headaches and catching up.

Having a problem with this question.

The Following message was encrypted using a modular encryption which takes the form : y = (ax +b) mod 26

NJIVI YVI CUVI NJYL Y JWLZVIZ HSTTSUL AYTYXSIE SL NJI UHEIVFYHTI WLSFIVEI


Decipher the message:

I think its the Caesar cipher.

I did a cryptogrpahy course ages ago, so I cannot exactly remember how to do these exactly, but perhaps you could try downloading this program called cryptool. If I remember correctly this little piece of gold can decipher your encrypted message with relative ease.

You can get it from

Cryptool - Download

You might need to spend sometime working out how to use it, but its not that difficult.
Hope that helps.

Originally Posted by Ciachyou

The Following message was encrypted using a modular encryption which takes the form : y = (ax +b) mod 26

NJIVI YVI CUVI NJYL Y JWLZVIZ HSTTSUL AYTYXSIE SL NJI UHEIVFYHTI WLSFIVEI

I deciphered it. Here is how:
1) notice there is a one letter long word (Y), so it must be "a" (it could have been "s", from " 's ", but it is less likely in this context because of the apostrophe)
2) notice there are two consecutive T, so there aren't many possibilities. Any other remark/guess could have helped.

As a consequence of 1), modulo 26. (I code a by 0, b by 2, etc., until z coded by 25), hence .
It remains 26 possibilities for . Each of them gives a corresponding and a possible deciphering of the message.

First option: write a (very short) computer program to list them all and see which one is the right one. Anyway, you'll be glad to have it when it comes to deciphering the whole message, so you should think about giving it a try if you have some programming knowledge. I wrote a two or three line long program with Scilab that deciphers with given parameters a and b, and this spares much time. It should be very simple in any programming language.

Second option: use remark 2) to find . If like me you're lucky enough to guess that the double letter is an L, then you get the equation: , hence , or (modulo 26). From there you can deduce : it is a matter of inverting 21 modulo 26. These numbers are relatively prime, so this is possible, and Euclid's algorithms gives: , hence , and finally: .

As a conclusion, the coding is . I let you discover the hidden message...

Thanks,

I really hate to ask but how would you use the

.

x = position of letter

So its I = 9 => y=3(9) + 6 (mod 26).

=> y=27(mod 26)
27 - 26 = 1 => A
Am i close?

Also you started at 0, i uploaded an attachment which starts off as 1 = a .
Its the one they gave us , i dont know if it matters.
Any chance of a few examples.

Originally Posted by Ciachyou

Thanks,

I really hate to ask but how would you use the

.

x = position of letter

Feel welcome to ask! What you wrote is correct, with A=0, B=1,..., Z= 25.
Then V (number 21) becomes , which is an R.

If you want to use your table, you can let and ; this gives .

Estimates show that there are around one hundred billion stars in a galaxy.




Thanks Laurent you save me : D.
Used y = 3x + 4(mod 26).