Results 161 to 170 of about 2,659 (196)

Masking ring-LWE [PDF]

Journal of Cryptographic Engineering, 2016
In this paper, we propose a masking scheme to protect ring-LWE decryption from first-order side-channel attacks. In an unprotected ring-LWE decryption, the recovered plaintext is computed by first performing polynomial arithmetic on the secret key and then decoding the result. We mask the polynomial operations by arithmetically splitting the secret key
Oscar Reparaz, Sujoy Sinha Roy, Frederik Vercauteren   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

High-Throughput Ring-LWE Cryptoprocessors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2017
This paper presents the design of ring learning with errors (LWE) cryptoprocessors using number theoretic transform (NTT) cores and Gaussian samplers based on the inverse transform method. The NTT cores are designed using radix-2 and radix-8 decimation-in-frequency NTT algorithms and pipeline architectures.
Jaime Velasco-Medina
exaly   +2 more sources

Efficient-Scheduling Parallel Multiplier-Based Ring-LWE Cryptoprocessors [PDF]

Electronics (Switzerland), 2019
This paper presents a novel architecture for ring learning with errors (LWE) cryptoprocessors using an efficient approach in encryption and decryption operations. By scheduling multipliers to work in parallel, the encryption and decryption time are significantly reduced.
Tuy Tan Nguyen, Hanho Lee
exaly   +2 more sources

Lossiness and Entropic Hardness for Ring-LWE

2020
The hardness of the Ring Learning with Errors problem (RLWE) is a central building block for efficiency-oriented lattice-based cryptography. Many applications use an “entropic” variant of the problem where the so-called “secret” is not distributed uniformly as prescribed but instead comes from some distribution with sufficient min-entropy. However, the
Brakerski, Zvika, Döttling, Nico
openaire   +1 more source

Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts

2021
In the past few years, significant progress on homomorphic encryption (HE) has been made toward both theory and practice. The most promising HE schemes are based on the hardness of the Learning With Errors (LWE) problem or its ring variant (RLWE). In this work, we present new conversion algorithms that switch between different (R)LWE-based HE schemes ...
Hao Chen, Wei Dai, Miran Kim, Yongsoo Song   +3 more
openaire   +1 more source

FFT Program Generation for Ring LWE-Based Cryptography

2021
Fast Fourier Transform (FFT) enables an efficient implementation of polynomial multiplication, which is at the core of any cryptographic constructions based on the hardness of the Ring learning with errors (RLWE) problem. Existing implementations of FFT for RLWE-based cryptography rely on hand-written assembly code for performance, making it difficult ...
Masahiro Masuda, Yukiyoshi Kameyama
openaire   +1 more source

Zero Knowledge Proofs from Ring-LWE

2013
Zero-Knowledge proof is a very basic and important primitive, which allows a prover to prove some statement without revealing anything else. Very recently, Jain et al. proposed very efficient zero-knowledge proofs to prove any polynomial relations on bits, based on the Learning Parity with Noise (LPN) problem (Asiacrypt'12).
Xiang Xie, Rui Xue, Minqian Wang
openaire   +1 more source

Ring-LWE Public Key Encryption Processor

2019
In this chapter we analyze the \(\mathtt {LPR}\) ring-LWE public key encryption scheme of Sect. 2.4.1 and design a compact hardware architecture of the encryption processor. From Fig. 2.4 of Sect. 2.4.1, we see that the \(\mathtt {LPR}\) encryption scheme is composed of a discrete Gaussian sampler, a polynomial arithmetic (addition/multiplication) unit,
Sujoy Sinha Roy, Ingrid Verbauwhede
openaire   +1 more source

???????????? ?????????????????? ???????????????????????? ?????????????????????? Ring-LWE ???????????????????????? ?????????? ?? ?????????????????? ???????????????? ??????????????

2023
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire   +1 more source