A new identification scheme based on near-ring root extraction problem

Abstract

An Identification scheme is an important and useful cryptographic tool for authentication. In this paper we propose a new Identification scheme based on near-ring root extraction problem. Given a Near polynomial ring N(x) over a near-ring N, an integer n ≥ 2 and a polynomial f ∈ N(x), find a polynomial g∈N(x) such that f = gn (assuming one such g exists). The security of the proposed scheme is tied to the near-ring root extraction problem. We have discussed about the active attacks in this paper. The above protocol is verified with an illustration.