Sciweavers

99 search results - page 12 / 20
» Ring-LWE in Polynomial Rings
Sort
View
DM
2008
112views more  DM 2008»
13 years 8 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
CASC
2009
Springer
103views Mathematics» more  CASC 2009»
14 years 3 months ago
Lazy and Forgetful Polynomial Arithmetic and Applications
We present lazy and forgetful algorithms for adding, multiplying and dividing multivariate polynomials. The lazy property allows us to compute the i-th term of a polynomial withou...
Michael B. Monagan, Paul Vrbik
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 4 days 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
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 2 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
CAP
2010
13 years 3 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