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.

认证是一个非常重要的术语，对数据通信的安全性非常重要。我们发现由于身份验证失败而导致的许多欺诈行为。当通过不安全的信道进行通信时，问题就多了。实体认证是一个涉及发件人身份证明的术语，在银行业和各种其他客户端服务器机制等各种应用程序中非常有用。量子计算机的可用性增加了破坏旧协议的脆弱性。研究人员正在寻找克服这一问题的新平台，其中一个例子是非可交换多项式环[NCPR]。2012年，MRVallauri [MRV]在他的论文中提出了使用NCPR的身份验证协议。他在多项式对称分解问题（PSDP）很难的假设下证明了安全性分析。在本文中，我们证明了他建议的协议在不解决PSDP的情况下是可破解的。我们还提供了纠正的协议来克服此问题。