Information System Security

Md. Abdullah Al Mahamud

ID: 213-35-756
Sec: A
Batch: 36
Software Engineering
Department
Daffodil International University
 TOPIC

Ceaser Ciper algorithm: The Caesar Cipher technique is one of the earliest and
simplest methods of encryption technique. It’s simply a type of substitution cipher,
i.e., each letter of a given text is replaced by a letter with a fixed number of
positions down the alphabet. For example with a shift of 1, A would be replaced by
B, B would become C, and so on. The method is apparently named after Julius
Caesar, who apparently used it to communicate with his officials. Julius Ceaser

One time pad algorithm: One time pad algorithm is a method of encrypting
alphabetic plain text. It is one of the Substitution techniques which converts plain
text into ciphertext. In this mechanism, we assign a number to each character of
the Plain-Text. It is Invented by Gilbert Vernam and Major Joseph Mauborgne.

Julius Ceaser
 AGENDA
Project analysis slide 2
ANALYSIS CODE

ALGORITH
IMPLEMENT EXAMPLE
M

TESTING ACCURICY
 Ceaser Ciper Algorithm
Project analysis slide 4
BANGLADESH
Tasks

Message. EDQJODGHVK ---------> BANGLADESH

Encrypted Data Decrypted Data

Encryption Decryption. Original Data

Shift or key

Resources
 One Time Pad Algorithm
Project analysis slide 4
BANGLADESH Tasks

EDQJODGHVK --------------> BANGLADESH

Resources
 Project Analysis

Project analysis slide 8

ADVANTAGES DISADVANTAGES
CEASER CIPER

1.It is very easy to implement.
2. This method is the simplest method of cryptography.
3. Only one short key is used in its entire process.
If a system does not use complex coding techniques, it is
the best method for it.
ONE TIME PAD
1. It can be easily hacked. It means the message encrypted by this
method can be easily decrypted.
2. It provides very little security.
3. By looking at the pattern of letters in it, the entire message can
be decrypted.

1. There is the practical problem of making large quantities of

1. One-Time Pad is the only algorithm that is truly
unbreakable and can be used for low-bandwidth
channels requiring very high security(ex. for military uses).
random keys. Any heavily used system might require millions of
random characters on a regular basis.
2. For every message to be sent, a key of equal length is needed
by both sender and receiver. Thus, a mammoth key distribution
problem exists.
Thank You