Cryptographic applications of sparse polynomials over finite rings
No Thumbnail Available
Meeting name
Sponsors
Date
Journal Title
Format
Book chapter
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.