Results 21 to 30 of about 1,123 (152)
Lattice-Based Cryptography [PDF]
We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptographic schemes.
openaire +3 more sources
An Efficient Algorithm for the Shortest Vector Problem
Lattice is widely used in cryptography since it has potential for defending quantum attacks. One of the significant problems in such cryptography is the shortest vector problem (SVP). This problem is to find the non-zero shortest vector in lattice.
Yu-Lun Chuang, Chun-I Fan, Yi-Fan Tseng
doaj +1 more source
Verified NTT Multiplications for NISTPQC KEM Lattice Finalists: Kyber, SABER, and NTRU
Postquantum cryptography requires a different set of arithmetic routines from traditional public-key cryptography such as elliptic curves. In particular, in each of the lattice-based NISTPQC Key Establishment finalists, every state-ofthe-art optimized ...
Vincent Hwang +6 more
doaj +3 more sources
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols
Public key cryptography protocols, such as RSA and elliptic curve cryptography, will be rendered insecure by Shor’s algorithm when large-scale quantum computers are built.
Utsav Banerjee +2 more
doaj +1 more source
Not-so-adiabatic quantum computation for the shortest vector problem
Since quantum computers are known to break the vast majority of currently used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proved, to be safe against quantum attacks.
David Joseph +3 more
doaj +1 more source
PiouCrypt: Decentralized lattice-based method for visual symmetric cryptography
In recent years, establishing secure visual communications has turned into one of the essential problems for security engineers and researchers. However, only limited novel solutions are provided for image encryption, and limiting visual cryptography to ...
Navid Abapour, Mohsen Ebadpour
doaj +1 more source
Higher-Order Masked Ciphertext Comparison for Lattice-Based Cryptography
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
Generic, efficient and isochronous Gaussian sampling over the integers
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
A Survey on Classical Lattice Algorithms
The rapid advancement of quantum computing poses a severe threat to traditional public key cryptosystems. Lattice-based cryptography has emerged as a core candidate for post-quantum cryptography due to its presumed quantum resistance, robust security ...
Tongchen Shen, Xiangxue Li
doaj +1 more source
Security estimation of LWE via BKW algorithms
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

