Checking the equality of two arrays is a crucial building block Fujisaki-Okamoto transformation, and as such it used in several post-quantum key encapsulation mechanisms including Kyber Saber. While this comparison operation easy to perform black box setting, hard efficiently protect against side-channel attacks. For instance, hash-based method by Oder et al. limited first-order masking, higher...

Lattice-based cryptography is one of the most promising areas within post-quantum cryptography, and offers versatile, efficient, and high performance security services. The aim of this paper is to verify the correctness of the discrete Gaussian sampling component, one of the most important modules within lattice-based cryptography. In this paper, the GLITCH software test suite is proposed, whic...

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems. This paper proposes NTRU Prime, which tweaks NTRU to use rin...

Objective: Quantum algorithm are stronger and more secure than the classical computers not because they run on faster harder but also, require fewer steps. With attackers have high computing power with quantum can easily break cryptographic system. Lattice is regularly spaced grid of points stretching to infinity. safe security algorithms resistant both attacks caused by attack computers. based...

Lattice cryptography is one of the hottest and fastest moving areas in mathematical cryptography today. Interest in lattice cryptography is due to several concurring factors. On the theoretical side, lattice cryptography is supported by strong worst-case/average-case security guarantees. On the practical side, lattice cryptography has been shown to be very versatile, leading to an unprecedented...

Most lattice-based cryptographic schemes which enjoy a security proof suffer from huge key sizes and heavy computations. This is also true for the simpler case of identification protocols. Recent progress on ideal lattices has significantly improved the efficiency, and made it possible to implement practical lattice-based cryptography on constrained devices like FPGAs and smart phones. However,...

We present both a hardware and a software implementation variant of the learning with errors (LWE) based cryptosystem presented by Lindner and Peikert. This work helps in assessing the practicality of lattice-based encryption. For the software implementation, we give a comparison between a matrix and polynomial based variant of the LWE scheme. This module includes multiplication in polynomial r...

In this work, we are concerned with the hardening of post-quantum key encapsulation mechanisms (KEM) against side-channel attacks, a focus on comparison operation required for Fujisaki-Okamoto (FO) transform. We identify critical vulnerabilities in two proposals masked and successfully attack algorithms from TCHES 2018 2020. To do so, use first-order attacks show that advertised security proper...

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...