Efficient Authentication Scheme Based on the Twisted Near-Ring Root Extraction Problem

  • V. MuthukumaranEmail author
  • D. Ezhilmaran
  • G. S. G. N. Anjaneyulu
Conference paper
Part of the Trends in Mathematics book series (TM)


An authentication protocol is a type of computer communication protocol or cryptography protocol precisely constructed for transferring authentication data between two entities. The aim of this chapter is to propose two new entity authentication schemes that work in the center of the near-ring. The security of the proposed schemes is dependent on the intractability of the twisted near-ring root extraction problem over the near-ring.


  1. 1.
    Anshel, I., Anshel, M., and Goldfeld D.: An algebraic method for public-key cryptography, Mathematical Research Letters. 6,287–292 (1999)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Chowdhury, M.M.: Key agreement and authentication schemes using non-commutative semigroups, arXiv preprint arXiv:0708.239 (2007)Google Scholar
  3. 3.
    Sibert, H., Dehornoy P., and Girault M.: Entity authentication schemes using braid word reduction, Discrete Applied Mathematics. 154,420–436 (2006)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Muthukumaran, V., Ezhilmaran, D.: Symmetric decomposition problem in zero-knowledge authentication schemes using near- ring structure, International Journal of Applied Engineering Research. vol 11,36–40 (2016)Google Scholar
  5. 5.
    Shpilrain, V., Ushakov, A.: An authentication scheme based on the twisted conjugacy problem, In International Conference on Applied Cryptography and Network Security. Springer Berlin Heidelberg, 366–372 (2008)Google Scholar
  6. 6.
    Muthukumaran, V., Ezhilmaran D.: Efficient authentication scheme based on near-ring root extraction problem, In IOP Conference Series: Materials Science and Engineering. 263, 042137(2017)CrossRefGoogle Scholar
  7. 7.
    Ferrero, Giovanni: Near-rings: Some developments linked to semigroups and groups, Springer Science and Business Media (2013)Google Scholar
  8. 8.
    Wang, B.C., Hu, Y.P.: Signature scheme based on the root extraction problem over braid groups, IET Information Security, 3, 53–59 (2009)CrossRefGoogle Scholar
  9. 9.
    Guillou, L.C., Quisquater J.J.: A practical zero knowledge protocol fitted to security microprocessor minimizing both transmission and memory, Advances in Cryptology-Encrypt ’88, Proceeding: Springer Verlag, 1088,123–128 (1988)Google Scholar
  10. 10.
    Pratik Ranjan, Hari Om: Cryptanalysis of braid groups based authentication schemes, NGCT (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • V. Muthukumaran
    • 1
    Email author
  • D. Ezhilmaran
    • 1
  • G. S. G. N. Anjaneyulu
    • 1
  1. 1.VITVelloreIndia

Personalised recommendations