You are on page 1of 8

SMR

Cryptology
Classification and nomenclature
Third volunteer work of expanding knowledge for the subject of Computer
Securit, translated

Miriam Alonso
2SMR A
SMR
Cryptology
Miriam Alonso
Informatic security

NDICE

INTRODUCTION: CRYPTOLOGY 2

CLASSICAL CRYPTOLOGY METHODS 2

1. CODES 2
1.1. CODE BOOKS. 2
1.2. NOMENCLATORS 2
2. TRANSPOSITION 3
2.1. GROUPS 3
2.2. SIMPLE 3
2.2.1. GEOMETRIC 3
2.2.2. BY COLUMNS 3
2.3. DOUBLE 3
3. SUSTITUTION. 4
3.1. MONOALIPHATIC 4
3.1.1. MONOGRAPHIC SIMPLE. 5
3.1.2. POLYGRAPHIC 5
3.2. POLYALIPHATIC 5
3.2.1. PERIODIC 5
3.2.2. NON PERIODIC 5
3.2.2.1. NON-PERIODIC 6

CONCLUSIONS: 6

BIBLIOGRAFA RESUMIDA: 7

1
Cryptology
Miriam Alonso
Informatic security

Introduction: Cryptology

Cryptology and cryptanalysis have been widely debated along history. Originally, we could
find them in military, religious or even commercial environments, but they are becoming
more and more necessary for the medium user to acknowledge this tools in their day to day
life, even if they do not know of their existence.

In this study, we find the necessity of classifying the various types of code that exist in
classical cryptology a little bit better to understand the process with which weve gotten to
where we are today

Classical cryptology methods


We can find three major groups: Codes, Transposition methods and Substitution.

1. Codes

Codes

Code books. Nomenclators

In cryptology, the codes imply the change of the meaning of words in a message. This way,
Its a good day can mean retreat the troops

1.1. Code Books.


When codes are used, these go along a book of codes. This serves as a recompilation of
these changes on meaning.

1.2. Nomenclators
Although this name is also given to a relationship of population units judging by
municipalities, its a catalogue of geographical names that, when used over a map, builds a
solid reference over places and names.

2
Cryptology
Miriam Alonso
Informatic security

2. Transposition

Transposition

Simple Double

Geometric

By columns

On cryptology, and very briefly, is the code that in order to cypher relocates the order of
letters. We can find it in three different forms:

2.1. Groups
Relocate the messages character as if they were a series of sub-messages independent
from each other. One of the most representative examples is the Esctala, used by the
Ephor Spartans and described in Plutarcos creation.

2.2. Simple
Although to the naked eyes these messages should not be legible, they consist in relocating
the letters. An example of this is the Inverse Transposition, where inverting the order of
letters is enough to hide the message.

2.2.1. Geometric
Going from the quadratic representation of the original text, they use the application of a
geometric figure to choose the new reading order. It can use a triangle, a square or even a
spiral!

2.2.2. By columns
Using the total longitude of the text, this method orders the text in an X number of columns.
Once this is done, they are regrouped to create the cyphered text.

2.3. Double
The concept is simple. You only need to apply the same simple transposition cypher twice,
in order that it becomes slightly harder to reach the initial message.

3
Cryptology
Miriam Alonso
Informatic security

3. Sustitution.

Sustitution

Monoaliphatic Polyaliphatic

Monographic Polygraphic Periodic Not periodic

Standar Progressive Lineal


Digraphic
Alphabet Alphabets Alphabets

Mixed Standar
N-Graphic
alphabet Alphabets

Mixed
Transformation
Alphabets

The Substitute method of cyphering is not about changing the meaning of the words as the
first group, not about changing the order of the letters in the message like the second one.
The substitution method change one letters for others following each one their own pattern.
This is the most extensive family of the classical Cryptology, and here are some of the
examples.

3.1. Monoaliphatic
This first model to be cataloged is nothing more than the kind of substitution cyphering that
uses the same alphabet to make the interchanges. Some examples:

Atbash cyphering: Inverses the order of the alphabet and stablishes substitution couples in
clear text. This way, in our alphabet the A would correspond to the Z and the B to the Y. This
method can also be called Inverted Alphabet

Csar cyphering: Given more detail in class, this alphabet moves each letter three positions
from the letters to use. This way, the A turns into a D, the B turns into an E, etc.

ROT13 cyphering: Very similar to the Cesar, but instead of three times, it moves them
fourteen times. This way, the A turns into an N

Francmasn cyphering: Substitutes each letter with a different symbol that is not from our
alphabet.

4
Cryptology
Miriam Alonso
Informatic security

3.1.1. Monographic simple.

3.1.1.1. Standar alphabet

3.1.1.2. Mixed alphabet

3.1.1.3. Transformation
Related cyphering: Entering the territory of mathematics, this method substitutes each
letter for a mathematical expression to determine which would be their position on the final
text.

3.1.2. Polygraphic
Hills cyphering used a polyaliphatic based in lineal algebra and managed to use three
symbols simultaneously.

3.1.2.1. Digraphic
In this characteristic we can find the Playfairs cyphering, on which a 5x5 character matrix is
used. It has variables like the Double square or four squares in order to augment its
security.

3.1.2.2. Trigraphic

3.2. Polyaliphatic
We can consider that the difference between the simple substitution method and this one
is that every character can

Podemos considerar que la diferencia entre el mtodo de sustitucin simple y este en que
cada carcter puede

3.2.1. Periodic

3.2.1.1. Progressive alphabets


Enigma machine used by the German and deciphered by Turing, to whom was give quite
the cruel prize despite his achievements.

3.2.1.2. Lineal aphabets.


In this category we can find the Vigenre cyphering, which uses a squared template that is
twenty six spaces long, on which the alphabet letters are placed successively, starting each
time with the next one. This example has been treated in class. Each letter was codified
summing a corresponding number from a letter from a word used to decipher, repeated in
sequence along the message. Applying a simple sum, you obtain the new position of the
character.

3.2.2. Non periodic


Beaufort, on his own, creates a variable of the previous example in the S XVIII, changing the
direction of the deciphering, or as its also called, inverse cyphering.

One- time pad

5
Cryptology
Miriam Alonso
Informatic security

3.2.2.1. Non-periodic
Without being able to classify it as none of the previous, we also find the Bezaries method,
which consists in summing a transposition with a key, in order to posteriorly apply the
previous result to a substitution technique.

Conclusions:
We have to point out that there are many methods named in the following categories,
judging by the author, and that no authors coincide even in the structure of the kind of
encryption in their studies.

Curiously, if we except the most advanced techniques of substitution by random key, not a
single one of the researched techniques resist a serious cryptanalysis investigation.

From the Arab era we can point out the author Qalqashandi, who described a technique
that even today is still used to decipher messages.

It consists in counting the frequency on which each symbol appears in a cyphered


message. From there on, we can deduct the language, and then the original text can be
recovered.

Any monoaliphatic substitution technique that is long enough will have enought porcentual
percentage as to resolve the tests.

With time, cryptology continued evolving, it took giant steps in both World Wars, and in the
most recent eras it has taken on the challenge of wireless networks

Is common to imagine that new eras will continue demanding more and more from
deciphering techniques, and the stronger the machines we can use, the better well have to
be to decipher our informations data.

Modern
cryptology.

A-Symmetric Hashing
Simmetric.
(Public key) functions.

MDC
Flow cypher.
(without key)

MAC (with
Block cypher
key)

6
Cryptology
Miriam Alonso
Informatic security

Bibliography:

CRYPTOLOGY, FROM ANTIQUETY TO THE MACHINE Enigma


INTECO: Instituto Nacional de Tecnologas de la Comunicacin

CLASSICAL CRYPTOGRAPHY ALGORITHMS


Universidad nacional autnoma de Mxico. Edgar Uriel Domnguez Espinoza y Leonardo
Pacheco Gmez

AN INTRODUCTION TO CLASSICAL CRYPTOGRAPHY


Jos Ramn Soler Fuentanta

https://www.ccn-cert.cni.es/guia_401/es/c/n1669.htm

http://www.criptored.upm.es/software/sw_m001c.htm

https://es.wikipedia.org/wiki/Cdigo_(criptografa)

https://unamcriptografia.wordpress.com/2011/10/05/transposicion-simple/

http://serdis.dis.ulpgc.es/~ii-
cript/PAGINA%20WEB%20CLASICA/CRIPTPLOGIA/HISTORIA%20DE%20CRIPTOLOGIA%20-
%20ACTUAL.htm

You might also like