Cryptographic applications of sparse polynomials over finite rings

MOspace/Manakin Repository

Breadcrumbs Navigation

Cryptographic applications of sparse polynomials over finite rings

Please use this identifier to cite or link to this item: http://hdl.handle.net/10355/10614

[+] show full item record


Title: Cryptographic applications of sparse polynomials over finite rings
Author: Banks, William David, 1964-; Lieman, Daniel, 1965-; Shparlinski, Igor E.; To, Van Thuong
Keywords: public-key identification scheme
asymmetric key algorithms
Date: 2001
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 and identification schemes.
URI: http://hdl.handle.net/10355/10614

This item appears in the following Collection(s)

  • Mathematics publications (MU) [119]
    The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.

[+] show full item record