Sciweavers

51 search results - page 11 / 11
» icisc 2007
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 10 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,...