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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call