A NON-REPUDIABLE BIASED BITSTRING KEY-AGREEMENT PROTOCOL WITH ROOT PROBLEM IN NON-ABELIAN GROUP
The Key exchange problems are of central interest in security world. The basic aim 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 elaborated the process for well secured and assured for sanctity of correctness about the sender’s and receiver’s identity, as non-repudiable biased bitstring key agreement protocol using root problem in non-abelian group (NKR-NAG).
Abhishek Dwivedi and D.B.Ojha
To read the full article Download Full Article | Visit Full Article