Results 31 to 40 of about 235 (167)
Hardness of (Semiuniform) MLWE with Short Distributions Using the Rényi Divergence
IET Information Security, Volume 2023, Issue 1, 2023., 2023 The module learning with errors (MLWE) problem has attracted considerable attention for its tradeoff between security and efficiency. The quantum/classical worst‐case to average‐case hardness for the MLWE problem (or more exactly, a family of problems) has been established, but most of the known results require the seed distribution to be the uniform ...
Wenjuan Jia, Baocang Wang, Youwen Zhu
wiley +1 more source
Hardness of Module‐LWE with Semiuniform Seeds from Module‐NTRU
IET Information Security, Volume 2023, Issue 1, 2023., 2023 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
IET Information Security, Volume 2023, Issue 1, 2023., 2023 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
Post-Quantum Authenticated Encryption against Chosen-Ciphertext Side-Channel Attacks
Transactions on Cryptographic Hardware and Embedded Systems, 2022 Over the last years, the side-channel analysis of Post-Quantum Cryptography (PQC) candidates in the NIST standardization initiative has received increased attention.
Melissa Azouaoui +3 more
doaj +3 more sources
Improved lattice enumeration algorithms by primal and dual reordering methods
IET Information Security, Volume 17, Issue 1, Page 35-45, January 2023., 2023 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
Improved lattice‐based mix‐nets for electronic voting
IET Information Security, Volume 17, Issue 1, Page 18-34, January 2023., 2023 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
A side-channel attack on a masked hardware implementation of CRYSTALS-Kyber
Journal of Cryptographic Engineering, 2023 Abstract NIST has recently selected CRYSTALS-Kyber as a new public key encryption and key establishment algorithm to be standardized. This makes it important to evaluate the resistance of CRYSTALS-Kyber implementations to side-channel attacks. Software implementations of CRYSTALS-Kyber have already been thoroughly analysed.
Yanning Ji, Elena Dubrova
openaire +2 more sources
Visual representation of post-quantum cryptographic algorithm Kyber [PDF]
TehnikaCryptographic 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
A Mathematical Perspective on Post-Quantum Cryptography
Mathematics, 2022 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
PACE—Plantard Accelerated CRYSTALS Extensions
IEEE AccessML-KEM (FIPS203) and ML-DSA (FIPS204) were two of the first post quantum cry- ptography schemes to be standardized by the National Institute of Standards and Technology; Both CRYSTALS algorithms utilize modulo reduction, specifically Montgomery reduction.
Ryan Bevin +3 more
doaj +1 more source