Sciweavers

6 search results - page 2 / 2
» Permutation polynomials of degree 6 or 7 over finite fields ...
Sort
View
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 9 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