Scribd
Upload
54 views16 pages

Lecture 4

This document discusses various techniques for encrypting messages including transposition ciphers and public-key encryption. It provides examples of rail fence encryption where the plaintext is written in a grid and read off diagonally. More complex row transposition ciphers write the plaintext in a grid and read it off column-by-column in a scrambled order. Public-key encryption uses two keys, a public key for encryption and a private key for decryption, allowing secure communication between two parties. Popular public-key algorithms mentioned include RSA, Diffie-Hellman, and Elliptic Curve Cryptography.

Uploaded by

Opoka John Modi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
54 views16 pages

Lecture 4

This document discusses various techniques for encrypting messages including transposition ciphers and public-key encryption. It provides examples of rail fence encryption where the plaintext is written in a grid and read off diagonally. More complex row transposition ciphers write the plaintext in a grid and read it off column-by-column in a scrambled order. Public-key encryption uses two keys, a public key for encryption and a private key for decryption, allowing secure communication between two parties. Popular public-key algorithms mentioned include RSA, Diffie-Hellman, and Elliptic Curve Cryptography.

Uploaded by

Opoka John Modi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

INFORMATION ASSURANCE AND

SECURITY
By

Mr. Okello Emmanuel

[email protected]

0784990516
TRANSPOSITION TECHNIQUES

All the techniques examined so far involve the


substitution of a cipher text symbol for a plaintext
symbol. A very different kind of mapping is achieved by
performing some sort of permutation on the plaintext
letters. This technique is referred to as a transposition
cipher.
Rail fence
Rail fence is simplest of such cipher, in which the

plaintext is written down as a sequence of diagonals


and then read off as a sequence of rows.
Rail fence……
Example 1:
Plaintext = meet at the school house

To encipher this message with a rail fence of depth 2, we


write the message as follows:
M E A T E C O L O S
E T T H S H O H U E

The encrypted message is:


MEATECOLOSETTHSHOHUE
Rail fence……
Example 2:

Plaintext = hello world

To encipher this message with a rail fence of depth 3,

H O L

E L W R D
L O
HOLELWRDLO
Exercise
i. Encrypt the message “Good morning” with a rail
fence of depth 2,
ii. Decrypt the message
“GFEKOIOODECSAEODEGBUSONMGNHR” with a rail

fence of depth 3

iii. Decrypt the message


“FESNECARIETIGNFUCIUSHEPSOOSESLTPTRS” with
fence of depth 4.
Row Transposition Ciphers
A more complex scheme is to write the message in a
rectangle, row by row, and read the message off, column by
column, but permute the order of the columns. The order of
columns then becomes the key of the algorithm.
e.g., plaintext = meet at the school house.
4 3 1 2 5 6 7

M E E T A T T
H E S C H O O
L H O U S E X
CT = ESOTCUEEHMHLAHSTOETOX
Row Transposition Ciphers……
A pure transposition cipher is easily recognized

because it has the same letter frequencies as the


original plaintext. The transposition cipher can be
made significantly more secure by performing more
than one stage of transposition. The result is more
complex permutation that is not easily
reconstructed
Public-Key Encryption
Public-Key Encryption
Public-key cryptography is asymmetric - use of two
separate keys.

A public-key encryption scheme has six ingredients,


Plaintext: the readable message or data that is fed

into the algorithm as input.


Encryption algorithm: performs various
transformations on the plaintext.
Public-Key Encryption
Public and private key: a pair of keys selected so
that if one is used for encryption, the other is used
for decryption. The exact transformations performed
by the encryption algorithm depend on the public or
private key that is provided as input
Ciphertext: the scrambled message produced as
output that depends on the plaintext and key. For a
given message, two different keys produce two
different ciphertexts.
Decryption algorithm: takes ciphertext and key to
produces the original plaintext.
Public-Key Encryption
Public key of the pair is made public for others to use,
while the private key is known only to its owner.

A general-purpose public-key cryptographic algorithm


relies on one key for encryption and a different but
related key for decryption.
Public-Key Encryption

The essential steps are the following:


1. Each user generates a pair of keys to be used for the
encryption and decryption of messages.
2. Each user places one of the two keys in a public
register or other accessible file. This is the public key.
The companion key is kept private. Each user maintains
a collection of public keys obtained from others.
Public-Key Encryption
3. If Bob wishes to send a private message to Alice, Bob
encrypts the message using Alice’s public key.

4. When Alice receives the message, she decrypts it


using her private key. No other recipient can decrypt
the message because only Alice knows Alice’s private
key.
Public-Key Algorithms
RSA (Rivest, Shamir, Adleman)

Developed in 1977

only widely accepted public-key encryption algorithm

given tech advances need 1024+ bit keys

Diffie-Hellman key exchange algorithm

only allows exchange of a secret key

Digital Signature Standard (DSS)

Provides only a digital signature function with SHA-1

Elliptic curve cryptography (ECC)

New, security like RSA, but with much smaller keys


END

You might also like