• Cryptographic applications of sparse polynomials over finite rings 

    Banks, William David, 1964-; Lieman, Daniel, 1965-; Shparlinski, Igor E.; To, Van Thuong (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.