DECRYPTING CAESAR CIPHER

BY
SHAYAN NANDY
ENROLMENT NO. :- 12020002002033
SAPTARSHI GHOSH DASTIDAR
ENROLMENT NO. :- 12020002002109
SOUVIK PAUL
ENROLMENT NO. :- 12020002002128
CONTENTS

 Introduction
 Mathematical base
 Example
 Summary
 Reference
INTRODUCTION

 In cryptography, Caesar cipher is one of the simplest and most widely known encryption
techniques.
 It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter
some fixed number of position down the alphabet.
 Caesar cipher is often incorporated as part of more complex algorithm such as Vigenère
cipher and still has modern application in the ROT13 system. However it has no
communication security and can be easily broken.
MATHEMATICAL BASE

 The encryption can also be represented using modular arithmetic by transforming the letters
into numbers.
 Encrypting of as letter x by a shift n can be described mathematically as

𝐸𝑛 (x) = (x+n) mod 26

 Decryption can be described mathematically as

𝐷𝑛 (x) = (x-n) mod 26

EXAMPLE

 First row in the table below denotes plaintext and the second row is
ciphertext for shift by 3.

A B C D . . . . Y Z
D E F G B C

 In this cipher let plaintext be ATTACK ON TITAN.

 The cipher text will be DWWDFN DW WLWDQ.
SUMMARY

 Considerably easy to break.

 Brute force attack works pretty well, due to relatively small keys(only allows
26 different keys).
 Also known as monoalphabetic cipher, which the same plaintext letters
are always replaced by the same ciphhertext letters.
REFERENCE

 http://en.Wikipedia.org/wiki/
 Applied Cryptography by Bruce Schneier; 10𝑡ℎ Anniversary edition
THANK YOU