An identification scheme based on sparse polynomials

William D. Banks, Daniel Lieman, Igor E. Shparlinski

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationPublic Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings
EditorsHideki Imai, Yuliang Zheng
Place of PublicationMelbourne
PublisherSpringer, Springer Nature
Pages68-74
Number of pages7
Volume1751
ISBN (Print)9783540669678
DOIs
Publication statusPublished - 2000
Event3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000 - Melbourne, Australia
Duration: 18 Jan 200020 Jan 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1751
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000
CountryAustralia
CityMelbourne
Period18/01/0020/01/00

Fingerprint

Dive into the research topics of 'An identification scheme based on sparse polynomials'. Together they form a unique fingerprint.

Cite this