Open Access Open Access  Restricted Access Subscription Access

On the Extension of the Domain of Rabin Cryptosystem


Affiliations
1 Department of Computer Science and Engineering, Mody University of Science and Technology, Lakshmangarh, India
 

   Subscribe/Renew Journal


The Rabin cryptosystem is an asymmetric cryptographic algorithm. Its security is based on the problem of integer factorization. Rabin cryptosystem has the advantage that the problem on which its security depends is proved to be as hard as factorization. The Rabin cryptosystem works in the domain of the odd primes which satisfy the criteria that ๐‘โ‰ก3 (๐‘š๐‘œ๐‘‘ 4), where ๐‘ is any odd prime. The decryption process is very difficult when we take the odd primes which satisfy ๐‘โ‰ก1 (๐‘š๐‘œ๐‘‘ 4). Rabin cryptosystem will be more applicable and flexible if we include a wide range of primes. We have extended the domain of primes in Rabin cryptosystem to a subset of the primes satisfying ๐‘โ‰ก5 (๐‘š๐‘œ๐‘‘ 8). The primes satisfying ๐‘โ‰ก5 (๐‘š๐‘œ๐‘‘ 8) forms a subset of the primes satisfying ๐‘โ‰ก1 (๐‘š๐‘œ๐‘‘ 4) without compromising on the security of the Rabin cryptosystem. Our proposed method covers a larger range of primes for the Rabin cryptosystem as compared to original method. Our method is especially useful for resource constrained Networks such as Mobile Ad Hoc Networks (MANET).

Keywords

Rabin Cryptosystem, Cipher Text, Integer Factorization, Mobile Ad Hoc Networks (MANET).
User
Subscription Login to verify subscription
Notifications
Font Size

  • Behrouz A. Forouzan, Debdeep Mukhopadhyay, โ€œCryptography and Network Securityโ€, Tata McGraw Hill education private limited โ€“ New Delhi, second edition, 2011.
  • Ming Yung Ko, T. Hwang and C.C. Chang โ€œAttacks on ID based signature scheme based upon Rabinโ€™s public key cryptosystemโ€ in IEEE International Carnahan Conference on Security Technology, 1993.
  • Michele Elia, MatteoPiya, David Eschipani,โ€The Rabin Cryptosystem Revisitedโ€, Applied Algebra in Engineering, Communication and Computing, Volume 26 Issue 3, 2015, pp 251-275.
  • Josef H. Silverman, โ€œA friendly introduction to number theoryโ€, Pearson education, 3rd edition , 2009.
  • C.C.Chang & C.H.Lin โ€œAn ID based signature scheme based upon Rabin public key cryptosystemโ€ IEEE 1991.
  • William Stallings, โ€œCryptography and Network Security Principles and Practiceโ€, Pearson, Fifth Edition, 2011.
  • Jonathan Katz, Yehuda Lindell, โ€œIntroduction to Modern Cryptographyโ€, CRC Press, second edition, 2016.
  • D.R.Stinson,โ€Cryptography Theory and Practiceโ€CRC Press, Third Edition, 2013.
  • Wade Trappe, Lawrence C. Washington,โ€ Introduction to Cryptography with Coding Theoryโ€, Pearson Education, second edition, 2012.
  • Wenbo Mao, โ€œModern Cryptography Theory and Practiceโ€, Pearson Education, 2015 reprint.

Abstract Views: 294

PDF Views: 132




  • On the Extension of the Domain of Rabin Cryptosystem

Abstract Views: 294  |  PDF Views: 132

Authors

Nisheeth Saxena
Department of Computer Science and Engineering, Mody University of Science and Technology, Lakshmangarh, India

Abstract


The Rabin cryptosystem is an asymmetric cryptographic algorithm. Its security is based on the problem of integer factorization. Rabin cryptosystem has the advantage that the problem on which its security depends is proved to be as hard as factorization. The Rabin cryptosystem works in the domain of the odd primes which satisfy the criteria that ๐‘โ‰ก3 (๐‘š๐‘œ๐‘‘ 4), where ๐‘ is any odd prime. The decryption process is very difficult when we take the odd primes which satisfy ๐‘โ‰ก1 (๐‘š๐‘œ๐‘‘ 4). Rabin cryptosystem will be more applicable and flexible if we include a wide range of primes. We have extended the domain of primes in Rabin cryptosystem to a subset of the primes satisfying ๐‘โ‰ก5 (๐‘š๐‘œ๐‘‘ 8). The primes satisfying ๐‘โ‰ก5 (๐‘š๐‘œ๐‘‘ 8) forms a subset of the primes satisfying ๐‘โ‰ก1 (๐‘š๐‘œ๐‘‘ 4) without compromising on the security of the Rabin cryptosystem. Our proposed method covers a larger range of primes for the Rabin cryptosystem as compared to original method. Our method is especially useful for resource constrained Networks such as Mobile Ad Hoc Networks (MANET).

Keywords


Rabin Cryptosystem, Cipher Text, Integer Factorization, Mobile Ad Hoc Networks (MANET).

References