Back close
Admissions

Digital signatures using multivariate polynomial systems with relatively simpler central maps

Publication Type : Journal Article

Publisher : Communications in Computer and Information Science

Source : Communications in Computer and Information Science, Volume 292 CCIS, Bangalore, p.592-598 (2012)

Url : http://www.scopus.com/inward/record.url?eid=2-s2.0-84865293746&partnerID=40&md5=408cfd582ea12f55fb73dbde623e9139

ISBN : 9783642316852

Keywords : Affine transformations, Artificial intelligence, Authentication, Computational work, Cryptography, Data processing, Eigen-value, Electronic document identification systems, Multivariable systems, Multivariate polynomial, Polynomial systems, Quadratic polynomial, Secure communications

Campus : Coimbatore

School : School of Engineering

Department : Mathematics

Year : 2012

Abstract : Multivariate polynomials, especially quadratic polynomials, are very much used in cryptography for secure communications and digital signatures. In this paper, polynomial systems with relatively simpler central maps are presented. It is observed that, by using such simple central maps, the amount of computational work of the Signer, is considerably reduced. © 2012 Springer-Verlag.

Cite this Research Publication : M. Sivasankar and Padmanabhan, T. R., “Digital signatures using multivariate polynomial systems with relatively simpler central maps”, Communications in Computer and Information Science, vol. 292 CCIS, pp. 592-598, 2012.

Admissions Apply Now