A Model of Key Agreement Protocol using Polynomials over Non-Cummutative Division Semirings

Journal of Global Research in Computer Sciences

article

Abhishek Dwivedi¹  D.B.Ojha³  Ajay Sharma¹  Awakash Mishra¹ 

[1] Singhania University;Department of M.C.A, Raj Kumar Goel Engineering College;Department of Mathematics, R. K. G. Institute of Technology;Department of Information Technology, R.K.G.Institute of Technology

关键词: Symmetric key;    Semirings;    Polynomial rings;    Key agreement;    and Security;   

来源: Research & Reviews

【 摘 要 】

The basic aim of key exchange is that two people who can only communicate via an insecure channel want to find a common secret key without any attack. In this paper we show a model of key-agreement protocol using polynomials over non-commutative division semiring for network security. It is proved that the proposed protocol meets several security attributes under the assumption that the polynomials over the non- commutative division semiring.

【 授权许可】

Unknown