{'fraction_non_alphanumeric': 0.02188183807439825, 'fraction_numerical': 0.0, 'mean_word_length': 5.1891891891891895, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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.