Cryptographic applications of sparse polynomials over finite rings

Abstract

This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2015, Springer-Verlag, Berlin (2001). The original publication is available at www.springerlink.com.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