Results 31 to 40 of about 1,416 (297)
Generic, efficient and isochronous Gaussian sampling over the integers
Cybersecurity, 2022 Gaussian sampling over the integers is one of the fundamental building blocks of lattice-based cryptography. Among the extensively used trapdoor sampling algorithms, it is ineluctable until now. Under the influence of numerous side-channel attacks, it is
Shuo Sun +4 more
doaj +1 more source
Higher-Order Masked Ciphertext Comparison for Lattice-Based Cryptography
Transactions on Cryptographic Hardware and Embedded Systems, 2022 Checking the equality of two arrays is a crucial building block of the Fujisaki-Okamoto transformation, and as such it is used in several post-quantum key encapsulation mechanisms including Kyber and Saber.
Jan-Pieter D’Anvers +4 more
doaj +1 more source
Security estimation of LWE via BKW algorithms
Cybersecurity, 2023 The Learning With Errors (LWE) problem is widely used in lattice-based cryptography, which is the most promising post-quantum cryptography direction. There are a variety of LWE-solving methods, which can be classified into four groups: lattice methods ...
Yu Wei, Lei Bi, Xianhui Lu, Kunpeng Wang
doaj +1 more source
On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography [PDF]
IEEE Transactions on Computers, 2018 Lattice-based cryptography is one of the most promising branches of quantum resilient cryptography, offering versatility and efficiency. Discrete Gaussian samplers are a core building block in most, if not all, lattice-based cryptosystems, and optimised samplers are desirable both for high-speed and low-area applications.
James Howe +4 more
openaire +4 more sources
Evaluation of Post-Quantum Distributed Ledger Cryptography
The Journal of The British Blockchain Association, 2019 This paper evaluates the current cybersecurity vulnerability of the prolific use of Elliptical Curve Digital Signature Algorithm (ECDSA) cryptography in use by the Bitcoin Core, Ethereum, Bitcoin Cash, and enterprise blockchains such as ...
Robert E. Campbell Sr.
doaj +2 more sources
BAT: Small and Fast KEM over NTRU Lattices
Transactions on Cryptographic Hardware and Embedded Systems, 2022 We present BAT – an IND-CCA secure key encapsulation mechanism (KEM) that is based on NTRU but follows an encryption/decryption paradigm distinct from classical NTRU KEMs.
Pierre-Alain Fouque +3 more
doaj +1 more source
Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography [PDF]
Mathematics, 2021 The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP). Various cryptanalysis algorithms such as (Pro)GaussSieve, HashSieve, ENUM, and BKZ have been proposed to solve these hard problems.
Hami Satılmış +2 more
openaire +4 more sources
Improvements on Making BKW Practical for Solving LWE
Cryptography, 2021 The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper presents new improvements of BKW-
Alessandro Budroni +4 more
doaj +1 more source
A Practical View of the State-of-the-Art of Lattice-Based Cryptanalysis
IEEE Access, 2017 This paper describes the lattice problems that are key in the study of lattice-based cryptography, identifies and categorizes methods for solving these problems, analyzes existing implementations of these algorithms, and extrapolates on the future of ...
Artur Mariano +4 more
doaj +1 more source
Gaussian Sampling in Lattice Based Cryptography [PDF]
Tatra Mountains Mathematical Publications, 2014 Abstract Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for sampling from discrete Gaussians. Then we survey the algorithms implementing such sampling and assess their practical performance.
openaire +2 more sources