My Math Forum Caesar Encryption

 Algebra Pre-Algebra and Basic Algebra Math Forum

 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:
 Originally Posted by mrdumb 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?.
Hmm, maybe A is a shift of 0 so N is a shift of 13.

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 Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post mobel Computer Science 6 February 18th, 2014 03:17 PM g_litched Algebra 3 March 24th, 2010 12:44 PM demathforum Computer Science 1 October 10th, 2008 11:50 PM Maniac Computer Science 9 July 29th, 2008 06:48 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top