Authentication Schemes Using Polynomials Over Non-Commutative Rings

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.

• Publication year

  2013

• Venue

  arXiv.org

• Publication date

  2013-01-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.5121/ijcis.2012.2406arXiv 1301.2010
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Protection

  2018cited by this paper
• Secured Directed Digital Signature over Non-Commutative Division Semirings and Allocation of Experimental Registration Number

  2012cited by this paper
• New Digital Signature Scheme Using Polynomials Over Non- Commutative Groups

  2008cited by this paper
• New Public Key Cryptosystems Using Polynomials over Non-commutative Rings

  2007cited by this paper
• Entity authentication schemes using braid word reduction

  2006cited by this paper
• New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups

  2002cited by this paper
• Conic analog of RSA cryptosystem and someimproved RSA cryptosystems

  1999cited by this paper
• An algebraic method for public-key cryptography

  1999cited by this paper
• Zero-knowledge proofs of identity

  1987cited by this paper
• A public key cryptosystem and a signature scheme based on discrete logarithms

  1984cited by this paper
• New Directions in Cryptography

  1976cited by this paper

• A New Digital Signature Scheme over Non-Commutative Integral Group Rings

  2025cites this paper
• Post-Quantum Cryptography

  2024cites this paper
• Post Quantum Cryptography and its Comparison with Classical Cryptography

  2024cites this paper
• Cryptography: Classical versus Post-Quantum

  2024cites this paper
• Public key authentication scheme over quaternions

  2021cites this paper
• On Authentication Schemes Using Polynomials Over Non Commutative Rings

  2021cites this paper
• The recent trends in cyber security: A review

  2021cites this paper
• A Secure GUI Method For Reliable Data Communication

  2021cites this paper
• α-SKEW π-ARMENDARIZ RING FOR IMPROVING SECURE ALGEBRAIC ZERO KNOWLEDGE CRYPTOSYSTEM

  2019cites this paper
• A new one time password mechanism for client-server applications

  2019cites this paper
• An interactive proof via some generalized reduced rings

  2017cites this paper
• A new paradigm of the zero-knowledge authentication protocol basedπ-Armendariz rings

  2017cites this paper
• Cryptanalysis And Enhancement Of Password Authentication Scheme For Smart Card

  2017cites this paper
• Public Key Encryption Techniques Provide Extreme Secure Chat Environment

  2013cites this paper
• Interoperability in Complex Distributed Systems

  2011cites this paper