Sciweavers

Share
6 search results - page 1 / 2
» Cryptographic Applications of Sparse Polynomials over Finite...
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
9 years 19 days ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
9 years 2 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
CAP
2010
8 years 6 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
7 years 1 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily ļ¬nding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
9 years 11 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
books