Efficient Authentication Scheme Based on the Twisted Near-Ring Root Extraction Problem
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.
- 2.Chowdhury, M.M.: Key agreement and authentication schemes using non-commutative semigroups, arXiv preprint arXiv:0708.239 (2007)Google Scholar
- 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.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
- 7.Ferrero, Giovanni: Near-rings: Some developments linked to semigroups and groups, Springer Science and Business Media (2013)Google Scholar
- 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.Pratik Ranjan, Hari Om: Cryptanalysis of braid groups based authentication schemes, NGCT (2015)Google Scholar