Skip to main content
Conference ProceedingsOPEN ACCESS

An identification scheme based on sparse polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1751 68-74
DOI: 10.1007/978-3-540-46588-1_6
4Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 identification schemes.

Cite

CITATION STYLE

APA

Banks, W. D., Lieman, D., & Shparlinski, I. E. (2000). An identification scheme based on sparse polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1751, pp. 68–74). Springer Verlag. https://doi.org/10.1007/978-3-540-46588-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free