A new multiparty identification scheme based on nearring root extraction problem. (2nd January 2019)

• Record Type: Journal Article
• Authors: Arunma, M.; Ezhilmaran, D.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 22:Number 1(2019)
• Page Start: 59
• Page End: 64
• Publication Date: 2019-01-02
• Subjects: 16Y30 -- 94A60 -- 94A62; Symmetric keys -- Key agreement -- Security -- Near polynomial ring -- Nearring root extraction problem; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1569820
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: In this paper, we propose a Multiparty Identification Scheme based on Nearring root Extraction Problem. This scheme enables more than two or three parties to prove their identity among themselves. We have chosen Nearring root extraction problem as a basis for our scheme. An adversary finds difficult to break the scheme as he/she finds very hard to extract the nth root for a given near polynomial ring.