On the Tightness Gap Analysis of Reductions of some Lattice problems to the Learning with Error problem/ Subhadip Singha
Material type:
- 23 005.82 Si617
- Guided by Prof. Palash Sarkar
Item type | Current library | Call number | Status | Notes | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
THESIS | ISI Library, Kolkata | 005.82 Si617 (Browse shelf(Opens below)) | Available | Guided by Prof. Palash Sarkar | TH587 |
Thesis (Ph.D) -Indian Statistical Institute, 2023
Includes bibliography
Introduction -- Preliminaries -- Brief Literature Survey -- Quantum Reduction from GIVP to LWE -- Reduction from module SIVP to module-LWE -- Ring LWE for any Ring and any modulus -- Classical Reduction from SIVP to LWE -- Analysis of Concrete Security -- Conclusion
Guided by Prof. Palash Sarkar
Lattice-based cryptography is a highly regarded contender for post-quantum standardization by NIST. NIST has already chosen “CRYSTALS-KYBER” a lattice-based public-key
encryption and key-establishment algorithm and “CRYSTALS-DILITHIUM”, a lattice-based
digital signature algorithm. The current lattice-based schemes are based on Oded Regev’s
original construction, which sparked significant interest in the cryptographic community
due to its post-quantum security and the equivalence between worst-case and average-case hardness.
There are no comments on this title.