Publication Type:

Journal Article

Source:

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

ISBN:

9783642316852

URL:

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

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

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.

Notes:

cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@5d5656c9 ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@4f5bd5fe Through org.apache.xalan.xsltc.dom.DOMAdapter@163e3f66; Conference Code:92052

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.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
9th
RANK(INDIA):
NIRF 2017
150+
INTERNATIONAL
PARTNERS