
Algebra PreAlgebra and Basic Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
September 29th, 2014, 09:12 AM  #1 
Newbie Joined: Sep 2014 From: Canada Posts: 4 Thanks: 0  Caesar Encryption
Hello forgive me if I post it on wrong section, I would really appreciate if someone can help me solve or even give me hint about this problem. 1. Assume that we choose N (that is, K=14) as an encryption key in Caesarâ€™s cipher. What is the result Ci of the following (double) encryption Ci = E (K,E(K, Mi)) where Mi is an arbitrary plaintext element?. 2. If at all possible, how many encryptions with key K=2 is needed before observing the same effect as in the previous example (with K=14)? 
September 29th, 2014, 09:24 AM  #2  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Quote:
If you shift a letter forward by K, what do you get? If you shift it forward by 2K, what do you get? Try for both 13 and 14, and see what this tells you about the whole message.  

Tags 
caesar, encryption 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
mini encryption system : "LeftRight"  mobel  Computer Science  6  February 18th, 2014 03:17 PM 
Stronger Encryption keys  g_litched  Algebra  3  March 24th, 2010 12:44 PM 
Find the formula of the encryption  demathforum  Computer Science  1  October 10th, 2008 11:50 PM 
Encryption / Decryption  Maniac  Computer Science  9  July 29th, 2008 06:48 AM 