Scholars Central

Research articlePublished Nov 2010

A NON-REPUDIABLE BIASED BITSTRING KEY-AGREEMENT PROTOCOL WITH ROOT PROBLEM IN NON-ABELIAN GROUP

Authors: Abhishek Dwivedi, D.B.Ojha

Journal of Global Research in Computer Sciences

Volume 1 · Issue 4 · Pages 56–59

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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).

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Abhishek Dwivedi”
  • BylineArticles whose byline prints “D.B.Ojha”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels