PROJECT REPORT

PROJECT REPORT
SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE AWARD OF DEGREE
OF

BACHELOR OF SCIENCE
in

MATHEMATICS
of

UNIVERSITY OF CALICUT

by

ADITHYA S BABU
Univ.Reg.No. CLAWSMT028

Department of MATHEMATICS
Sree Narayana Guru College
Chelannur, Kozhikode
 Department Of Mathematics
Sree Narayana Guru College
Chelannur, Calicut -673613

Certificate

This is to certify that the project report titled “Mathematical Foundations

Of Cryptography” is a bonafide record of the work carried out by
ADITHYA S BABU (Reg.No:CLAWSMT028) of Sree Narayana Guru College,
Chelannur, Calicut-673616 in partial fulfilment of the requirements for the award
of Degree of Bachelor of Science in Mathematics of Calicut University
,during the academic year 2022-2025.

Project guide/Supervisor Head of Department

Asst.Professor Asst.Professor
Mrs. Manjuraj S Dr. Vineesh K.P.
Dept of Mathematics Dept of Mathematics
Mathematical Foundations Of
Cryptography.
 DECLARATION

I hereby declare that this project work entitled MATHEMATICAL FOUNDATIONS OF

CRYPTOGRAPHY has been prepared by me during the year 2022-2025 under the guidance of
Mrs. Manjuraj S, Department of Mathematics, Sree Narayana Guru College, Chelannur, in the
partial fulfilment of B.Sc. degree prescribed by the college. I also declare that this project is the
outcome of my own effort, that it has not been submitted to any other university for the award of
any degree.

Chelannur March 2025 ADITHYA S BABU

 ACKNOWLEDGEMENT

First and foremost, I thank God for his providence and for being the guiding light throughout the
project. I would like to thank my guide Mrs. Manjuraj S (Asst. Professor of Mathematics) for
providing guidance for the preparation of this project report. Finally, I would like to extend my
sincere gratitude to friends who have always been helpful during my project preparation.

Chelannur March 2025 ADITHYA S BABU

Contents

1 Introduction 1
1.1 What is Cryptography? . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Origin of Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.3 Importance of Cryptography in the Modern Era . . . . . . . . . . . . . . 2
1.4 Structure of the Report . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2

2 Preliminaries 3
2.1 Mathematical Origins of Cryptography . . . . . . . . . . . . . . . . . . . 3
2.1.1 Number Theory and Cryptography . . . . . . . . . . . . . . . . . 3
2.1.2 Modular Arithmetic in Cryptography . . . . . . . . . . . . . . . . 3
2.1.3 Algebraic Structures . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.2 Mathematical Framework for Modern Cryptography . . . . . . . . . . . . 4
2.2.1 Group Theory Applications . . . . . . . . . . . . . . . . . . . . . 4
2.2.2 Ring Theory in Cryptography . . . . . . . . . . . . . . . . . . . . 4
2.2.3 Field Theory Applications . . . . . . . . . . . . . . . . . . . . . . 4
2.3 Evolution of Cryptographic Concepts . . . . . . . . . . . . . . . . . . . . 5
2.3.1 Classical Cryptographic Techniques . . . . . . . . . . . . . . . . . 5
2.3.2 Transition to Modern Cryptography . . . . . . . . . . . . . . . . . 5
2.4 Foundational Concepts for Modern Cryptography . . . . . . . . . . . . . 5
2.4.1 Discrete Logarithms . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.4.2 Elliptic Curves . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

3 Core Concepts in Cryptography 6

3.1 Types of Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2 Symmetric Key Cryptography . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2.1 Advanced Symmetric Cryptography . . . . . . . . . . . . . . . . . 7
3.2.2 Block Cipher Modes of Operation . . . . . . . . . . . . . . . . . . 7
3.2.3 Advanced Block Cipher Design . . . . . . . . . . . . . . . . . . . 8
3.2.4 Mathematical Analysis of AES . . . . . . . . . . . . . . . . . . . . 9
3.3 Asymmetric Key Cryptography . . . . . . . . . . . . . . . . . . . . . . . 11
3.3.1 Advanced Asymmetric Cryptography . . . . . . . . . . . . . . . . 11
3.3.2 Mathematical Foundations of RSA . . . . . . . . . . . . . . . . . 11
3.3.3 Elliptic Curve Cryptography (ECC) . . . . . . . . . . . . . . . . . 12
3.3.4 Lattice-Based Cryptography . . . . . . . . . . . . . . . . . . . . . 13
3.3.5 Comparison of Symmetric and Asymmetric Cryptography . . . . 14
3.4 Hash Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
3.4.1 Advanced Hash Functions . . . . . . . . . . . . . . . . . . . . . . 16
3.4.2 Mathematical Properties . . . . . . . . . . . . . . . . . . . . . . . 16
 3.4.3 Construction Methods . . . . . . . . . . . . . . . . . . . . . . . . 16
3.5 Post-Quantum Cryptography . . . . . . . . . . . . . . . . . . . . . . . . 18
3.5.1 Code-Based Cryptography . . . . . . . . . . . . . . . . . . . . . . 18

4 Applications and Algorithms in Cryptography 19

4.1 Applications of Cryptography . . . . . . . . . . . . . . . . . . . . . . . . 19
4.1.1 Secure Communication . . . . . . . . . . . . . . . . . . . . . . . . 19
4.1.2 Blockchain Technology . . . . . . . . . . . . . . . . . . . . . . . . 19
4.1.3 Data Storage and Privacy . . . . . . . . . . . . . . . . . . . . . . 20
4.1.4 Authentication Systems . . . . . . . . . . . . . . . . . . . . . . . 20
4.1.5 Digital Rights Management (DRM) . . . . . . . . . . . . . . . . . 20
4.2 Key Cryptographic Algorithms . . . . . . . . . . . . . . . . . . . . . . . 21
4.2.1 RSA Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
4.2.2 AES Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
4.2.3 Elliptic Curve Cryptography (ECC) . . . . . . . . . . . . . . . . . 23
4.2.4 Diffie-Hellman Key Exchange . . . . . . . . . . . . . . . . . . . . 23

5 Emerging Trends and Future Directions in Cryptography 24

5.1 Post-Quantum Cryptography . . . . . . . . . . . . . . . . . . . . . . . . 24
5.1.1 Key Concepts in Post-Quantum Cryptography . . . . . . . . . . . 24
5.1.2 Challenges and Implementation . . . . . . . . . . . . . . . . . . . 24
5.1.3 Applications of Post-Quantum Cryptography . . . . . . . . . . . . 25
5.2 Homomorphic Encryption . . . . . . . . . . . . . . . . . . . . . . . . . . 26
5.2.1 Types of Homomorphic Encryption . . . . . . . . . . . . . . . . . 26
5.2.2 Applications of Homomorphic Encryption . . . . . . . . . . . . . 26
5.2.3 Challenges in Homomorphic Encryption . . . . . . . . . . . . . . 26
5.3 Zero-Knowledge Proofs (ZKP) . . . . . . . . . . . . . . . . . . . . . . . . 27
5.3.1 Types of Zero-Knowledge Proofs . . . . . . . . . . . . . . . . . . . 27
5.3.2 Applications of Zero-Knowledge Proofs . . . . . . . . . . . . . . . 27
5.3.3 Challenges in Zero-Knowledge Proofs . . . . . . . . . . . . . . . . 27
5.4 Future Directions in Cryptography . . . . . . . . . . . . . . . . . . . . . 28
5.4.1 Integration with Artificial Intelligence (AI) . . . . . . . . . . . . . 28
5.4.2 Quantum-Resistant Protocols . . . . . . . . . . . . . . . . . . . . 28
5.4.3 IoT and Lightweight Cryptography . . . . . . . . . . . . . . . . . 28
5.4.4 Decentralized Cryptographic Systems . . . . . . . . . . . . . . . . 28
5.4.5 Ethical Considerations and Privacy . . . . . . . . . . . . . . . . . 28

6 Conclusion and Future Scope 29

6.1 Summary of Key Points . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.2 Significance of Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.3 Challenges and Limitations . . . . . . . . . . . . . . . . . . . . . . . . . 30
6.4 Future Scope . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
6.5 Closing Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30

7 References 31
Chapter 1

Introduction

Cryptography is the science of securing communication through mathematical techniques.

It plays a critical role in the digital world, ensuring data confidentiality, integrity, and
authenticity. This chapter introduces cryptography, its historical evolution, and its im-
portance in modern applications.

1.1 What is Cryptography?

Cryptography is the art of protecting information by transforming it into an unreadable
format, only to be converted back to readable format by those possessing the secret key.
The core objectives are:

• Confidentiality: Ensuring data is accessible only to authorized parties.

• Integrity: Protecting data from unauthorized alterations.

• Authenticity: Verifying the identity of the sender.

• Non-repudiation: Ensuring that the sender cannot deny the authenticity of their
message.

Cryptography operates on two key principles: encryption and decryption. Encryption

transforms plaintext into ciphertext using a mathematical algorithm and a key, while
decryption reverses this process to retrieve the original message.

1.2 Origin of Cryptography

The origins of cryptography trace back to ancient civilizations:

• Ancient Egypt: Hieroglyphic encryption techniques were used to convey sacred

messages.

• Greek Scytale: A tool used for transposition ciphers, where a strip of text was
wound around a rod to reveal the message.

• Julius Caesar: The Caesar cipher, a substitution cipher, shifted each letter in the
plaintext by a fixed number of positions.

1
 With the advent of computers, cryptography evolved significantly. The mid-20th
century marked the beginning of modern cryptography with the development of complex
algorithms. Notable milestones include:
• Enigma Machine: Used during World War II for encrypted communication by
the German military.
• Data Encryption Standard (DES): Adopted in the 1970s, DES was a significant
step in the standardization of cryptographic algorithms.
• Public-Key Cryptography: Introduced by Diffie and Hellman in 1976, this con-
cept revolutionized secure communication.

1.3 Importance of Cryptography in the Modern Era

In the digital age, cryptography underpins numerous technologies and applications:
• Secure Communication: Cryptographic protocols such as SSL/TLS ensure the
security of online transactions and data exchange.
• Data Integrity: Cryptographic hash functions verify the integrity of files and
messages.
• Authentication Systems: Passwords, biometrics, and multi-factor authentica-
tion rely on cryptographic techniques.
• Blockchain Technology: Cryptographic algorithms are essential for ensuring the
security and immutability of blockchain data.
Cryptography continues to evolve to address emerging challenges, such as quantum
computing, which threatens current cryptographic standards. Advances in post-quantum
cryptography aim to develop algorithms resistant to quantum attacks.

1.4 Structure of the Report

This report explores the mathematical foundations and practical applications of cryptog-
raphy:
• Chapter 2: Preliminaries: Covers essential mathematical concepts such as num-
ber theory and modular arithmetic.
• Chapter 3: Core Concepts: Delves into cryptographic algorithms and their
classifications.
• Chapter 4: Applications and Algorithms: Discusses real-world uses and step-
by-step implementations of key algorithms.
• Advanced Topics: Highlights emerging trends, such as post-quantum cryptogra-
phy.
This structured approach provides a comprehensive understanding of cryptography, bridg-
ing theory and practice.

2
Chapter 2

Preliminaries

Understanding cryptography requires a strong foundation in mathematics. This chap-

ter covers essential concepts such as number theory, modular arithmetic, and algebraic
structures, and discusses how existing mathematical principles were adapted to create
cryptographic systems.

2.1 Mathematical Origins of Cryptography

Cryptography has deep roots in mathematics, utilizing concepts that were initially de-
veloped for purely theoretical purposes. Key mathematical areas that influenced the
development of cryptography include:

2.1.1 Number Theory and Cryptography

Number theory, often referred to as the ”queen of mathematics,” has been instrumental
in cryptography. Concepts such as prime numbers, modular arithmetic, and divisibility
form the backbone of many cryptographic algorithms.
Role of Prime Numbers: Prime numbers are central to cryptography due to their
unique properties. For example, the security of the RSA algorithm relies on the difficulty
of factorizing large composite numbers into their prime factors.
Example of Prime Usage in Cryptography: Consider two prime numbers, p and
q. Their product, n = p · q, is used in RSA to generate public and private keys. While
multiplying p and q is computationally easy, factorizing n back into p and q is extremely
hard for large values.

Key Takeaways: Prime numbers are essential for creating secure public-key cryp-
tosystems. Modular arithmetic is widely used in encryption algorithms.

2.1.2 Modular Arithmetic in Cryptography

Modular arithmetic, often described as ”clock arithmetic,” plays a crucial role in cryp-
tography. It is used in algorithms like RSA, Diffie-Hellman, and ECC.
Example: Modular Exponentiation: Modular exponentiation is used to com-
pute expressions like ab mod n efficiently, even for large values of b. This is critical for
encrypting and decrypting messages in RSA.

3
2.1.3 Algebraic Structures
Algebraic structures such as groups, rings, and fields provide a framework for many
cryptographic operations:
• Groups: Used in Diffie-Hellman key exchange and elliptic curve cryptography.
• Fields: Enable arithmetic operations in finite fields, as seen in AES and ECC.

2.2 Mathematical Framework for Modern Cryptog-

raphy
2.2.1 Group Theory Applications
In modern cryptography, group theory provides the fundamental mathematical structure
for many algorithms. Key concepts include:
• Definition: A group (G, ·) is a set G with a binary operation · satisfying:
1. Closure: ∀a, b ∈ G, a · b ∈ G.
2. Associativity: ∀a, b, c ∈ G, (a · b) · c = a · (b · c).
3. Identity: ∃e ∈ G, ∀a ∈ G, e · a = a · e = a.
4. Inverse: ∀a ∈ G, ∃b ∈ G, a · b = b · a = e.

Application in RSA The multiplicative group modulo n, (Z/nZ)∗ , is crucial for RSA
cryptography.

2.2.2 Ring Theory in Cryptography

Rings provide additional structure through two operations, typically addition and multi-
plication:
• Definition: A ring (R, +, ×) consists of:
1. An abelian group (R, +).
2. A multiplication operation × that is associative.
3. Distributive laws connecting + and ×.

Example The ring Zn of integers modulo n is fundamental in many cryptographic

protocols.

2.2.3 Field Theory Applications

Fields extend rings by requiring multiplicative inverses for non-zero elements:
• Definition: A field F is a ring where:
1. Multiplication is commutative.
2. Every non-zero element has a multiplicative inverse.
3. 0 ̸= 1.

4
Application Finite fields GF (pn ) are essential in:

• AES encryption (GF (28 )).

• Elliptic curve cryptography.

• Reed-Solomon error correction.

Applications: RSA uses the group (Z/nZ)∗ , and Diffie-Hellman relies on cyclic
groups for secure key exchange.

2.3 Evolution of Cryptographic Concepts

2.3.1 Classical Cryptographic Techniques
Early cryptographic techniques were simple and relied on basic arithmetic operations:

• Caesar Cipher: A substitution cipher that shifts each letter by a fixed number of
places.

• Vigenère Cipher: An improvement over the Caesar cipher using a keyword to

determine shifts.

2.3.2 Transition to Modern Cryptography

The development of more advanced mathematical theories led to the transition from
classical to modern cryptography. Key milestones include:

• Shannon’s Theory of Secrecy: Claude Shannon introduced the concept of per-

fect secrecy in 1949, laying the groundwork for modern cryptography.

• Public-Key Cryptography: In 1976, Diffie and Hellman proposed the concept

of public-key cryptography, revolutionizing secure communication.

2.4 Foundational Concepts for Modern Cryptogra-

phy
2.4.1 Discrete Logarithms
The discrete logarithm problem (DLP) is a cornerstone of modern cryptography. Given
g, y, and p, finding x such that g x ≡ y (mod p) is computationally hard.

2.4.2 Elliptic Curves

Elliptic curves over finite fields provide the basis for Elliptic Curve Cryptography (ECC).
Their structure allows for secure key exchange with smaller key sizes compared to RSA.

5
Chapter 3

Core Concepts in Cryptography

This chapter categorizes cryptographic systems into symmetric, asymmetric, and hash-
based techniques. Each type is explained with its mathematical foundation, applications,
and example problems with solutions for practical understanding.

3.1 Types of Cryptography

Cryptography can be classified based on the keys used, their purpose, and the methods
employed.

3.2 Symmetric Key Cryptography

Symmetric key cryptography uses the same key for both encryption and decryption,
making it an efficient and widely used method for secure communication.

Overview In symmetric cryptography, the sender and receiver must share a secret key
securely before communication begins. The security of the system depends on the secrecy
of the key, as anyone with access to it can decrypt the encrypted data.

Advantages

• Fast and efficient, especially for large volumes of data.

• Requires less computational power compared to asymmetric cryptography.

Challenges

• Secure key distribution is a critical challenge.

• Not scalable for systems with many users due to the need for unique keys between
each pair of users.

6
Examples of Symmetric Algorithms

• Advanced Encryption Standard (AES): Operates on 128-bit blocks with key

sizes of 128, 192, or 256 bits. Widely used in secure communications.

• Data Encryption Standard (DES): A legacy algorithm that encrypts 64-bit

blocks using a 56-bit key. Considered insecure today due to vulnerability to brute-
force attacks.

• Blowfish: A fast, general-purpose encryption algorithm.

Applications

• Securing stored data, such as in encrypted databases.

• Network communication protocols, such as HTTPS and VPNs.

• Encrypting files and emails.

Detailed Example: AES Encryption AES (Advanced Encryption Standard) is a

symmetric key encryption algorithm widely used for secure data transmission. Below is
a detailed example of encrypting the plaintext ”HELLO” using AES with a 128-bit key
”SECRETKEY1234567”:

• Step 1: Convert plaintext to binary: Each character is converted to its ASCII

binary equivalent.

• Step 2: Key Expansion: Generate round keys using the provided 128-bit key.

• Step 3: Initial AddRoundKey: XOR the plaintext block with the initial round
key.

• Step 4: Perform Rounds: Apply SubBytes, ShiftRows, MixColumns, and Ad-

dRoundKey for each round.

• Step 5: Final Ciphertext: After the final round, the output is the encrypted
ciphertext.

3.2.1 Advanced Symmetric Cryptography

3.2.2 Block Cipher Modes of Operation
Block cipher modes define how encryption algorithms process data securely. Since block
ciphers work on fixed-size blocks, these modes determine how larger messages are en-
crypted while ensuring security. Below are the common modes:

7
Electronic Codebook (ECB)
• Encryption: Each plaintext block is encrypted independently:
Ci = EK (Pi ) (3.1)

• Decryption: Each ciphertext block is decrypted separately:

Pi = DK (Ci ) (3.2)

• Drawback: Identical plaintext blocks produce identical ciphertexts, making it

insecure for large data. Patterns in plaintext can be visible in ciphertext.

Cipher Block Chaining (CBC)

• Encryption: Each plaintext block is XORed with the previous ciphertext block
before encryption:
Ci = EK (Pi ⊕ Ci−1 ) (3.3)
• Decryption: Ciphertext blocks are decrypted and XORed with the previous ci-
phertext to retrieve plaintext:
Pi = DK (Ci ) ⊕ Ci−1 (3.4)

• Benefit: Each ciphertext block depends on all previous blocks, making patterns
harder to detect.

Counter Mode (CTR)

• Encryption: Instead of chaining, CTR mode uses a counter value encrypted with
the key, then XORed with the plaintext:
Ci = Pi ⊕ EK (nonce||counteri ) (3.5)

• Benefit: Allows parallel processing since encryption of different blocks does not
depend on previous blocks.

3.2.3 Advanced Block Cipher Design

Block ciphers rely on structures to enhance security and efficiency. Two fundamental
structures are:

Substitution-Permutation Networks (SPN)

• Uses multiple layers of substitution (confusion) and permutation (diffusion) to
strengthen security.
• Key principles:
– Linear algebra is used to analyze how diffusion spreads changes across the
data.
– S-boxes (Substitution Boxes) add non-linearity to resist attacks.
– Avalanche effect ensures small input changes cause large output changes.

8
Feistel Networks

• A fundamental design used in many block ciphers, such as DES.

• Key principles:

– Invertibility: Encryption and decryption use the same structure, simplifying

implementation.
– Round functions: Repeated application of simple functions enhances secu-
rity.
– Security depends on the number of rounds: More rounds provide stronger
security.

3.2.4 Mathematical Analysis of AES

The Advanced Encryption Standard (AES) is a symmetric key cryptographic algorithm
that relies on mathematical transformations to ensure security. This section provides a
detailed examination of two key operations in AES: the SubBytes transformation and the
MixColumns operation.

SubBytes Transformation The SubBytes transformation is a non-linear byte sub-

stitution step that provides confusion in AES. This step operates on each byte of the
state independently using an S-box (substitution box), which is derived from finite field
arithmetic.

Field Theory in S-box Construction The S-box is constructed using properties

from Galois fields (GF (28 )). The transformation involves:

• Finding the multiplicative inverse of each byte in GF (28 ), excluding 0.

• Applying an affine transformation over GF (2) to the obtained inverse.

• Ensuring that the resulting S-box provides strong non-linearity and resistance against
differential and linear cryptanalysis.

Multiplicative Inverse in GF (28 ) Each byte in AES is treated as an element in the

finite field GF (28 ). The inverse of a byte x is computed using modular arithmetic under
an irreducible polynomial, typically x8 + x4 + x3 + x + 1. This step enhances security by
making the transformation non-linear.

Affine Transformation Matrix After computing the inverse in GF (28 ), an affine

transformation is applied to further increase diffusion. This transformation consists of
matrix multiplication over GF (2) with a constant matrix, followed by an addition with a
constant vector. The affine transformation ensures that no output bit is a simple linear
function of input bits, enhancing cryptographic strength.

MixColumns Operation The MixColumns operation is a linear diffusion step in AES

that ensures the influence of one byte spreads across multiple bytes of the state. This is
achieved using matrix multiplication in GF (28 ).

9
Matrix Multiplication Over GF (28 ) MixColumns treats each column of the state
matrix as a polynomial over GF (28 ) and multiplies it by a fixed polynomial modulo x4 +1.
This is represented as:    
02 03 01 01 a0
01 02 03 01 a1 
01 01 02 03 × a2  (3.6)
   

03 01 01 02 a3
where multiplication is performed in GF (28 ).

Proof of Maximum Distance Separable (MDS) Property The MixColumns

transformation ensures maximum diffusion by making the AES state matrix behave as
an MDS (Maximum Distance Separable) code. This means that any small input differ-
ence propagates to multiple bytes in the output, providing resistance against differential
and linear cryptanalysis. The proof relies on properties of determinant calculations in
GF (28 ), ensuring that the transformation matrix has full rank and guarantees optimal
diffusion.
This mathematical foundation strengthens AES against attacks and contributes to its
robustness as a modern symmetric encryption standard.

10
3.3 Asymmetric Key Cryptography
Asymmetric key cryptography uses a pair of keys: a public key for encryption and a
private key for decryption.

Overview In this method, the public key can be freely shared, while the private key
remains confidential. Messages encrypted with the public key can only be decrypted by
the corresponding private key, and vice versa. This eliminates the need for a shared secret
key.

Advantages

• Eliminates the need for secure key distribution.

• Enables digital signatures, providing authentication and non-repudiation.

Challenges

• Slower than symmetric key cryptography due to higher computational requirements.

• Relies on the difficulty of mathematical problems, such as factorization or discrete

logarithms, for security.

Examples of Asymmetric Algorithms

• RSA: Based on the difficulty of factorizing large composite numbers.

• Elliptic Curve Cryptography (ECC): Provides similar security to RSA with

smaller key sizes.

• Diffie-Hellman Key Exchange: Enables secure key exchange over an untrusted

network.

3.3.1 Advanced Asymmetric Cryptography

3.3.2 Mathematical Foundations of RSA
The RSA cryptosystem is one of the most widely used asymmetric encryption methods.
It relies on fundamental number theory principles and computationally difficult problems.

Number Theory Foundations RSA security is based on several number-theoretic

concepts that ensure its cryptographic strength:

• Prime Number Theorem and Distribution: The Prime Number Theorem

describes the asymptotic distribution of prime numbers. The selection of large
prime numbers is crucial in RSA encryption to generate secure keys.

• Chinese Remainder Theorem (CRT) Applications: The CRT is used to

optimize RSA decryption by breaking down computations into smaller modular
arithmetic problems, significantly improving efficiency.

11
 • Euler’s Totient Function Properties: Euler’s totient function, ϕ(n), determines
the number of integers less than n that are coprime to n. It plays a key role in
computing the RSA private key.

Security Proofs RSA security is underpinned by mathematical proofs and complexity

assumptions:

• Reduction to Factoring Problem: The primary security assumption of RSA is

that factoring a large semiprime (a product of two large prime numbers) is compu-
tationally infeasible.

• Probabilistic Primality Testing: Efficient algorithms, such as the Miller-Rabin

and AKS tests, are used to verify the primality of numbers, ensuring secure key
generation.

• Analysis of Common Attacks: RSA is vulnerable to certain attacks, such as

brute-force attacks, side-channel attacks, and chosen-ciphertext attacks. Secure
implementations mitigate these risks using padding schemes like OAEP.

3.3.3 Elliptic Curve Cryptography (ECC)

Elliptic Curve Cryptography (ECC) offers stronger security than traditional RSA with
smaller key sizes. It relies on the algebraic structure of elliptic curves over finite fields.

Curve Theory

• Weierstrass Form: Elliptic curves are defined by the equation:

y 2 = x3 + ax + b

This equation determines the set of valid points used in cryptographic computations.

• Group Law Derivation: The set of points on an elliptic curve forms an abelian
group under point addition. The security of ECC relies on the difficulty of the
Elliptic Curve Discrete Logarithm Problem (ECDLP).

• Point at Infinity Analysis: The point at infinity serves as the identity element
in elliptic curve arithmetic, making it essential for defining group operations.

Field Operations

• Point Addition Formulas: Given two points P and Q on an elliptic curve, their
sum is computed using algebraic formulas that maintain group properties.

• Scalar Multiplication Algorithms: The core cryptographic operation in ECC

is scalar multiplication, where a point P is multiplied by an integer k. Efficient
algorithms like the double-and-add method are used.

• Montgomery Ladder Implementation: The Montgomery ladder is an efficient

method for scalar multiplication, improving resistance to side-channel attacks.

12
Security Analysis

• Discrete Logarithm Problem (DLP): ECC security is based on the difficulty

of solving the discrete logarithm problem on elliptic curves, which is significantly
harder than integer factorization in RSA.

• MOV Attack Consideration: The Menezes-Okamoto-Vanstone (MOV) attack

maps the ECDLP to the easier discrete logarithm problem in a finite field, requiring
careful curve selection to prevent vulnerabilities.

• Pohlig-Hellman Algorithm: This algorithm exploits weak curves where the or-
der of the group has small prime factors, making ECC key selection critical.

3.3.4 Lattice-Based Cryptography

Lattice-based cryptography is a promising post-quantum cryptographic approach that
relies on the hardness of certain lattice problems, making it resistant to attacks from
quantum computers.

Lattice Fundamentals

• Definition and Basis Representation: A lattice is a discrete set of points in

n-dimensional space defined by integer linear combinations of basis vectors. It is
fundamental to many cryptographic constructions.

• Gram-Schmidt Orthogonalization: The Gram-Schmidt process is used to trans-

form lattice bases into orthogonal bases, aiding in solving lattice problems.

• LLL Reduction Algorithm: The Lenstra-Lenstra-Lovász (LLL) algorithm is a

polynomial-time method for lattice basis reduction. It is used both for cryptanalysis
and to improve the efficiency of lattice-based encryption schemes.

Learning With Errors (LWE) The Learning With Errors (LWE) problem is a fun-
damental problem in lattice-based cryptography, serving as the basis for many encryption
and signature schemes.

• Mathematical Formulation: The LWE problem involves solving a system of

linear equations perturbed by small random errors. It is considered computationally
hard even for quantum computers.

• Hardness Reduction Proofs: LWE has been proven to be at least as hard as

certain worst-case lattice problems, ensuring its strong security foundation.

• Parameter Selection Analysis: Choosing appropriate parameters for LWE-

based cryptosystems is crucial to balancing security and efficiency, particularly in
post-quantum encryption.

13
Detailed Example: RSA Encryption and Decryption RSA is a widely used asym-
metric algorithm. Below is an example:

• Step 1: Key Generation:

– Select two prime numbers, p = 61 and q = 53.

– Compute n = p · q = 3233 and ϕ(n) = (p − 1)(q − 1) = 3120.
– Choose e = 17 (public exponent).
– Compute d, the modular inverse of e modulo ϕ(n), which is 2753.

• Step 2: Encryption: To encrypt a message M = 65:

– Compute C = M e mod n = 6517 mod 3233 = 2790.

• Step 3: Decryption: To decrypt C = 2790:

– Compute M = C d mod n = 27902753 mod 3233 = 65.

3.3.5 Comparison of Symmetric and Asymmetric Cryptography

Feature Symmetric Asymmetric

Key Usage Single shared key Public and private key pair
Speed Faster Slower
Scalability Less scalable More scalable

Table 3.1: Comparison of Symmetric vs. Asymmetric Cryptography.

14
3.4 Hash Functions
Hash functions are a type of cryptographic algorithm that converts input data into a
fixed-length hash value, which represents the data uniquely.

Overview Unlike encryption, hash functions are one-way operations that do not require
a key. They are used to ensure data integrity and are a fundamental component of digital
signatures.

Key Properties of Hash Functions

• Deterministic: The same input always produces the same hash.

• Fast Computation: Hashes can be computed quickly for any data size.

• Preimage Resistance: It is computationally infeasible to deduce the original

input from its hash.

• Collision Resistance: It is difficult to find two distinct inputs with the same hash.

Examples of Hash Algorithms

• SHA-256: A secure and widely used hash function producing 256-bit hashes.

• MD5: Once popular, but now considered insecure due to vulnerabilities.

• SHA-3: The latest member of the Secure Hash Algorithm family.

Applications

• Data integrity verification, such as verifying file downloads.

• Password storage in secure systems.

• Blockchain systems for linking and validating blocks of data.

Detailed Example: Hash Verification Given the message ”HELLO”:

• Compute the SHA-256 hash of ”HELLO”:

185F8DB32271FE25F561A6FC938B2E264306EC304EDA518007D1764826381969

• Modify the message to ”HELLO!” and compute the hash:

334D6A9EDC290BCE9A65221AA4F5F6F5E7C5E70C5EB8FA4A84E266BF73B8B7E1

• Observe that even a small change in the input drastically alters the hash output,
ensuring data integrity.

15
3.4.1 Advanced Hash Functions
Hash functions play a critical role in cryptographic security, ensuring data integrity and
authentication. This section delves into advanced properties and construction methods
of cryptographic hash functions.

3.4.2 Mathematical Properties

Formal analysis of hash functions includes rigorous mathematical proofs and security
considerations.

Collision Resistance A cryptographic hash function is collision-resistant if it is in-

feasible to find two distinct inputs, x and y, such that H(x) = H(y). This property is
crucial for digital signatures and data integrity.

• Birthday paradox application: Due to the birthday bound, a hash function with
n-bit output has a collision probability of approximately 2−n/2 . This highlights the
need for sufficiently large hash sizes.
• Probability bounds: The probability of a collision occurring can be analyzed us-
ing probability theory, leading to recommendations for secure hash output lengths.
• Random oracle model: In theoretical cryptography, hash functions are often
modeled as random oracles, providing an idealized abstraction that aids in security
proofs.

Preimage Resistance A hash function is preimage-resistant if, given a hash output

y, it is computationally infeasible to find an input x such that H(x) = y. This ensures
security against brute-force attacks.

• Mathematical definitions: Preimage resistance is formally defined based on com-

putational hardness assumptions.
• Relationship to one-way functions: Hash functions are closely related to one-
way functions, which are easy to compute but difficult to invert.
• Security reductions: Security proofs often involve reductions to known hard
problems, demonstrating that breaking preimage resistance is as hard as solving an
established computational problem.

3.4.3 Construction Methods

Hash function construction techniques influence security properties and resistance to
attacks. Two primary constructions are discussed below.

Merkle-Damgård Construction A foundational approach to building cryptographic

hash functions, the Merkle-Damgård construction processes data in fixed-size blocks and
uses a compression function to iteratively compute the hash.

• Security proof : The construction ensures that if the underlying compression func-
tion is collision-resistant, then the resulting hash function is also collision-resistant.

16
 • Length extension vulnerability: The construction is susceptible to length exten-
sion attacks, where an attacker can compute H(m||p) from H(m) without knowing
m.

• Domain extension theorem: This theorem ensures that the Merkle-Damgård

construction can securely process variable-length inputs by repeatedly applying the
compression function.

Sponge Construction The sponge construction, used in SHA-3, provides a different

paradigm for designing cryptographic hash functions, offering better resistance to certain
attacks.

• State and capacity analysis: A sponge function uses an internal state divided
into a ”rate” and a ”capacity.” The rate determines how much data is absorbed or
squeezed per iteration, while the capacity affects resistance to cryptanalysis.

• Security bounds: The security of a sponge function is determined by the size of

its capacity, ensuring robustness against preimage and collision attacks.

• Application in SHA-3: The Keccak algorithm, forming the basis of SHA-3,

leverages a sponge construction to enhance security while maintaining efficiency.

17
3.5 Post-Quantum Cryptography
Lattice-Based Cryptography Lattice-based cryptography is a promising area for
post-quantum security due to its resistance to quantum attacks.

Lattice Fundamentals
• Definition: A lattice is a set of points in n-dimensional space with a periodic struc-
ture, defined by integer linear combinations of basis vectors.
• Basis representation: A lattice can have multiple equivalent bases, with some being
more efficient than others for computational purposes.
• Gram-Schmidt orthogonalization: A process to convert a basis into an orthogonal
form for easier computation.

Learning With Errors (LWE)

• Problem statement: Given a matrix A and a noisy vector b, find the vector x such
that Ax + e = b (mod q), where e is a small error vector.
• Hardness: The problem is as hard as solving certain worst-case lattice problems.
• Cryptographic applications: LWE is used to construct secure encryption schemes
and key exchanges.

Challenges: Transitioning to post-quantum cryptography involves redesigning al-

gorithms while maintaining compatibility with existing systems.

3.5.1 Code-Based Cryptography

Code-based cryptography uses error-correcting codes for secure communication.

McEliece Cryptosystem
• Based on the difficulty of decoding a general linear code.
• Public key: A generator matrix of a scrambled and permuted error-correcting code.
• Private key: The original code and permutation used for scrambling.

Advantages
• Proven security against quantum attacks.
• Efficient encryption and decryption processes.

Disadvantages
• Large key sizes compared to traditional cryptosystems.
• Less adoption in practical systems.

18
Chapter 4

Applications and Algorithms in Cryp-

tography

This chapter delves into the practical applications and implementations of cryptographic
algorithms. It highlights how cryptographic principles are applied in real-world scenarios,
followed by detailed steps for implementing key algorithms.

4.1 Applications of Cryptography

Cryptography forms the backbone of modern security systems. Its applications span
multiple domains, ensuring confidentiality, integrity, authenticity, and non-repudiation.

4.1.1 Secure Communication

Secure communication protocols, such as SSL/TLS, use cryptographic techniques to pro-
tect data exchanged over the internet.

• Encryption: Ensures that data transferred between clients and servers is protected
from eavesdropping.

• Authentication: Digital certificates validate the identity of servers and, in some

cases, clients.

• Examples: Online banking, email encryption, and instant messaging.

4.1.2 Blockchain Technology

Blockchain relies heavily on cryptography to secure transactions and maintain the in-
tegrity of data.

• Hash Functions: Used to link blocks together securely by generating a unique

identifier for each block.

• Digital Signatures: Ensure the authenticity and non-repudiation of transactions.

• Examples: Cryptocurrencies like Bitcoin and Ethereum.

19
4.1.3 Data Storage and Privacy
Cryptography is employed to protect sensitive data stored in databases and cloud envi-
ronments.

• File Encryption: Protects files from unauthorized access.

• Access Control: Implements role-based encryption to limit data visibility based

on user permissions.

• Examples: GDPR compliance and encrypted cloud storage.

4.1.4 Authentication Systems

Authentication systems utilize cryptography to verify identities securely.

• Passwords: Stored as cryptographic hashes to prevent retrieval in plaintext.

• Biometrics: Use cryptographic methods to match fingerprints, retinal scans, or

facial recognition data.

• Multi-Factor Authentication (MFA): Combines several cryptographic methods

to enhance security.

4.1.5 Digital Rights Management (DRM)

DRM uses cryptography to protect copyrighted materials such as music, movies, and
eBooks from piracy.

• Encryption: Ensures that only authorized users can access the content.

• Licensing: Verifies user permissions to use the content.

• Examples: Streaming platforms like Netflix and Spotify.

20
4.2 Key Cryptographic Algorithms
This section provides step-by-step explanations of important cryptographic algorithms,
emphasizing their mathematical foundations and practical implementations.

4.2.1 RSA Algorithm

RSA is a widely used asymmetric algorithm for secure data transmission. It relies on the
mathematical difficulty of factorizing large composite numbers.

Key Generation:

• Select two large prime numbers, p and q.

• Compute n = p · q and ϕ(n) = (p − 1)(q − 1).

• Choose a public key exponent e such that 1 < e < ϕ(n) and gcd(e, ϕ(n)) = 1.

• Compute the private key d such that d · e ≡ 1 (mod ϕ(n)).

Encryption:

• Represent the plaintext message M as an integer such that 0 ≤ M < n.

• Compute the ciphertext C = M e mod n.

Decryption:

• Compute the original message M = C d mod n.

Example: Let p = 61, q = 53, and e = 17.

• n = p · q = 3233.

• ϕ(n) = (p − 1)(q − 1) = 3120.

• d = 2753, calculated as the modular inverse of e modulo ϕ(n).

• Encrypt M = 65: C = 6517 mod 3233 = 2790.

• Decrypt C = 2790: M = 27902753 mod 3233 = 65.

21
4.2.2 AES Algorithm
AES is a symmetric key algorithm widely used for encrypting data.

Key Features:

• Operates on a fixed block size of 128 bits.

• Supports key sizes of 128, 192, or 256 bits.

• Uses substitution-permutation operations for secure encryption.

Steps:

• Key Expansion: Derive round keys from the original key.

• Initial Round: AddRoundKey operation.

• Main Rounds: Includes SubBytes, ShiftRows, MixColumns, and AddRoundKey.

• Final Round: Similar to main rounds but excludes MixColumns.

Example: Encrypt the plaintext ”HELLO” using a 128-bit key. Convert the plaintext
to binary, apply the AES steps, and produce the ciphertext. For simplicity, tools like
Python’s cryptography library can be used for practical implementation.

22
4.2.3 Elliptic Curve Cryptography (ECC)
ECC is a public-key cryptography system that provides high security with smaller key
sizes compared to RSA.

Key Features:

• Based on the algebraic structure of elliptic curves over finite fields.

• Offers faster computations and lower resource requirements.

Steps:

• Define the elliptic curve y 2 = x3 + ax + b mod p, where p is a prime.

• Choose a base point G on the curve.

• Generate a private key k, and compute the public key P = k · G.

Example: Let the curve be y 2 = x3 + 2x + 3 mod 97, and G = (3, 6). If k = 20:

• Public key P = 20 · G is computed using point addition on the curve.

• This public key is then used for encryption and key exchange.

4.2.4 Diffie-Hellman Key Exchange

The Diffie-Hellman algorithm allows two parties to securely exchange a secret key over
an insecure channel.

Steps:

• Agree on a large prime p and a generator g.

• Each party chooses a private key a and b.

• Compute public keys A = g a mod p and B = g b mod p.

• Exchange public keys and compute the shared secret: s = B a mod p = Ab mod p.

Example: Let p = 23, g = 5, a = 6, and b = 15.

• A = 56 mod 23 = 8.

• B = 515 mod 23 = 19.

• Shared secret: s = 196 mod 23 = 2.

23
Chapter 5

Emerging Trends and Future Direc-

tions in Cryptography

This chapter explores the latest advancements in cryptography, the challenges posed
by emerging technologies such as quantum computing, and future directions in the field.
Cryptography must continually evolve to address new threats while maintaining efficiency
and security.

5.1 Post-Quantum Cryptography

Post-quantum cryptography (PQC) refers to cryptographic algorithms designed to be
secure against the computational power of quantum computers. Quantum computers can
potentially break widely used algorithms such as RSA and ECC by leveraging algorithms
like Shor’s algorithm.

5.1.1 Key Concepts in Post-Quantum Cryptography

• Lattice-Based Cryptography: Relies on problems such as the Shortest Vector
Problem (SVP) and Learning With Errors (LWE), which remain hard for quantum
computers.

• Hash-Based Cryptography: Builds secure digital signatures using cryptographic

hash functions.

• Code-Based Cryptography: Utilizes error-correcting codes, such as the McEliece

cryptosystem.

• Multivariate Cryptography: Based on solving systems of multivariate polyno-

mial equations, which are computationally intensive for both classical and quantum
computers.

5.1.2 Challenges and Implementation

• Ensuring efficiency and practicality of PQC algorithms for real-world applications.

• Standardization efforts led by organizations such as NIST to evaluate and adopt

secure algorithms.

24
 • Transitioning existing systems to quantum-resistant algorithms without disrupting
operations.

5.1.3 Applications of Post-Quantum Cryptography

• Securing government and military communications against future quantum attacks.

• Protecting blockchain systems and cryptocurrency wallets.

• Ensuring long-term security for sensitive data, such as health and financial records.

25
5.2 Homomorphic Encryption
Homomorphic encryption (HE) allows computations to be performed directly on en-
crypted data without decrypting it, ensuring privacy during data processing.

5.2.1 Types of Homomorphic Encryption

• Partially Homomorphic Encryption (PHE): Supports a single type of opera-
tion (addition or multiplication).

• Somewhat Homomorphic Encryption (SHE): Supports limited computations

before decryption becomes necessary.

• Fully Homomorphic Encryption (FHE): Enables arbitrary computations on

encrypted data.

5.2.2 Applications of Homomorphic Encryption

• Cloud Computing: Perform computations on encrypted data stored in the cloud
without revealing the data to service providers.

• Secure Voting: Allow secure and private vote tallying while maintaining voter
confidentiality.

• Healthcare: Process encrypted medical data for analysis without compromising

patient privacy.

5.2.3 Challenges in Homomorphic Encryption

• High computational overhead compared to traditional encryption methods.

• Ensuring scalability for large-scale applications.

• Developing efficient implementations for practical use cases.

26
5.3 Zero-Knowledge Proofs (ZKP)
Zero-knowledge proofs allow one party to prove to another that a statement is true
without revealing any additional information beyond the validity of the statement.

5.3.1 Types of Zero-Knowledge Proofs

• Interactive Zero-Knowledge Proofs: Require interaction between the prover
and verifier.

• Non-Interactive Zero-Knowledge Proofs: Do not require interaction and rely

on a common reference string.

5.3.2 Applications of Zero-Knowledge Proofs

• Blockchain Privacy: Enable private transactions without revealing transaction
details.

• Authentication: Prove identity without sharing passwords or personal details.

• Regulatory Compliance: Demonstrate adherence to regulations without disclos-

ing sensitive data.

5.3.3 Challenges in Zero-Knowledge Proofs

• Complexity of designing efficient zero-knowledge protocols.

• Balancing security with computational performance.

• Ensuring compatibility with existing systems.

27
5.4 Future Directions in Cryptography
As technology advances, cryptography must address emerging challenges and leverage
new opportunities. Key future directions include:

5.4.1 Integration with Artificial Intelligence (AI)

• AI-driven cryptanalysis to test the robustness of cryptographic systems.

• Using AI to develop adaptive and resilient encryption methods.

5.4.2 Quantum-Resistant Protocols

• Research into algorithms resistant to both classical and quantum attacks.

• Developing hybrid systems that combine classical and post-quantum cryptography.

5.4.3 IoT and Lightweight Cryptography

• Designing efficient cryptographic solutions for resource-constrained IoT devices.

• Ensuring security in large-scale IoT networks.

5.4.4 Decentralized Cryptographic Systems

• Leveraging blockchain technology for decentralized identity and data management.

• Enhancing privacy in decentralized finance (DeFi) systems.

5.4.5 Ethical Considerations and Privacy

• Balancing security with user privacy in surveillance systems.

• Addressing ethical concerns in the use of cryptographic technologies.

Conclusion: The field of cryptography is at a pivotal moment, with new technologies

offering both opportunities and challenges. By staying at the forefront of research and
innovation, cryptography will continue to protect data and enable secure communication
in an increasingly digital world.

28
Chapter 6

Conclusion and Future Scope

Cryptography has evolved significantly from its historical roots to become a cornerstone of
modern security. This chapter summarizes the key points covered in the report, highlights
the importance of cryptography in contemporary society, and explores the scope for future
advancements.

6.1 Summary of Key Points

This report has provided a comprehensive overview of cryptography, encompassing its
mathematical foundations, core concepts, applications, and emerging trends. Key points
include:

• Mathematical Foundations: Topics such as number theory, modular arithmetic,

and algebraic structures form the basis of cryptographic algorithms.

• Core Cryptographic Techniques: Symmetric and asymmetric key cryptogra-

phy, hash functions, and their practical applications in securing communication and
data.

• Applications: Real-world use cases of cryptography, including secure communi-

cation protocols, blockchain, and authentication systems.

• Emerging Trends: Post-quantum cryptography, homomorphic encryption, and

zero-knowledge proofs represent the future of cryptographic innovation.

6.2 Significance of Cryptography

Cryptography plays an indispensable role in ensuring:

• Data Security: Protecting sensitive information from unauthorized access and

breaches.

• Privacy: Enabling individuals and organizations to maintain confidentiality in an

increasingly digital world.

• Trust in Systems: Building confidence in digital systems through authentication

and integrity checks.

29
 • Support for Emerging Technologies: Facilitating the secure implementation of
technologies like blockchain and IoT.

6.3 Challenges and Limitations

Despite its advancements, cryptography faces several challenges:

• Quantum Threats: The potential of quantum computers to break widely used

cryptographic algorithms.

• Resource Constraints: The need for lightweight cryptographic solutions for IoT
devices and other constrained environments.

• Implementation Risks: Vulnerabilities arising from incorrect implementation or

poor key management.

• Ethical Concerns: Balancing security with user privacy and addressing misuse of
cryptographic systems.

6.4 Future Scope

The field of cryptography is poised for significant advancements. Key areas of develop-
ment include:

• Quantum-Resistant Algorithms: Developing and standardizing algorithms to

secure systems against quantum attacks.

• Advanced Cryptographic Protocols: Enhancing protocols like zero-knowledge

proofs for wider adoption.

• Integration with AI: Leveraging AI to design adaptive cryptographic systems

and detect vulnerabilities.

• Decentralized Systems: Expanding the use of cryptographic techniques in blockchain

and decentralized finance (DeFi).

• Ethical Frameworks: Establishing guidelines to ensure responsible use of cryp-

tographic technologies.

6.5 Closing Remarks

Cryptography is an ever-evolving field that continues to adapt to emerging threats and
technological advancements. Its role in safeguarding digital infrastructure is paramount,
and its future holds immense potential to address challenges and empower secure innova-
tion. By fostering interdisciplinary research and collaboration, cryptography will remain
at the forefront of securing the digital world.

30
Chapter 7

References

Below is the list of references used in this project:

• Stallings, W. (2017). Cryptography and Network Security: Principles and Practice.
Pearson Education.
• Menezes, A. J., Van Oorschot, P. C., & Vanstone, S. A. (1996). Handbook of Applied
Cryptography. CRC Press.
• Schneier, B. (1996). Applied Cryptography: Protocols, Algorithms, and Source Code
in C. John Wiley & Sons.
• Hoffstein, J., Pipher, J., & Silverman, J. H. (2008). An Introduction to Mathemat-
ical Cryptography. Springer.
• Rivest, R. L., Shamir, A., & Adleman, L. (1978). A Method for Obtaining Digital
Signatures and Public-Key Cryptosystems. Communications of the ACM.
• Diffie, W., & Hellman, M. (1976). New Directions in Cryptography. IEEE Trans-
actions on Information Theory.
• Shor, P. W. (1997). Polynomial-Time Algorithms for Prime Factorization and
Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing.
• Singh, S. (1999). The Code Book: The Science of Secrecy from Ancient Egypt to
Quantum Cryptography. Anchor.
• Kahn, D. (1996). The Codebreakers: The Comprehensive History of Secret Com-
munication from Ancient Times to the Internet. Scribner.
• GeeksforGeeks: Tutorials on cryptographic algorithms. https://www.geeksforgeeks.
org
• CryptoPals: Practical cryptography exercises. https://cryptopals.com
• Python Cryptography Documentation. https://cryptography.io
• National Institute of Standards and Technology (NIST): Publications on crypto-
graphic standards. https://www.nist.gov
• Documentation for Python’s pycryptodome library. https://pycryptodome.readthedocs.
io

31