Advertisement
Published in:
03-01-2021
On Authentication Schemes Using Polynomials Over Non Commutative Rings
Published in: Wireless Personal Communications | Issue 1/2021
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Authentication is a term very important for data communication security. We see many frauds due to authentication failure. The problem manifolds when communication is over insecure channel. Entity authentication is a term which involves proof of sender’s identity and very useful in various applications like in banking sector and various other client server mechanisms. Availability of quantum computers increases the vulnerability of breaking old protocols. Researchers are finding new platforms to overcome this problem and one such example is non commutative polynomial rings [NCPR]. In 2012, M.R.Vallauri [MRV], in his paper suggested an authentication protocol using NCPR. He has proved security analysis under the assumption that polynomial symmetrical decomposition problem (PSDP) is hard. In this paper we show that the protocol suggested by him is breakable without solving PSDP. We also provide corrected protocol to overcome this problem.