Sciweavers

99 search results - page 1 / 20
» Ring-LWE in Polynomial Rings
Sort
View
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 7 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
12 years 4 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
IACR
2011
212views more  IACR 2011»
12 years 4 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
CORR
2007
Springer
101views Education» more  CORR 2007»
13 years 4 months ago
A Matrix Ring Description for Cyclic Convolutional Codes
: In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew ...
Heide Gluesing-Luerssen, Fai-Lung Tsang
ASAP
1995
IEEE
145views Hardware» more  ASAP 1995»
13 years 8 months ago
An array processor for inner product computations using a Fermat number ALU
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, Wil...