Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012 pp 183–187Cite as

A Modified Variant of RSA Algorithm for Gaussian Integers

  • Conference paper
  • First Online:

  • 1735 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 236))

Abstract

A Gaussian prime is a Gaussian integer that cannot be expressed in the form of the product of other Gaussian integers. The concept of Gaussian integer was introduced by Gauss [4] who proved its unique factorization domain. In this paper, we propose a modified RSA variant using the domain of Gaussian integers providing more security as compared to the old one.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Cross, J.T.: The Eulers f -function in the Gaussian integers. Amer. Math. 55, 518–528 (1995)

    Google Scholar 

  2. Elkamchouchi, H., Elshenawy, K., Shaban, H.: Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers. The 8th International Conference on Communication Systems, vol. 1 (ICCS’02), pp. 91–95 (2002).

    Google Scholar 

  3. El-Kassar, A.N., Haraty, R., Awad, Y., Debnath, N.C.: Modified RSA in the domains of Gaussian integers and polynomials over finite fields. In: Proceedings of international conference computer applications in industry and engineering–CAINE, pp. 298–303 (2005).

    Google Scholar 

  4. Gauss, C.F.: Theoria residuorum biquadraticorum. Comm. Soc. Reg. Sci. Gottingen 7, 1–34 (1832)

    Google Scholar 

  5. Menezes, A., Van Oorshot, J., Vanstone, P.C.S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton, FL (1997)

    MATH  Google Scholar 

  6. Niven, I., Zukerman, H.S., Montegomery, H.L.: An Introduction to the Theory of Numbers. John Wiley, New York (1991)

    Google Scholar 

  7. Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Commun. ACM 21, 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur, India

    Sushma Pradhan & Birendra Kumar Sharma

Authors
  1. Sushma Pradhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Birendra Kumar Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sushma Pradhan .

Editor information

Editors and Affiliations

  1. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    B. V. Babu

  2. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  3. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  4. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

  5. Department of Applied Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  6. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    Kanad Ray

  7. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    Umesh Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Pradhan, S., Sharma, B.K. (2014). A Modified Variant of RSA Algorithm for Gaussian Integers. In: Babu, B., et al. Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012. Advances in Intelligent Systems and Computing, vol 236. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1602-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1602-5_20

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1601-8

  • Online ISBN: 978-81-322-1602-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation