Abstract
This paper gives new examples that exploit the idea of us- ing sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems and identification schemes.
Acknowledgments
The authors are grateful to Claus Schnorr for pointing out an error in the initial version of the SPIFI scheme. The authors also thank the authors of [1] for very interesting discussions of other attacks on SPIFI and ENROOT and generally the perspectives of sparse polynomial based cryptography.
Thanks also go to Kwangjo Kim and Arjen Lenstra for their assistance in contacting with the authors of [1].
This work was done during a series of visits by W. B. and D. L. to Macquarie University, whose hospitality and support are gratefully acknowledged.
Work also supported in part, W. B. by NSF grant DMS-0070628, for D. L. by NSF grant DMS-9700542, and a Big 12 Faculty Fellowship from the University of Missouri and for I. S. by ARC grant A69700294.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Bao, R. H. Deng, W. Geiselmann, C. Schnorr, R. Steinwandt and H. Wu, ‘Crytoanalysis of two sparse polynomial based cryptosystems’, Proc. Int. Conf. on Public Key Cryptography, PKC’2001, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2001, to appear.
W. Banks, D. Lieman and I. E. Shparlinski, ‘An identification scheme based on sparse polynomials’, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1751, 68–74.
H. Cohen A course in computational algebraic number theory, Springer-Verlag, Berlin, 1997.
J. von zur Gathen and J. Gerhard, Modern computer algebra, Cambridge Univ. Press, Cambridge, 1999.
D. M. Gordon, ‘A survey of fast exponentiation methods’, J. Algorithms, 27 (1998), 129–146.
D. Grant, K. Krastev, D. Lieman and I. E. Shparlinski, ‘A public key cryptosystem based on sparse polynomials’,Proc. International Conference on Coding Theory, Cryptography and Related Areas, Guanajuato, 1998, Springer-Verlag, Berlin, 2000, 114–121.
M.-D. A. Huang and Y.-C. Wong, ‘Solving systems of polynomial congruences modulo a large prime’, Proc. 37 IEEE Symp. on Found. of Comp. Sci., 1996, 115–124.
J. Ho stein, B. S. Kaliski, D. Lieman, M. J. B. Robshaw and Y. L. Yin, ‘A new identification scheme based on polynomial evaluation’, US Patent, No. No.6076163, 2000.
J. Hostein, D. Lieman and J. H. Silverman, ‘Polynomial Rings and Efficient Public Key Authentication’, Proc. the International Workshop on Cryptographic Techniques and E-Commerce, City University of Hong Kong Press, to appear.
J. Hostein, J. Pipher and J. H. Silverman, ‘NTRU: A ring based public key cryptosystem’, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1433 (1998), 267–288.
J. Hostein and J. H. Silverman, ‘Polynomial rings and efficient public key authentication II’, Proc. the International Workshop on Cryptography and Computational Number Theory, Singapore, 1999, Birkhäuser, 2001, 269–286.
A. Knopfmacher and J. Knopfmacher, ‘Counting polynomials with a given number of zeros in a finite field’, Linear and Multilinear Algebra, 26 (1990), 287–292.
N. Pippenger, ‘On the evaluation of powers and monomials’, SIAM J. Comp., 9 (1980), 230–250.
I. E. Shparlinski, Finite fields: Theory and computation, Kluwer Acad. Publ., Dordrecht, 1999.
A. C.-C. Yao, ‘On the evaluation of powers’, SIAM J. Comp., 5 (1976), 100–103.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banks, W.D., Lieman, D., Shparlinski, I.E., Van To, T. (2001). Cryptographic Applications of Sparse Polynomials over Finite Rings. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive