An identification scheme based on sparse polynomials

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

doi:10.1007/978-3-540-46588-1_6

An identification scheme based on sparse polynomials

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

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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 language	English
Title of host publication	Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings
Editors	Hideki Imai, Yuliang Zheng
Place of Publication	Melbourne
Publisher	Springer, Springer Nature
Pages	68-74
Number of pages	7
Volume	1751
ISBN (Print)	9783540669678
DOIs	https://doi.org/10.1007/978-3-540-46588-1_6
Publication status	Published - 2000
Event	3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000 - Melbourne, Australia Duration: 18 Jan 2000 → 20 Jan 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1751
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000
Country/Territory	Australia
City	Melbourne
Period	18/01/00 → 20/01/00

Access to Document

10.1007/978-3-540-46588-1_6

Cite this

Banks, W. D., Lieman, D., & Shparlinski, I. E. (2000). An identification scheme based on sparse polynomials. In H. Imai, & Y. Zheng (Eds.), Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings (Vol. 1751, pp. 68-74). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1751). Springer, Springer Nature. https://doi.org/10.1007/978-3-540-46588-1_6

Banks, William D. ; Lieman, Daniel ; Shparlinski, Igor E. / An identification scheme based on sparse polynomials. Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings. editor / Hideki Imai ; Yuliang Zheng. Vol. 1751 Melbourne : Springer, Springer Nature, 2000. pp. 68-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5669c6af3ddf45ad970b5cd52673e4c1,

title = "An identification scheme based on sparse polynomials",

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.",

author = "Banks, {William D.} and Daniel Lieman and Shparlinski, {Igor E.}",

year = "2000",

doi = "10.1007/978-3-540-46588-1_6",

language = "English",

isbn = "9783540669678",

volume = "1751",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "68--74",

editor = "Hideki Imai and Yuliang Zheng",

booktitle = "Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings",

address = "United States",

note = "3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000 ; Conference date: 18-01-2000 Through 20-01-2000",

}

Banks, WD, Lieman, D & Shparlinski, IE 2000, An identification scheme based on sparse polynomials. in H Imai & Y Zheng (eds), Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings. vol. 1751, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1751, Springer, Springer Nature, Melbourne, pp. 68-74, 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Australia, 18/01/00. https://doi.org/10.1007/978-3-540-46588-1_6

An identification scheme based on sparse polynomials. / Banks, William D.; Lieman, Daniel; Shparlinski, Igor E.
Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings. ed. / Hideki Imai; Yuliang Zheng. Vol. 1751 Melbourne: Springer, Springer Nature, 2000. p. 68-74 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1751).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - An identification scheme based on sparse polynomials

AU - Banks, William D.

AU - Lieman, Daniel

AU - Shparlinski, Igor E.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84937427611&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-46588-1_6

DO - 10.1007/978-3-540-46588-1_6

M3 - Conference proceeding contribution

AN - SCOPUS:84937427611

SN - 9783540669678

VL - 1751

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 68

EP - 74

BT - Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings

A2 - Imai, Hideki

A2 - Zheng, Yuliang

PB - Springer, Springer Nature

CY - Melbourne

T2 - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000

Y2 - 18 January 2000 through 20 January 2000

ER -

Banks WD, Lieman D, Shparlinski IE. An identification scheme based on sparse polynomials. In Imai H, Zheng Y, editors, Public Key Cryptography - 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Proceedings. Vol. 1751. Melbourne: Springer, Springer Nature. 2000. p. 68-74. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-46588-1_6

An identification scheme based on sparse polynomials

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this