Tensor-based trapdoors for CVP and their application to public key cryptography [PDF]
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product.
Fischlin, Roger, Seifert, Jean-Pierre
core +2 more sources
Ring Learning With Errors: A crossroads between postquantum cryptography, machine learning and number theory [PDF]
The present survey reports on the state of the art of the different cryptographic functionalities built upon the ring learning with errors problem and its interplay with several classical problems in algebraic number theory.
Chacón, Iván Blanco
core +2 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
Lattice-Based proof of a shuffle [PDF]
In this paper we present the first fully post-quantum proof of a shuffle for RLWE encryption schemes. Shuffles are commonly used to construct mixing networks (mix-nets), a key element to ensure anonymity in many applications such as electronic voting ...
Costa, Nuria +2 more
core +1 more source
Physical Protection of Lattice-Based Cryptography [PDF]
The impending realization of scalable quantum computers will have a significant impact on today's security infrastructure. With the advent of powerful quantum computers public key cryptographic schemes will become vulnerable to Shor's quantum algorithm, undermining the security current communications systems.
Khalid, Ayesha +5 more
openaire +3 more sources
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
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 new exact closest lattice point search algorithm using linear constraints [PDF]
The problem of finding the closest lattice point arises in several communications scenarios and is known to be NP-hard. We propose a new closest lattice point search algorithm which utilizes a set of new linear inequality constraints to reduce the search
Hassibi, Babak, Xu, Weiyu
core +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

