Date of Submission

6-2024

Date of Award

6-24-2025

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Cryptology

Department

Cryptology and Security Research Unit (CSRU-Kolkata)

Supervisor

Rao, Y.V. Subba

Co-Supervisor (if any)

Maitra, Subhamoy

Abstract (Summary of the Work)

Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems. Attractive features of lattice cryptography include apparent resistance to quantum attacks (in contrast with most number-theoretic cryptography), high asymptotic efficiency and parallelism, security under worst-case intractability assumptions, and solutions to long-standing open problems in cryptography. This work surveys the structure, security, and optimization potential of two leading lattice-based cryptographic schemes: ML-KEM (Kyber) and ML-DSA (Dilithium). Special attention is given to their applicability in government-oriented post-quantum cryptographic systems, focusing on performance, implementation considerations, and resilience against known quantum threats. In particular, the study introduces tweaks to implementational-level components—such as encoding, compression, and sampling routines—to enhance efficiency and adaptability. Emphasis is placed on how the underlying Short Integer Solution (SIS) and Learning With Errors (LWE) problems—and their ring-based variants—form the mathematical backbone of these NIST-standardized algorithms.

Control Number

CrS

DOI

https://dspace.isical.ac.in/items/a929c05f-69e0-4821-bacf-6d613c75af41

DSpace Identifier

http://hdl.handle.net/10263/7606

Download

Share

COinS