{"id":3781,"date":"2022-09-15T15:27:21","date_gmt":"2022-09-15T13:27:21","guid":{"rendered":"https:\/\/erlebnisland-mathematik.de\/?page_id=3781"},"modified":"2023-06-21T15:04:59","modified_gmt":"2023-06-21T13:04:59","slug":"advanced-text-crack-the-code","status":"publish","type":"page","link":"https:\/\/erlebnisland-mathematik.de\/en\/advanced-text-crack-the-code\/","title":{"rendered":"Advanced text Crack the code"},"content":{"rendered":"

[vc_row drowwidth=”sidebar-biest-default sidebar-biest”][vc_column][vc_column_text]<\/p>\n

Crack the Code<\/h1>\n

A sequence of letters appears on a screen, divided into blocks but unreadable at first glance. It is the encoded<\/em> (ciphered<\/em> or “coded<\/em>“) form of an initially unknown text (“plaintext<\/em>“). In other words, what you see is not the “plaintext”, but an encrypted or ciphertext, the “ciphertext<\/em>“. The task of so-called decoding<\/em> is to translate (decipher<\/em>, i.e., translate) the ciphertext back into the corresponding plaintext. To do this, the code with which the plaintext was encoded, i.e. encrypted, must be “cracked<\/em>“.<\/p>\n

The ciphertexts that appear on the screen in EXPERIENCE LAND MATHEMATICS have been encoded according to a monoalphabetic<\/em> code. This code assigns exactly one letter of the ciphertext alphabet to each letter of the alphabet. Such a code has been known and famous for over 2000 years as the so-called Caesar cipher<\/em>. It bears the name of the Roman general and emperor, Gajus Julius Caesar<\/em> (100–44 B.C.), who “coded<\/em>” correspondence with his troops in this way. The alphabet of the ciphertext is created simply by shifting the order of the letters in the alphabet of the plaintext by a certain number of digits (translation<\/em>). When shifted by four digits, the letters of the plaintext alphabet become the following ciphertext alphabet:[\/vc_column_text][vc_column_text]\n\n\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
A<\/td>E<\/td>\n<\/tr>\n
B<\/td>F<\/td>\n<\/tr>\n
C<\/td>G<\/td>\n<\/tr>\n
D<\/td>H<\/td>\n<\/tr>\n
E<\/td>I<\/td>\n<\/tr>\n
F<\/td>J<\/td>\n<\/tr>\n
G<\/td>K<\/td>\n<\/tr>\n
H<\/td>L<\/td>\n<\/tr>\n
I<\/td>M<\/td>\n<\/tr>\n
J<\/td>N<\/td>\n<\/tr>\n
K<\/td>O<\/td>\n<\/tr>\n
L<\/td>P<\/td>\n<\/tr>\n
M<\/td>Q<\/td>\n<\/tr>\n
N<\/td>R<\/td>\n<\/tr>\n
O<\/td>S<\/td>\n<\/tr>\n
P<\/td>T<\/td>\n<\/tr>\n
Q<\/td>U<\/td>\n<\/tr>\n
R<\/td>V<\/td>\n<\/tr>\n
S<\/td>W<\/td>\n<\/tr>\n
T<\/td>X<\/td>\n<\/tr>\n
U<\/td>Y<\/td>\n<\/tr>\n
V<\/td>Z<\/td>\n<\/tr>\n
W<\/td>A<\/td>\n<\/tr>\n
X<\/td>B<\/td>\n<\/tr>\n
Y<\/td>C<\/td>\n<\/tr>\n
Z<\/td>D<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/p>\n

Table 1: The Caesar cipher<\/p>\n

[\/vc_column_text][vc_column_text]For example, if you want to arrange a “secret<\/em>” meeting in ADVENTURELAND MATHEMATICS with your girlfriend or boyfriend, the meeting place would be in the secret code:<\/p>\n

IVPIFRMWPERH QEXLIQEXMO.<\/p>\n

As a rule, however, in a monoalphabetic code the letters of the plaintext alphabet are not “shifted<\/em>” evenly, but permuted<\/em>, i.e. jumbled up. An example of this is the following coding:[\/vc_column_text][vc_column_text]\n\n\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
A<\/td>D<\/td>\n<\/tr>\n
B<\/td>F<\/td>\n<\/tr>\n
C<\/td>G<\/td>\n<\/tr>\n
D<\/td>K<\/td>\n<\/tr>\n
E<\/td>I<\/td>\n<\/tr>\n
F<\/td>J<\/td>\n<\/tr>\n
G<\/td>H<\/td>\n<\/tr>\n
H<\/td>L<\/td>\n<\/tr>\n
I<\/td>M<\/td>\n<\/tr>\n
J<\/td>E<\/td>\n<\/tr>\n
K<\/td>O<\/td>\n<\/tr>\n
L<\/td>P<\/td>\n<\/tr>\n
M<\/td>R<\/td>\n<\/tr>\n
N<\/td>Q<\/td>\n<\/tr>\n
O<\/td>S<\/td>\n<\/tr>\n
P<\/td>B<\/td>\n<\/tr>\n
Q<\/td>U<\/td>\n<\/tr>\n
R<\/td>V<\/td>\n<\/tr>\n
S<\/td>N<\/td>\n<\/tr>\n
T<\/td>X<\/td>\n<\/tr>\n
U<\/td>Y<\/td>\n<\/tr>\n
V<\/td>A<\/td>\n<\/tr>\n
W<\/td>Z<\/td>\n<\/tr>\n
X<\/td>T<\/td>\n<\/tr>\n
Y<\/td>C<\/td>\n<\/tr>\n
Z<\/td>W<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/p>\n

Table 2: Another monoalphabetic encoding<\/p>\n

[\/vc_column_text][vc_column_text]The ADVENTURELAND MATHEMATICS would now be called in the cipher<\/p>\n

IBPIFQMPDQK RDXLIRDXMO.<\/p>\n

The code is a (reversible) unique assignment of one letter of the plaintext alphabet to one letter of the ciphertext alphabet. For this there is exactly <\/p>\n

  <\/span>   <\/span>\"\[26!=1\cdot2\cdot3\cdots26=403.291.461.126.605.635.584.000.000\]\"<\/p>\n

Possibilities!<\/p>\n

Despite this dizzying number, there is a chance to crack such a code in a manageable amount of time. For this purpose, the so-called frequency analysis<\/em> is used. First, the frequencies of the individual letters in the ciphertext are determined and compared with the general frequencies of the letters in the language of the (unknown) plaintext. Then the letters in the ciphertext are replaced by the letters of the same frequency in the language. You start with the most common letters. In the German plain texts, these are “E” and “N”. This method, which can be tried on our exhibit (by first trying to find the “E” in the plaintext, then the “N”, and so on), is of course more reliable the longer the text to be deciphered. The following table shows for German-language texts which relative frequencies the individual letters of the alphabet have with regard to their occurrence:[\/vc_column_text][vc_column_text]\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Position<\/th>Letter<\/th>Relative frequency<\/th>\n<\/tr>\n<\/thead>\n
1.<\/td>E<\/td>17,40% <\/td>\n<\/tr>\n
2.<\/td>N<\/td>9,78% <\/td>\n<\/tr>\n
3.<\/td>I<\/td>7,55% <\/td>\n<\/tr>\n
4.<\/td>S<\/td>7,27% <\/td>\n<\/tr>\n
5.<\/td>R<\/td>7,00% <\/td>\n<\/tr>\n
6.<\/td>A<\/td>6,51% <\/td>\n<\/tr>\n
7.<\/td>T<\/td>6,15% <\/td>\n<\/tr>\n
8.<\/td>D<\/td>5,08% <\/td>\n<\/tr>\n
9.<\/td>H<\/td>4,76% <\/td>\n<\/tr>\n
10.<\/td>U<\/td>4,35% <\/td>\n<\/tr>\n
11.<\/td>L<\/td>3,44% <\/td>\n<\/tr>\n
12.<\/td>C<\/td>3,06% <\/td>\n<\/tr>\n
13.<\/td>G<\/td>3,01% <\/td>\n<\/tr>\n
14.<\/td>M<\/td>2,53% <\/td>\n<\/tr>\n
15.<\/td>O<\/td>2,51% <\/td>\n<\/tr>\n
16.<\/td>B<\/td>1,89% <\/td>\n<\/tr>\n
17.<\/td>W<\/td>1,89% <\/td>\n<\/tr>\n
18.<\/td>F<\/td>1,66% <\/td>\n<\/tr>\n
19.<\/td>K<\/td>1,21% <\/td>\n<\/tr>\n
20.<\/td>Z<\/td>1,13% <\/td>\n<\/tr>\n
21.<\/td>P<\/td>0,79% <\/td>\n<\/tr>\n
22.<\/td>V<\/td>0,67% <\/td>\n<\/tr>\n
23.<\/td>\u00df<\/td>0,31% <\/td>\n<\/tr>\n
24.<\/td>J<\/td>0,27% <\/td>\n<\/tr>\n
25.<\/td>Y<\/td>0,04% <\/td>\n<\/tr>\n
26.<\/td>X<\/td>0,03% <\/td>\n<\/tr>\n
27.<\/td>Q<\/td>0,02% <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/p>\n

Table 3: Relative frequencies of the letters<\/p>\n

[\/vc_column_text][vc_column_text]For comparison: If the 27 letters (including “\u00df”) were distributed equally, the frequency would be 3.704% in each case.[\/vc_column_text][vc_column_text]<\/p>\n

Literature<\/h3>\n

[\/vc_column_text][vc_column_text][1] Bauer, F.L.: Entzifferte Geheimnisse. Codes und Chiffren und wie sie gebrochen werden<\/em>, Berlin \/ Heidelberg, 1995.<\/p>\n

[2] Beutelspacher, A. u.a.: Mathematik zum Anfassen<\/em>, Mathematikum, Gie\u00dfen, 2005.<\/p>\n

[3] Beutelspacher, A.: Kryptologie<\/em>, 7. Auflage, Wiesbaden, 2005.<\/p>\n

[4] Singh, S.: Secret Messages. The art of encryption from antiquity to the times of the Internet, <\/em>7. Auflage, M\u00fcnchen, 2006.[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n<\/div>","protected":false},"excerpt":{"rendered":"

[vc_row drowwidth=”sidebar-biest-default sidebar-biest”][vc_column][vc_column_text] Crack the Code A sequence of letters appears on a screen, divided into blocks but unreadable at first glance. It is the encoded (ciphered or “coded“) form of an initially unknown text (“plaintext“). In other words, what you see is not the “plaintext”, but an encrypted or ciphertext, the “ciphertext“. The task … Advanced text Crack the code<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"footnotes":""},"folder":[],"class_list":["post-3781","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/pages\/3781","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/comments?post=3781"}],"version-history":[{"count":12,"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/pages\/3781\/revisions"}],"predecessor-version":[{"id":4714,"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/pages\/3781\/revisions\/4714"}],"wp:attachment":[{"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/media?parent=3781"}],"wp:term":[{"taxonomy":"folder","embeddable":true,"href":"https:\/\/erlebnisland-mathematik.de\/en\/wp-json\/wp\/v2\/folder?post=3781"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}