Абстрактный

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

Abhishek Dwivedi, D.B.Ojha, Ajay Sharma, Awakash Mishra

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