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.
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
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.