An identification scheme based on sparse polynomials
No Thumbnail Available
Meeting name
Sponsors
Date
Journal Title
Format
Book chapter
Subject
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.