Results 41 to 50 of about 59,978 (320)
BAT: Small and Fast KEM over NTRU Lattices
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
Realization Scheme for Visual Cryptography with Computer-generated Holograms [PDF]
We propose to realize visual cryptography in an indirect way with the help of computer-generated hologram. At present, the recovery method of visual cryptography is mainly superimposed on transparent film or superimposed by computer equipment, which greatly limits the application range of visual cryptography.
arxiv
On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography [PDF]
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
Improvements on Making BKW Practical for Solving LWE
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
Indistinguishability under adaptive chosen-ciphertext attack secure double-NTRU-based key encapsulation mechanism [PDF]
In this article, we propose a double-NTRU (D-NTRU)-based key encapsulation mechanism (KEM) for the key agreement requirement of the post-quantum world. The proposed KEM is obtained by combining one-way D-NTRU encryption and Dent’s KEM design method.
Kübra Seyhan, Sedat Akleylek
doaj +2 more sources
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search [PDF]
By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem.
A. Ambainis+39 more
core +2 more sources
Quantum-Resistant Cryptography [PDF]
Quantum-resistant cryptography is cryptography that aims to deliver cryptographic functions and protocols that remain secure even if large-scale fault-tolerant quantum computers are built. NIST will soon announce the first selected public-key cryptography algorithms in its Post-Quantum Cryptography (PQC) standardization which is the most important ...
arxiv
Evaluation of Post-Quantum Distributed Ledger Cryptography
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 Multi-Chain ...
Robert Campbell Sr.
doaj +2 more sources
From Golden to Unimodular Cryptography [PDF]
We introduce a natural generalization of the golden cryptography, which uses general unimodular matrices in place of the traditional Q-matrices, and prove that it preserves the original error correction properties of the encryption. Moreover, the additional parameters involved in generating the coding matrices make this unimodular cryptography ...
arxiv +1 more source
Markov Chain Monte Carlo Algorithms for Lattice Gaussian Sampling
Sampling from a lattice Gaussian distribution is emerging as an important problem in various areas such as coding and cryptography. The default sampling algorithm --- Klein's algorithm yields a distribution close to the lattice Gaussian only if the ...
Hanrot, Guillaume+2 more
core +1 more source