International Journal of Computer Theory and Engineering

Editor-In-Chief: Prof. Mehmet Sahinoglu
Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJIET 2010 Vol.2(1): 52-56
doi: 10.7763/IJCTE.2010.V2.116

Solovay-Strassen Test in a RSA Pubic Key Cryptosystem

L. Sreenivasulu Reddy1 , K. Ramakrishna Prasad2 , N. Ch. S. N. Iyengar1,2,3,4 , V. Ramachandran4

  • 1Department of Mathematics Sri Venkateswara University, Tirupati, Andra Pradesh, India
  • 2Department of Mathematics at Sri Venkateswara University, Tirupati, Andra Pradesh,India
  • 3School Of Computing Sciences at VIT University, Vellore, T. N India
  • 4University, Trichy (T. N). India

Abstract

In this paper, RSA type of Public key cryptosystem is designed based on Solovay-Stressen test known as S-RSA Cryptosytem. The efficiency of the S-RSA cryptosystem is nearly twice of the efficiency of basic RSA cryptosystem which is proved mathematically and is shown graphically with an illustration. Also, the Performance of this system is measured in terms of big theta notation for best approximation. This paper also describes and measures the capability of four basic attacks on S-RSA cryptosystem.

Keywords

  • Knapsack problem
  • Legendre symbol
  • congruence
  • in congruence
  • Factorization of numbers
  • Euler theorem
  • Solovay-Strassen test
116-G620

How to Cite

Copied

L. Sreenivasulu Reddy, K. Ramakrishna Prasad, N. Ch. S. N. Iyengar, and V. Ramachandran, "Solovay-Strassen Test in a RSA Pubic Key Cryptosystem," International Journal of Computer Theory and Engineering, vol. 2, no. 1, pp. 52-56, 2010. https://doi.org/10.7763/IJCTE.2010.V2.116

Copyright & License

Copyright © 2010 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu