Results 161 to 170 of about 523,712 (192)
High Efficiency Ring-LWE Cryptoprocessor Using Shared Arithmetic Components
Electronics (Switzerland), 2020 A high efficiency architecture for ring learning with errors (ring-LWE) cryptoprocessor using shared arithmetic components is presented in this paper.
Tuy Tan Nguyen +2 more
exaly +2 more sources
An Experimental Analysis on Lattice Attacks against Ring-LWE over Decomposition Fields [PDF]
, 2018 The ring variant of learning with errors (Ring-LWE) problem has provided efficient post-quantum cryptographic schemes including homomorphic encryption (HE) schemes.
Atsuko Miyaji
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
High-Throughput Ring-LWE Cryptoprocessors
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2017This 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.
Claudia Patricia Renteria-Mejia +1 more
openaire +1 more source
FFT Program Generation for Ring LWE-Based Cryptography
2021Fast 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
Large Modulus Ring-LWE $$\ge $$ Module-LWE
2017We present a reduction from the module learning with errors problem (MLWE) in dimension \(d\) and with modulus \(q\) to the ring learning with errors problem (RLWE) with modulus \(q^{d}\). Our reduction increases the LWE error rate \(\alpha \) by a quadratic factor in the ring dimension \(n\) and a square root in the module rank \(d\) for power-of-two ...
Martin R. Albrecht, Amit Deo
openaire +2 more sources
A lattice-based digital signature from the Ring-LWE
2012 3rd IEEE International Conference on Network Infrastructure and Digital Content, 2012We propose a variant version of ring learning with errors (R-LWE) assumption. Under the modified slightly assumption which is reducible to the worst-case problems on ideal lattice, we present a construction of digital signatures. So the scheme is provably secure based on the hardness of lattice problems (such as approximating the length of the shortest
Yanfang Wu +3 more
openaire +1 more source
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
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
Zero Knowledge Proofs from Ring-LWE
2013Zero-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 0001, Minqian Wang
openaire +1 more source
Trapdoor function based on the Ring-LWE and applications in communications
Journal of Ambient Intelligence and Humanized Computing, 2018The “strong trapdoor function for lattice” has been constructed by Daniele Micciancio and Chris Peikert in EUROCRYPT 2012, which is simple, efficient, and easy to implement. In this paper, we present a new trapdoor function based on “ring learning with errors” problem (Ring-LWE) on lattice, and simultaneously the corresponding efficient inverse ...
Chengli Zhang +2 more
openaire +1 more source
Integer Version of Ring-LWE and Its Applications
2019In this work, we introduce an integer version of ring-LWE (I-RLWE) over the polynomial rings and present a public key encryption based on I-RLWE. The security of our scheme relies on the computational hardness assumption of the I-RLWE problem.
openaire +2 more sources