A NON-REPUDIABLE BIASED BITSTRING KEY-AGREEMENT PROTOCOL WITH ROOT PROBLEM IN NON-ABELIAN GROUP
|Abhishek Dwivedi*1 and D.B.Ojha2|
|Corresponding Author: Abhishek Dwivedi, E-mail: [email protected]|
|Related article at Pubmed, Scholar Google|
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).