A zero-knowledge identification protocol in the ring of Gaussian integers

Abstract

In this paper, a zero-knowledge identification protocol is proposed by extending from the rational of natural integers ℤ, to the ring of Gaussian integers ℤ[i]. Its security relies on the integer factorization problem and extraction of square roots of a Gaussian integer over ℤn. Properties, space complexity and time complexity of the proposed protocol are also discussed.