Authentication Schemes Using Polynomials Over Non-Commutative Rings

DOI10.5121/IJCIS.2012.2406arXiv1301.2010MaRDI QIDQ6238638FDOQ6238638

Publication date: 9 January 2013

Abstract: Authentication is a process by which an entity,which could be a person or intended computer,establishes its identity to another entity.In private and public computer networks including the Internet,authentication is commonly done through the use of logon passwords. Knowledge of the password is assumed to guarantee that the user is authentic.Internet business and many other transactions require a more stringent authentication process. The aim of this paper is to propose two authentication schemes based on general non-commutative rings. The key idea of the schemes is that for a given non-commutative ring; one can build polynomials on additive structure and takes them as underlying work structure. By doing so, one can implement authentication schemes, one of them being zero-knowledge interactive proofs of knowledge, on multiplicative structure of the ring. The security of the schemes is based on the intractability of the polynomial symmetrical decomposition problem over the given non-commutative ring.

This page was built for publication: Authentication Schemes Using Polynomials Over Non-Commutative Rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238638)