Cryptographic Applications of Sparse Polynomials over Finite Rings
作者： William D. Banks , Daniel Lieman , Igor E. Shparlinski , Thuong Van To
关键词: Polynomial 、 Identification (information) 、 Computer science 、 Cryptography 、 Sparse approximation 、 Finite ring 、 Cryptosystem 、 Public-key cryptography 、 Algorithm
摘要: 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.
springer.com
core.ac.uk
sci-hub.st 参考文章(13)
Henri Cohen, A Course in Computational Algebraic Number Theory ,(1993)
Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu, Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems public key cryptography. ,vol. 1992, pp. 153- 164 ,(2001) , 10.1007/3-540-44586-2_11
Joachim Von Zur Gathen, Jurgen Gerhard, Modern Computer Algebra ,(1999)
Jeffrey Hoffstein, Joseph H. Silverman, Polynomial Rings and Efficient Public Key Authentication II Birkhäuser, Basel. pp. 269- 286 ,(2001) , 10.1007/978-3-0348-8295-8_20
William D. Banks, Daniel Lieman, Igor E. Shparlinski, An Identification Scheme Based on Sparse Polynomials public key cryptography. pp. 68- 74 ,(2000) , 10.1007/978-3-540-46588-1_6
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman, NTRU: A Ring-Based Public Key Cryptosystem algorithmic number theory symposium. pp. 267- 288 ,(1998) , 10.1007/BFB0054868
D. Grant, K. Krastev, D. Lieman, I. Shparlinski, A Public Key Cryptosystem Based on Sparse Polynomials International Conference on Coding Theory, Cryptography and Related Areas. pp. 114- 121 ,(2000) , 10.1007/978-3-642-57189-3_10
Arnold Knopfmacher, John Knopfmacher, Counting polynomials with a given number of zeros in a finite field Linear & Multilinear Algebra. ,vol. 26, pp. 287- 292 ,(1990) , 10.1080/03081089008817985
Andrew Chi-Chih Yao, On the Evaluation of Powers SIAM Journal on Computing. ,vol. 5, pp. 100- 103 ,(1976) , 10.1137/0205008
Daniel M. Gordon, A Survey of Fast Exponentiation Methods Journal of Algorithms. ,vol. 27, pp. 129- 146 ,(1998) , 10.1006/JAGM.1997.0913