ALL SAINTS’ COLLEGE OF TECHNOLOGY

GANDHINAGAR, BHOPAL

PRESENTED BY :

NABILA ALI & IFFAT KHAN

 A Dynamic
Modular Cipher Cryptography Technique
 WHAT IS

CRYPTOGRAPHY?
 INTRODUCTION

 Security is a broad topic and covers a multitude of sins.

 it is concerned with making sure that nosy people cannot read, or worse
yet, secretly modify messages intended for other recipients.

 Network Security problems can be divided into 4 areas:

i. Confidentiality ii. Authentication
iii. Non-repudiation iv. Integrity

 Today’s major concept information security is to continue improve encryp

tion algorithm.
 CRYPTOGRAPHY
 The Art and the Science of keeping messages secure is Cryptography.

 Cryptography includes techniques such as encryption/decryption, hashing,

digital signatures, timestamps etc. to ensure information security

 The main goals of Cryptography are:

1. Confidentiality
2. Authentication
3. Integrity
4. Non-repudiation

 In order for cryptography to serve its purposes well, secure and reliable crypt
ographic algorithms are necessary.
 TERMINALOGY AND CONCEPTS

 Plain text – A message in its natural format readable by an attacker.

 Cipher Text – Message altered to ne unreadable by anyone except the

intended recipient.

 Key - Sequences that controls the operation and behavior of

the cryptographic algorithm. Keys are rules that used in algorithm to conve
rt a documents into secret document.
 CRYPTOGRAPHY
TECHNIQUE

SECRET-KEY PUBLIC-KEY
CRYPTOGRAHY CRYPTOGRAPHY

TYPES OF CRYPTOGRAPHY TECHNIQUE

EK(M)=C DK(C)=M

SYMMETRIC-KEY CRYPTOGRAPHY
 MODULE CIPHER & STREAM CIPHER

Module Cipher –

• In this, plain text is divided into blocks of fixed length and algorithms are
applied to each block separately.

• 128-bit Module of plaintext as input, and output a corresponding 128-bit

Module of cipher text.

• Used for encryption in mobile phone, email, home banking, etc.

Stream Cipher –

• They encrypt individual characters of a plaintext message one at a time usi

ng an encryption transformation which varies with time.

• They are word-oriented.

EK1(M)=C DK2(C)=M

K1 K2

PUBLIC-KEY CRYPTOGRAPHY
 DYNAMIC KEY

• The dynamic key is the new and advance concept in the field of cryptography.

• Once the cryptographic operation executed the key has been discarded. The
concept of dynamic key is based on OTP.

• In this either a long message is divided in too many part or there are many m
essage in both case each message is encrypted with the help of sub keys.

• Sub keys never share their complete info except few.

 A DYNAMIC MODULAR
CIPHER CRYPTOGRAPHY TECHNIQUE

1. Process to determine number of blocks.

2. Dynamic Key Generation function.

3. Encryption procedure.

4. Decryption procedure.
 MODULER DYNAMIC KEY GENERATION

• In this algorithm, encryption of variable size plaintext is performed using a dyn

amic key of size 164 bits.

• User input a text key ‘IK’ .Minimum size of IK is 6 bits and it can have maximu
m 14 bits.

• The dynamic key is generated using MCG (m, a, b, yo).

• MCG with parameters M, a, b and YM defines a sequence

Y1=a * yo+ b mod m

• ‘IBK’ is concatenated with the key entered by user to produce a matrix of
size 14X14.

• The function Fr involves various matrix operations such as multiplication,

shift operation, modulus etc .

• In which the random number yo is added to the final matrix to produce

the dynamic key.
 MATRIX

TRANSPOSITION

TRANSPOSE (P’)

DK1 XOR

DK2 ADD

FRAGMENTARY CIPHER1

ENCRYPTION PROCEDURE : ITERATION 1

ENCRYPTION PROCEDURE : ITERATION 2
DECRYPTION PROCEDURE : ITERATION 1
DECRYPTION PROCEDRE : ITERATION 2
FUNCTION USED IN ENCRYPTION & DECRYPTION

SHIFT CIPHER FUNCTION

• The shifting function used in encryption algorithm is

Cipher Text = mod ((plaintext + 1), 26)

TRANPOSITION CIPHER FUNCTION

• In this, the units of the plaintext are rearranged in a different and usually q
uite complex order .
PERFORMANCE ANALYSIS

IN COMPARISION OF DYNAMIC KEY & SESSION KEY

IN COMPARISION OF TIME COMPLEXITIES
 CONCLUSION

• The main merit of the algorithm is little amounting of computational tim

e that one has to spend to encrypt a message.

• This algorithm uses the concept of dynamic key & modular cipher which
gives high peed, time & security.

• More work on the key size and key sharing technique may be optimized
in future.
THANK YOU
for listening