Authentication Schemes Using Polynomials Over Non-Commutative Rings
This work addresses authentication security for internet business and networks, but appears incremental as it builds on existing ring-based cryptographic methods.
The paper tackles the need for more stringent authentication in internet transactions by proposing two authentication schemes based on non-commutative rings, with security relying on the intractability of the polynomial symmetrical decomposition problem.
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.