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.
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.
Similar content being viewed by others
References
Wolf, C., Preneel, B.: Superfluous Keys in Multivariate Quadratic Asymmetric Systems. Cryptology ePrint Archive, Report 2004/361 (2004)
Albrecht, P., Enrico, T., Stanislav, B., Christopher, W.: Small Public Keys and Fast Verification for Multivariate Quadratic Public Key Systems. In: Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems, CESS (2011)
Wolf, C.: Introduction to Multivariate Quadratic Public Key Systems and Their Applications. In: Proceedings of Yet Another Conference on Cryptography, YACC 2006, France (2006)
Wolf, C., Preneel, B.: Taxonomy of Public Key Schemes based on the Problem of Multivariate Quadratic equations. Cryptology ePrint Archive, Report 2005/077 (2005)
Buchberger: An algorithmic Method in Polynomial Ideal Theory. In: Multidimensional Systems Theory, pp. 184–232. D, Reidel Publishing Company (1985)
Alfred, J., Van Menezes Paul, C., Oorschot, S., Vanstone, A.: Handbook of Applied Cryptography. CRC Press LCC (1996)
Sivasankar M.: Multivariate Non-quadratic Public Key Schemes. In: Proceedings of the International Conference on Algebra and Its Applications, ICOAA 2011 (2011)
Williams, M.P.: Solving Polynomial Equations Using Linear Algebra. Johns Hopkins APL Technical Digest 28(4) (2010)
Emiris, I.Z.: On the Complexity of Sparse Elimination. J.Complexity 12, 134–166 (1996)
Cox, D.A., Little, J., O’Shea, D.: Ideals: Varieties and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra II. Springer (1996)
Anton, H., Rorres, C.: Elementary Linear Algebra, IXth edn. John Wiley & Sons (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
M., S., T.R., P. (2012). Digital Signatures Using Multivariate Polynomial Systems with Relatively Simpler Central Maps. In: Venugopal, K.R., Patnaik, L.M. (eds) Wireless Networks and Computational Intelligence. ICIP 2012. Communications in Computer and Information Science, vol 292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31686-9_69
Download citation
DOI: https://doi.org/10.1007/978-3-642-31686-9_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31685-2
Online ISBN: 978-3-642-31686-9
eBook Packages: Computer ScienceComputer Science (R0)