<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>7704</id>
  <path>/www/nrich/html/content/id/7704/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-10-24T11:53:39</last_published>
  <indexXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;
&lt;p&gt;Zhoo grqh, brx&amp;#39;yh fudfnhg wklv frgh! Kdyh brx zrunhg rxw krz wklv phvvdjh kdv ehhq hqflskhuhg? Wkh ohwwhu &amp;#39;d&amp;#39; zdv pdsshg wr &amp;#39;g&amp;#39;, &amp;#39;e&amp;#39; wr &amp;#39;h&amp;#39; hwf. Wklv lv fdoohg d Fdhvdu vkliw, zlwk d vkliw ri wkuhh ohwwhuv lq wklv fdvh. Zh dovr pdgh wklqjv d elw hdvlhu eb ohdylqj sxqfwxdwlrq dqg wkh vsdfhv ehwzhhq wkh zrugv lq. Krz glg brx ghflskhu wklv? Brx pdb kdyh wulhg orrnlqj iru uhshdwhg wkuhh ohwwhu
zrugv vxfk dv &amp;#39;wkh&amp;#39;, ru frxqwhg krz pdqb ri hdfk ohwwhu dsshduhg lq wkh flskhuwhaw dqg jxhvvhg wkdw wkh prvw frpprq ohwwhu fruuhvsrqgv wr &amp;#39;h&amp;#39;. Wklv vhfrqg phwkrg lv wkh edvlv ri d phwkrg fdoohg iuhtxhqfb dqdobvlv dqg lv yhub xvhixo iru prqrdoskdehwlf flskhuv. Li brx nqrz krz wr surjudp, brx fdq vdyh brxuvhoi d orw ri wlph eb zulwlqj vrph frgh wr gr lw iru brx! Grq&amp;#39;w zruub li brx grq&amp;#39;w wkrxjk,
wkhuh duh orwv ri zdbv brx fdq gr lw. Wkh &amp;#39;ilqg dqg uhsodfh&amp;#39; wrro lq d zrug surfhvvlqj surjudp fdq eh yhub xvhixo, mxvw pdnh vxuh brx grq&amp;#39;w fkdqjh djdlq wkh ohwwhuv brx&amp;#39;yh douhdgb uhsodfhg! Rqh zdb durxqg wklv lv wr wxuq wkh zkroh phvvdjh lqwr orzhu fdvh, dqg wkhq xvh fdslwdov iru wkh ghfusbwhg phvvdjh. Wkh qhaw phvvdjh zloo eh voljkwob kdughu, jrrg oxfn!&lt;/p&gt;

&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;Have you managed to solve the entire &lt;a href=&quot;http://nrich.maths.org/7081&quot;&gt;Stage 5 Cipher Challenge&lt;/a&gt;? Solutions are now closed, but perhaps you want to take up the full challenge.&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;Successful solvers of this part were&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;Amy, England&lt;br&gt;&lt;/br&gt;
Khishigbadral Ganzorigt, Li Po Chun United World College, Hong Kong&lt;br&gt;&lt;/br&gt;
Ibrahim EL-Serafy, Slough Grammar School, England&lt;br&gt;&lt;/br&gt;
Ben James, Wilson&amp;#39;s School, United Kingdon&lt;br&gt;&lt;/br&gt;
Mahdokht Mohamady, Farzanegan of Kermanshah&lt;br&gt;&lt;/br&gt;
Patrick, Woodbridge School, England&lt;br&gt;&lt;/br&gt;
Narika and Juhi, Claremont High School Academy Trust, England&lt;br&gt;&lt;/br&gt;
Jasmine Velani, Salcombe Preparatory&lt;br&gt;&lt;/br&gt;
Luke, Cottenham Village College, England&lt;br&gt;&lt;/br&gt;
Louis, Parkside School, England&lt;br&gt;&lt;/br&gt;
Rhea from England&lt;br&gt;&lt;/br&gt;
Matthew from Wilson&amp;#39;s School, England&lt;br&gt;&lt;/br&gt;
An Anonymous Solver, from Somewhere&lt;br&gt;&lt;/br&gt;
Jospeh, from Hong Kong&lt;br&gt;&lt;/br&gt;
Adam, from England&lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;
&lt;p&gt;&lt;br&gt;&lt;/br&gt;
Well done to you all!&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The solution is as follows&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Well done, you&amp;#39;ve cracked this code! Have you worked out how this message has been enciphered? The letter &amp;#39;a&amp;#39; was mapped to &amp;#39;d&amp;#39;, &amp;#39;b&amp;#39; to &amp;#39;e&amp;#39; etc. This is called a Caesar shift, with a shift of three letters in this case. We also made things a bit easier by leaving punctuation and the spaces between the words in. How did you decipher this? You may have tried looking for repeated three letter words
such as &amp;#39;the&amp;#39;, or counted how many of each letter appeared in the ciphertext and guessed that the most common letter corresponds to &amp;#39;e&amp;#39;. This second method is the basis of a method called frequency analysis and is very useful for monoalphabetic ciphers. If you know how to program, you can save yourself a lot of time by writing some code to do it for you! Don&amp;#39;t worry if you don&amp;#39;t though, there are
lots of ways you can do it. The &amp;#39;find and replace&amp;#39; tool in a word processing program can be very useful, just make sure you don&amp;#39;t change again the letters you&amp;#39;ve already replaced! One way around this is to turn the whole message into lower case, and then use capitals for the decrpyted message. The next message will be slightly harder, good luck!&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Caesar shift +3&lt;/p&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;This challenge cipher forms part of a very difficult &lt;a href=&quot;http://nrich.maths.org/7081&quot;&gt;sequence of ciphers&lt;/a&gt; suitable for keen groups or individuals, maths clubs and very optional homework challenges. Don&amp;#39;t try this in the classroom!&lt;/p&gt;&lt;/mdoxml&gt;</noteXML>
  <clueXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;This is the first of our &lt;a href=&quot;https://nrich.maths.org/7081&quot;&gt;challenge ciphers&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;We recommend that you attempt them in order, as the solution of each challenge gives a small (and necessary!) hint for the next challenge.&lt;/p&gt;&lt;/mdoxml&gt;</clueXML>
  <canonXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;
&lt;p&gt;Well done, you&amp;#39;ve cracked this code! Have you worked out how this message has been enciphered? The letter &amp;#39;a&amp;#39; was mapped to &amp;#39;d&amp;#39;, &amp;#39;b&amp;#39; to &amp;#39;e&amp;#39; etc. This is called a Caesar shift, with a shift of three letters in this case. We also made things a bit easier by leaving punctuation and the spaces between the words in. How did you decipher this? You may have tried looking for repeated three letter
words such as &amp;#39;the&amp;#39;, or counted how many of each letter appeared in the ciphertext and guessed that the most common letter corresponds to &amp;#39;e&amp;#39;. This second method is the basis of a method called frequency analysis and is very useful for monoalphabetic ciphers. If you know how to program, you can save yourself a lot of time by writing some code to do it for you! Don&amp;#39;t worry if you don&amp;#39;t though,
there are lots of ways you can do it. The &amp;#39;find and replace&amp;#39; tool in a word processing program can be very useful, just make sure you don&amp;#39;t change again the letters you&amp;#39;ve already replaced! One way around this is to turn the whole message into lower case, and then use capitals for the decrpyted message. The next message will be slightly harder, good luck!&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;Caesar shift +3&lt;/p&gt;

&lt;/mdoxml&gt;</canonXML>
  <end_user_role>2</end_user_role>
  <difficulty>5</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>A Roman conversion?</title>
  <description>First cipher</description>
  <spec_group>Applications
    <specifier>Codes and cryptography</specifier>
  </spec_group>
</resource>