Browsing Department of Mathematics (MU) by Title "Cryptographic applications of sparse polynomials over finite rings"
Now showing items 1-1 of 1
-
Cryptographic applications of sparse polynomials over finite rings
(2001)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 and identification schemes.