Essays about: "lattice-based cryptography"
Showing result 1 - 5 of 7 essays containing the words lattice-based cryptography.
-
1. A Side-Channel Attack on Masked and Shuffled Implementations of M-LWE and M-LWR Cryptography : A case study of Kyber and Saber
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In response to the threat of a future, large-scale, quantum computer, the American National Institute of Standards and Technology (NIST) initiated a competition for designs of quantum-resistant cryptographic primitives. In 2022, the lattice-based Module-Learning With Errors (M-LWE) scheme Kyber emerged as the winner to be standardized. READ MORE
-
2. Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card
University essay from Linköpings universitet/InformationskodningAbstract : Cyber attacks happen on a daily basis, where criminals can aim to disrupt internet services or in other cases try to get hold of sensitive data. Fortunately, there are systems in place to protect these services. And one can rest assured that communication channels and data are secured under well-studied cryptographic schemes. READ MORE
-
3. Post-Quantum Public Key Cryptography for the Internet of Things
University essay from Högskolan i Halmstad/Akademin för informationsteknologiAbstract : Recent progress in the field of quantum computers provide radically improved muscles to search and sort in lists, solve systems of equations and prime factorize – virtues that inflict an immediate threat to the most common systems for public key cryptography used in a vast proportion of today’s computer networks. NTRUEncrypt is a lattice-based cryptography system which inhibits quantum computers for breaking the algorithm in polynomial time. READ MORE
-
4. Performance analysis of lattice based post-quantum secure cryptography with Java
University essay from Umeå universitet/Institutionen för fysikAbstract : Efficient quantum computers will break most of today’s public-key cryptosystems. Therefore, the National Institute of Standards and Technology (NIST) calls for proposals to standardise one or more quantum-secure cryptographic schemes. READ MORE
-
5. Analysis of Lattice Reduction Algorithms : Solving SVP Challenges
University essay from Linnéuniversitetet/Institutionen för matematik (MA)Abstract : Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally concerned by lattice reduction algorithms, the essential tools in the algorithmicstudy of lattices and its applications. In order to precisely estimate the securityparameters of these cryptosystems, it is a necessity to assess the practical diculty of theshortest vector problem (SVP) by analyzing the known ecient algorithms for solvingit. READ MORE