Results 31 to 40 of about 1,573 (212)
Hardness of Module‐LWE with Semiuniform Seeds from Module‐NTRU
The module learning with errors (MLWE) problem has attracted significant attention and has been widely used in building a multitude of lattice‐based cryptographic primitives. The hardness of the MLWE problem has been established for several variants, but most of the known results require the seed distribution (i.e., the distribution of matrix A) to be ...
Wenjuan Jia +3 more
wiley +1 more source
Kyber, Saber, and SK‐MLWR Lattice‐Based Key Encapsulation Mechanisms Model Checking with Maude
Facing the potential threat raised by quantum computing, a great deal of research from many groups and industrial giants has gone into building public‐key post‐quantum cryptographic primitives that are resistant to the quantum attackers. Among them, there is a large number of post‐quantum key encapsulation mechanisms (KEMs), whose purpose is to provide
Duong Dinh Tran +5 more
wiley +1 more source
Improved lattice enumeration algorithms by primal and dual reordering methods
Abstract The security of lattice‐based cryptosystems is generally based on the hardness of the Shortest Vector Problem (SVP). The original enumeration (ENUM) algorithm solving SVP runs in exponential time due to the exhaustive search, which is used as a subroutine for the block Korkin–Zolotarev (BKZ) algorithm.
Kazuki Yamamura +2 more
wiley +1 more source
A Side-Channel Attack on a Hardware Implementation of CRYSTALS-Kyber [PDF]
CRYSTALS-Kyber has been recently selected by the NIST as a new public-key encryption and key-establishment algorithm to be standardized. This makes it important to assess how well CRYSTALS-Kyber implementations withstand side-channel attacks.
Elena Dubrova +4 more
core
Improved lattice‐based mix‐nets for electronic voting
Abstract Mix‐networks were first proposed by Chaum in the late 1970s–early 1980s as a general tool for building anonymous communication systems. Classical mix‐net implementations rely on standard public key primitives (e.g., ElGamal encryption) that will become vulnerable when a sufficiently powerful quantum computer will be built.
Valeh Farzaliyev +2 more
wiley +1 more source
Revisiting the Expected Cost of Solving uSVP and Applications to LWE [PDF]
: Reducing the Learning with Errors problem (LWE) to the Unique-SVP problem and then applying lattice reduction is a commonly relied-upon strategy for estimating the cost of solving LWE-based constructions. In the literature, two different conditions are
Albrecht, Martin +3 more
core +2 more sources
Crystals‐Dilithium is one of the digital‐signature algorithms in NIST’s ongoing post‐quantum cryptography (PQC) standardization final round. Security and computational efficiency concerning software and hardware implementations are the primary criteria for PQC standardization.
Youngbeom Kim +4 more
wiley +1 more source
A Mathematical Perspective on Post-Quantum Cryptography
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
Visual representation of post-quantum cryptographic algorithm Kyber [PDF]
Cryptographic algorithms form the foundation of protocols and applications that ensure confidentiality, integrity, and availability in modern information and communication technologies.
Vujnić Aleksa D. +2 more
doaj +1 more source
We consider the problem of adapting a Post-Quantum cryptosystem to be used in resource-constrained devices, such as those typically used in Device-to-Device and Internet of Things systems.
M. A. Gonzalez de la Torre +3 more
doaj +1 more source

