Cryptographic applications of sparse Polynomials over Finite Rings

William D. Banks, Daniel Lieman, Igor E. Shparlinski, Thuong Van To

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

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2000
Subtitle of host publicationThird International Conference Seoul, Korea, December 8-9, 2000 Proceedings
EditorsDongho Won
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages206-220
Number of pages15
Volume2015
ISBN (Print)3540417826, 9783540452478
DOIs
Publication statusPublished - 2001
Event3rd International Conference on Information Security and Cryptology, ICISC - 2000 - Seoul, Korea, Republic of
Duration: 8 Dec 20009 Dec 2000

Publication series

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

Other

Other3rd International Conference on Information Security and Cryptology, ICISC - 2000
CountryKorea, Republic of
CitySeoul
Period8/12/009/12/00

Fingerprint Dive into the research topics of 'Cryptographic applications of sparse Polynomials over Finite Rings'. Together they form a unique fingerprint.

Cite this