Multi-Factor Analysis of RSA Based on Variations in Primes Used for Modulus Generation

The RSA cryptosystem encompasses some of the most common and popular encryption-decryption algorithms. In conjunction with other encryption schemes, RSA encryption is often used as a method to prove the authenticity and integrity of messages. Due to its less efficient and resource-intensive nature,...

Full description

Saved in:
Bibliographic Details
Published in:2023 3rd International Conference on Innovative Sustainable Computational Technologies (CISCT) pp. 1 - 6
Main Authors: Dash, Adyasha, Sarkar, Ansh, Chatterjee, Ashutosh, Darshana, Subhashree, Pandey, Manjusha, Barik, Rabindra K.
Format: Conference Proceeding
Language:English
Published: IEEE 08.09.2023
Subjects:
Asymmetric Cryptography
Correlation
Encryption
NPRSA
Primes
Quantum computing
RSA
Turning
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The RSA cryptosystem encompasses some of the most common and popular encryption-decryption algorithms. In conjunction with other encryption schemes, RSA encryption is often used as a method to prove the authenticity and integrity of messages. Due to its less efficient and resource-intensive nature, it is generally, not used to encrypt entire multi-line messages or files. In order to crack an RSA encrypted asset, it is important for attackers to be able to factorize humongous primes; which, with the advent of quantum computing is slowly turning into a possibility thereby causing the factoring problem to lose its relevance. The purpose of this paper is to examine the cryptosystem for potential correlations that might exist between factors such as "the number of primes used" and the algorithm's "level of security". Classical RSA involves the use of a pair of prime numbers for the process of key generation. In this paper, we aim to propose a generalized algorithm for generating RSA keys using N distinct prime numbers. Previously, papers have been published on the RSA algorithm subject to changing "the number of primes" used to generate the RSA modulus. However, the aim of this paper is to generalize this approach while simultaneously illustrating the changes in the classical algorithm's properties over a spectrum of different values of the factors involved.
AbstractList The RSA cryptosystem encompasses some of the most common and popular encryption-decryption algorithms. In conjunction with other encryption schemes, RSA encryption is often used as a method to prove the authenticity and integrity of messages. Due to its less efficient and resource-intensive nature, it is generally, not used to encrypt entire multi-line messages or files. In order to crack an RSA encrypted asset, it is important for attackers to be able to factorize humongous primes; which, with the advent of quantum computing is slowly turning into a possibility thereby causing the factoring problem to lose its relevance. The purpose of this paper is to examine the cryptosystem for potential correlations that might exist between factors such as "the number of primes used" and the algorithm's "level of security". Classical RSA involves the use of a pair of prime numbers for the process of key generation. In this paper, we aim to propose a generalized algorithm for generating RSA keys using N distinct prime numbers. Previously, papers have been published on the RSA algorithm subject to changing "the number of primes" used to generate the RSA modulus. However, the aim of this paper is to generalize this approach while simultaneously illustrating the changes in the classical algorithm's properties over a spectrum of different values of the factors involved.
Author Sarkar, Ansh
Chatterjee, Ashutosh
Dash, Adyasha
Barik, Rabindra K.
Darshana, Subhashree
Pandey, Manjusha
Author_xml – sequence: 1
  givenname: Adyasha
  surname: Dash
  fullname: Dash, Adyasha
  email: adyasha.dashfcs@kiit.ac.in
  organization: School of Computer Engineering Kalinga Institute of Industrial Technology,Bhubaneswar,India
– sequence: 2
  givenname: Ansh
  surname: Sarkar
  fullname: Sarkar, Ansh
  email: anshsarkar18@gmail.com
  organization: School of Computer Engineering Kalinga Institute of Industrial Technology,Bhubaneswar,India
– sequence: 3
  givenname: Ashutosh
  surname: Chatterjee
  fullname: Chatterjee, Ashutosh
  email: ash03official@gmail.com
  organization: School of Computer Engineering Kalinga Institute of Industrial Technology,Bhubaneswar,India
– sequence: 4
  givenname: Subhashree
  surname: Darshana
  fullname: Darshana, Subhashree
  email: subhashree.darshanafcs@kiit.ac.in
  organization: School of Computer Engineering Kalinga Institute of Industrial Technology,Bhubaneswar,India
– sequence: 5
  givenname: Manjusha
  surname: Pandey
  fullname: Pandey, Manjusha
  email: manjushafcs@kiit.ac.in
  organization: School of Computer Engineering Kalinga Institute of Industrial Technology,Bhubaneswar,India
– sequence: 6
  givenname: Rabindra K.
  surname: Barik
  fullname: Barik, Rabindra K.
  email: rabindra.mnnit@gmail.com
  organization: School of Computer Applications Kalinga Institute of Industrial Technology,Bhubaneswar,India
BookMark eNo1T8lOwzAUNBIcoPQPOPgHEmy_uI6PIaKlUisQXa7VS_IsWQo2ipND_56ynUajWTRzx65DDMQYlyKXUtjHer2r99pIa3IlFORSgJYFqCs2t8aWoAUIgIW4Zcft1I8-W2I7xoFXAftz8olHx993FX_CRB2PgR9x8Dj6GBL3gb8N_oMSP3yL7hLbxm7qp8RXFGj4sd2zG4d9ovkfzthh-byvX7LN62pdV5vMS2nHDA0q1NrppimwaFvUpLqutBemrZGCZIELDcIpwLIomxa0kySkUdRqVwLM2MNvryei0-dlFw7n0_9d-ALCoE-b
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CISCT57197.2023.10351432
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350303360
EndPage 6
ExternalDocumentID 10351432
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-a7a2a55f5bb4a4cca5e2dd89b4a59710e14a6530f23a848bc35f1e0172ec5f833
IEDL.DBID RIE
IngestDate Wed Jan 10 09:27:56 EST 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-a7a2a55f5bb4a4cca5e2dd89b4a59710e14a6530f23a848bc35f1e0172ec5f833
PageCount 6
ParticipantIDs ieee_primary_10351432
PublicationCentury 2000
PublicationDate 2023-Sept.-8
PublicationDateYYYYMMDD 2023-09-08
PublicationDate_xml – month: 09
  year: 2023
  text: 2023-Sept.-8
  day: 08
PublicationDecade 2020
PublicationTitle 2023 3rd International Conference on Innovative Sustainable Computational Technologies (CISCT)
PublicationTitleAbbrev CISCT
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8435721
Snippet The RSA cryptosystem encompasses some of the most common and popular encryption-decryption algorithms. In conjunction with other encryption schemes, RSA...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Asymmetric Cryptography
Correlation
Encryption
NPRSA
Primes
Quantum computing
RSA
Turning
Title Multi-Factor Analysis of RSA Based on Variations in Primes Used for Modulus Generation
URI https://ieeexplore.ieee.org/document/10351432
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYmACRBFveWB18TO2R6ioYKCq6EPdKie2pUooQW3C78d2GhADA1sSO7Z0p-Tz2ffdB8CdFhFUCxI8oDPEqSVIFUIgLX2OJeUq163YhByP1XKpJzuyeuLCOOdS8pkbxMt0lm-roolbZeELj3nnLPxx96XMWrJWl52D9f3wZTqcCUm0HERR8EHX_ZdwSsKN0dE_ZzwG_R8GHpx8Y8sJ2HPlKVgktiwaJYkc2JUTgZWHb9MH-BjwyMKqhIsQ_rb7cHBdhlEiyQPOY2NYoMLXyjbvzRa29aZjtz6Yj55mw2e000VAa0J0jYw01AjhRZ5zw4MLhKPWKh3uQnhAsCPcZIJhT5lRwdoFE564GOy5QnjF2BnolVXpzgHk1BFsAkBZjnkhMuMDXDMc3iHUauMvQD8aZfXRlr5Ydfa4_OP5FTiMpk9JWOoa9OpN427AQfFZr7eb2-SwL0G5lrs
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFA8yBT2pOPHbHLxmJmmyJkcdjg23MdwHu400HzCQVrbVv98kXRUPHrw1bZPCezS_vOT93g-AB8kDqGriPSDbiFFDkNCcI5m6DKeUiUxWYhPpaCQWCznekdUjF8ZaG5PPbCtcxrN8U-gybJX5PzzknSd-xt3njFFc0bXq_BwsHzv9SWfKUyLTVpAFb9UdfkmnROToHv_zmyeg-cPBg-NvdDkFezY_A_PIl0XdKJID64IisHDwbfIEnz0iGVjkcO4D4GonDq5yP0qgecBZeOiXqHBYmPK93MCq4nR4rQlm3Zdpp4d2yghoRYjcIpUqqjh3PMuYYt4J3FJjhPQtHyAQbAlTbZ5gRxMlvL11wh2xIdyzmjuRJOegkRe5vQCQUUuw8hBlGGaat5XzgJ1g34dQI5W7BM1glOVHVfxiWdvj6o_79-CwNx0OloP-6PUaHAU3xJQscQMa23Vpb8GB_tyuNuu76LwvSByaAg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+3rd+International+Conference+on+Innovative+Sustainable+Computational+Technologies+%28CISCT%29&rft.atitle=Multi-Factor+Analysis+of+RSA+Based+on+Variations+in+Primes+Used+for+Modulus+Generation&rft.au=Dash%2C+Adyasha&rft.au=Sarkar%2C+Ansh&rft.au=Chatterjee%2C+Ashutosh&rft.au=Darshana%2C+Subhashree&rft.date=2023-09-08&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FCISCT57197.2023.10351432&rft.externalDocID=10351432