On the Use of Gaussian Integers in Public Key Cryptosystems

  • Aakash Paul
  • Somjit Datta
  • Saransh Sharma
  • Subhashis Majumder
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)


We present a comparative analysis of the processes of factorization of Gaussian integers and rational integers, with the objective of demonstrating the advantages of using the former instead of the latter in RSA public key cryptosystems. We show that the level of security of a cryptosystem based on the use of the product of two Gaussian primes is much higher than that of one based on the use of the product of two rational primes occupying the same storage space. Consequently, to achieve a certain specific degree of security, the use of complex Gaussian primes would require much less storage space than the use of rational primes, leading to substantial saving of expenditure. We also set forth a scheme in which rings of algebraic integers of progressively higher and higher degrees and class numbers can be used to build cryptosystems that remain secure by forever staying ahead of advances in computing power.


Gaussian integer Encryption Decryption Algebraic integer 


  1. 1.
    Adleman, L.M., Rivest, R.L., Shamir, A.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 12–126 (1978)MathSciNetGoogle Scholar
  2. 2.
    Rivest, R.L.: RSA chips (past/present/future). In: Advances in Cryptography, Proceedings of Eurocrypt, vol. 84, pp. 159–165. Springer, New York (1985)Google Scholar
  3. 3.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory IT 22, 644–654 (1976)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Hardy, G.H., Wright, E.M. (Revised by Heath-Brown, D.R., Silverman, J.H.): An Introduction to the Theory of Numbers, 6th edn. Oxford University Press, Oxford (2008)Google Scholar
  5. 5.
    Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Springer, New York (1990)CrossRefMATHGoogle Scholar
  6. 6.
    Davenport, H.: The Higher Arithmetic, 7th edn. Cambridge University Press, Cambridge (1999)MATHGoogle Scholar
  7. 7.
    Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (2010)Google Scholar
  8. 8.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. PHI Learning Pvt. Ltd., New York (2011)Google Scholar
  9. 9.
    Knuth, D.E.: The Art of Computer Programming, vols. I and II. Addison-Wesley, Reading (1973)Google Scholar
  10. 10.
    Koblitz, N.: A Course in Number Theory and Cryptography, 2nd edn. Springer, Berlin (1994)CrossRefMATHGoogle Scholar
  11. 11.
    Niven, I., Zuckerman, H.S., Montgomery, H.L.: An Introduction to the Theory of Numbers, 5th edn. Wiley, New York (2006)Google Scholar
  12. 12.
    Rosen, K.H.: Discrete Mathematics and Its Application, 4th edn. Tata McGraw-Hill Publishing Company Limited, New Delhi (1999)Google Scholar
  13. 13.
    Silverman, J.H.: A Friendly Introduction to Number Theory, 3rd edn. Prentice Hall, Upper Saddle River (2011)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  • Aakash Paul
    • 1
  • Somjit Datta
    • 2
  • Saransh Sharma
    • 1
  • Subhashis Majumder
    • 1
  1. 1.Department of Computer Science and EngineeringHeritage Institute of TechnologyKolkataIndia
  2. 2.Department of MathematicsHeritage Institute of TechnologyKolkataIndia

Personalised recommendations