Scholars Central

Research articlePublished 26 Dec 2016

RSA Encryption Using Three Mersenne Primes

Authors: J L Padmaja, V. S. Bhagavan, B. Srinivas

International Journal of Chemical Sciences

Volume 14 · Issue 4 · Pages 2273–2278

Ask about this article

Abstract

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

As the internet evolves and computer networks become accessible, most business transactions are done over the internet. Potential threat to the information is always present and attempts are being made to provide maximum security over the network. One of such new techniques is using multiple prime numbers for RSA cryptosystem, which is not easily breakable. Also, typical prime numbers are used in order to strengthen the algorithm to ensure safe data exchange. In this paper, we used three Mersenne prime numbers to construct a new RSA cryptosystem which provides more efficiency and reliability over the network. Mathematics Subject Classification (2010): 11T71, 14G50, 68P25, 94A60.

Subjects

Chemistry

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 International Journal of Chemical 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.

  • JournalInternational Journal of Chemical Sciences
  • SubjectChemistry
  • BylineArticles whose byline prints “J L Padmaja”
  • BylineArticles whose byline prints “V. S. Bhagavan”
  • BylineArticles whose byline prints “B. Srinivas”

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