Cryptology MIS 412
Cryptology MIS 412
Cryptology MIS 412
1. Confidentiality: it defines a set of roles that limit access or add restriction on certain
information
2. Data integrity: it takes care of the consistency and accuracy during it entire life cycle
3. Authentication: to comfirm the truth of an attribute that is claim to be true by an entity
4. Non-repudation: it ensure the inability of an author deny a statement
There are two general schemes we can handle in these course, where both alice and bob
need to have the same key in other to encrypt their communication.
There are also a concept of assymetric scheme (these is an aspect where you exchange a
key) where alice and bob both have a private(encrpt) and public key(decrpt). The public key
can be shared with any one, so bob can use it to encrypt a message for alice.
In these lecture we will study several well known cryptographic structures like:
RSA- Riverst Shannir Addleman
Cryptosystem
DES-
ECC- elliptic curved cryptography
A SHIFTING MAP
Before we start defining the basic notation, let use motivate the following with some
historically known cryptosystem. One of the most famous cryptosystem goes back to Julius
Caesar, we refer to it as Caesar cipher. CARSAR CIPHER those the following:
Take the latin alphabet and apply a mapping
A – 0, B – 1 ….Z – 25
X – (X + K)mod26
Cipher text:
A B C D E F G H I J K L M N O P Q R S T U V W X Z
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
LEMONL EM ONLE
LXFOP EF RNHR
Exercise
Plain text: l e o n b a t
Keyword: ME CMECM
LEONBAT
M E CMECM
YJRAGDF
A generalization of Caesar cipher is the virginia ciphe. It was invented several type, now the
reference goes back to the French cryptographer. Instead of using only one KEZ in verd we now use
KEZn
Cipher= K I E I I M
AN ALPHEBET IS A NONE Empty set of the set (E), we denote the length n(E)=|Z|= #Z
A WORD OVER ZIGMA isafinite sequences of letters. The empty sequence denote empty word.
The length of a word OMEGA(w) is denote by |w|EN . morrre over let En denote the set of all
wheres of length n
a cipher is a algorithm for performing encryption or decryption. If we have crypto system, the
corresponding cipher is given by cordiclity
If k is feasible, x and x! need to be kept secret, so the cypher is called symmetric, otherwise it is
called asymmetric.
Block cipher: let the zigma sign be an alphabet. A block cipher is a cipher acting on P=e=En for a
given block
Example:
Let us assume that we have n=3 and we want to encrypt the plain text p=1011011. P is of length 7.
The blocks look like 101 101 0 so we add zeros to the cast block until it has size 3; p= (p1, p2, p3)
such that p1=101, p2= 101, p3 = 100. We use the permutation cipher
X=x1 = S3, let us assume the key k =(123). We encrypt in ECB mode each block on its own
Stream ciphers
In contrast to block ciphers stream cipher can handle plaintext cipher textof any size without the
necessity of having blocks
Definition
I.A key stream is a stream of random or pseudo random characters or digits from E that are
combined with a plaintext digit (eg binary representation) encrryted one at a time with a
corresponding digit of a stream
3. a stream cipher is called synchronous if the keystream is independent of the plaintext and the
cipher text.
4. a stream is called self- synchronizing if the key stream is comprited depending on the n prev
cipher text digit for some nen
Train