EUVIMEDEUVIMED entdecken
Open Access · CC BY-ND 4.0

Batch S-RSA Algorithm

Sreenivasulu Reddy L

Journal of Electrical Systems · 25.04.2024 · 20 (3) · 3896-3902

DOI: 10.52783/jes.5290 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Electrical Systems, online erschienen am 25.04.2024. Verfasst von Sreenivasulu Reddy L. Der Volltext ist frei zugänglich (Open Access, CC BY-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Digital information processing is a method within a communication system designed to transfer messages among authenticated participants within a fraction of seconds. In most digital information process, messages are transferred via public media, such as the air or cable. Public media have no restriction on access. This is achieved through cryptography algorithms, primarily public key cryptography algorithms, which have led to a demand for various variants of public key cryptosystem. During information processing via public media using cryptographic algorithms, eavesdroppers can attempt to access and intercept secret information from authenticated participants. Preventing these attacks on digital messages requires proposing novel cryptography algorithms with complexity. This work aims to achieve three primary objectives. The first objective is to propose a batch RSA-type algorithm named ‘batch S-RSA’ based on the solovay-strassen totient function. The second objective is to assess the complexity of the S-RSA algorithm in terms of big- notation. The third objective is to measure the complexity of four passive attacks on the S-RSA algorithm.

Zitieren

APA

L, S. R. (2024). Batch S-RSA Algorithm. Journal of Electrical Systems, 20(3), 3896-3902. https://doi.org/10.52783/jes.5290

Vancouver

L SR. Batch S-RSA Algorithm. Journal of Electrical Systems. 2024;20(3):3896-3902. doi:10.52783/jes.5290

BibTeX
@article{L2024,
  author = {L, Sreenivasulu Reddy},
  title = {Batch S-RSA Algorithm},
  journal = {Journal of Electrical Systems},
  year = {2024},
  volume = {20},
  number = {3},
  pages = {3896--3902},
  doi = {10.52783/jes.5290}
}
Kostenlos starten →