Modern

Cryptography
(Lab-1)

Dr.Saurabh Rana

SCSET Bennett University

India

,
Duration and Credit

CSET357 - Modern Cryptography

 Jan - May, 2022

 3 Credits (2-0-2)(L-T-P)
 Modern Cryptography NA
COURSE TITLE PRE-REQUISITES

COURSE CODE CSET357 TOTAL CREDITS 3

COURSE TYPE Specialization L-T-P FORMAT 2-0-2

Detailed Syllabus
Module 1(8 hours)

Modular arithmetic, Modular Polynomial Arithmetic, Divisibility

and greatest common divisors, Euclidean Theorem, Random
Number Generator, Pseudorandom Number Generator, Prime
numbers, unique factorization, finite fields, Powers and primitive
roots in finite fields, Fermat's theorem, Euler's theorem, Symmetric
ciphers (Difference between symmetric and asymmetric),
Monoalphabetic ciphers (Caesar cipher, Affine cipher, Additive
cipher).
Module 2 (9 hours)

Polyalphabetic cipher (Playfair cipher, Vigenère cipher) hash

functions, authentication and key establishment, Message
Authentication Codes (MACs), digital signatures, PKI. Block
Ciphers (Feistel Ciphers), Numerical of Feistel Ciphers, Data
Encryption standards 8-bit, Discrete Logarithms, Logarithms for
Modular Arithmetic.
Module 3 (11 hours)

Data encryption standards 64 bits, Advanced encryption standards, Diffie

Hellman Key Exchange Algorithm. Euclid Algorithm, Extended Euclid
Algorithm, RSA Algorithm. Message Authentication and Hash Functions.
Information Theory, Elliptic curves, Elliptic curves over finite fields, The
elliptic curve discrete logarithm problem, Elliptic curve cryptography,
Lenstra’s elliptic curve factorization algorithm, Hash Algorithm-SHA, MD5.
Digital Signature Algorithm and Authentication, Authentication Applications
KDC, RSA digital signatures, El Gamal digital signatures, GGH lattice-based
digital signatures.
EVALUATION POLICY

Components of Course Evaluation Percentage Distribution

Mid Term Examination 15

End Term Examination 30
Surprise Quiz 05
Lab Continuous Evaluation 30
Certification 20
Certification Mapping:

Certification Mapping:

1. Cryptography (23 hrs approx.)

https://www.coursera.org/learn/crypto2

2. Introduction-to-applied-cryptography (20 hrs

approx.)

https://www.coursera.org/learn
/introduction-to-applied-cryptography
Books

Text Book:

“William Stallings, Network Security”

Essentials (4 ed.), Prentice Hall, 2018.
ISBN 978-9352866601.
Books

Reference Book:

“W. Stallings, Cryptography and

Network Security” (7 ed.), Prentice
Hall, 2017. ISBN 978-9332585225.
Books

Suggested Reading:

“Introduction to Modern Cryptography”,

Jonathan Katz and Yehuda Lindell .
Amazon link for the Book

https://www.amazon.in/Cryptography-Network-Security-Principles-Practice/dp/933258
5229/ref=sr_1_1?crid=3LA589AFCCQR6&keywords=william+stallings+cryptography
+and+network+security&qid=1673450854&sprefix=william+stalling%2Caps%2C436
&sr=8-1
Continuous Assessment and Grading Policy

Important Notes:

Students having any problem related to the course (e.g., not able to understand,
requires extra attention) are suggested to discuss their problems with me in the
office hours or by writing an email. All the necessary help will be provided.

Attendance in all lectures is compulsory. Students, who do not meet 75%

attendance requirement in the course, will not be allowed to write the End Term
Exam.
Ancient Cryptography
Modern Cryptography
19

1976
1. Whitfield Diffie

2. Martin Hellman

3. Ralph Merkle
 Widely Used Cryptosystem

Asymmetric Cryptography
Applications giving rise in modern cryptography
Application
1. Alice
Bob Alice
2. Bob
3. Oscar(Bad Guy)

Oscar
Communication Channel

Insecure Channel
Cont…
Future in cryptography
Cont…

https://www.youtube.com/shorts/-uD6_yj
HrvY