Ideal Lattices in Cryptography

Summarise with VIRAT
Authors: Sára Vyhnalová
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The thesis studies special lattices relevant in cryptography, namely ideal, cyc- lic, and NTRU lattices. It extends the author's Master's thesis by generalising previous results and incorporating corrections and new material. We rene and expand the algorithm for identifying ideal lattices originally proposed by Ding and Lindner, including detailed proofs and examples. A generalised theorem on lattice isomorphisms is also presented. Additionally, we introduce our own sim- plied algorithm for identifying ideal lattices. The thesis also includes a brief discussion of NTRU lattices and their identication. A chapter on cryptogra- phic applications covers lattice problems, a hash function based on ideal lattices, and a brief overview of cryptographic schemes using NTRU lattices. The nal chapter classies all two-dimensional lattices in Hermite normal form according to the existence of a circulant basis. 1

Fields of Study & Subjects

Cryptography and Data Security Cryptography and Residue Arithmetic Coding theory and cryptography

Publication details

Journal / source
Digital Repository (National Repository of Grey Literature)
Publication date
1 January 2026
Language
EN
Document type
Thesis