Sciweavers

6 search results - page 1 / 2
» Permutation polynomials of degree 6 or 7 over finite fields ...
Sort
View
MOC
1998
98views more  MOC 1998»
13 years 5 months ago
Distribution of irreducible polynomials of small degrees over finite fields
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
Kie H. Ham, Gary L. Mullen
CAP
2010
13 years 23 days 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
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 6 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 7 months 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,...