Total views : 257

An IND-CCA2 Secure Public Key Cryptographic Protocol using Suzuki 2-Group

Affiliations

  • Department of Applied Mathematics, Yeshwantrao Chavan College of Engineering, Wanadongari, Nagpur - 441110, Maharashtra, India

Abstract


Objectives: The public key cryptographic protocol is one of the most important fields in computer security. These new public key cryptographic protocols provide high security as compare to past results in the same field. Methods/Statistical Analysis: Public key cryptographic is a protocol of transferring private info and data through open network communication, so only the receiver who has the secret key can read the encrypted messages which might be documents, phone conversations, images or other form of data. To implement privacy simply by encrypting the information intended to remain secret can be achieved by using methods of public key cryptography. Findings: In this study, we propose the new IND-CCA2 secure public key cryptographic protocol using the concept of integral coefficient ring polynomial based on Suzuki 2-group. We demonstrated the security of proposed public key cryptographic protocol in the adaptively chosen cipher text secure (IND-CCA2) in the random oracle model. Application/Improvements: We discussed the new strategy with change over an IND-CPA public key cryptographic protocol into an IND-CCA2 cryptographic protocol.

Keywords

IND-CCA2, Public Key Cryptography, Ring Polynomial, Random Oracle, Suzuki 2-Group.

Full Text:

 |  (PDF views: 221)

References


  • Diffie W, Hellma ME. New directions in cryptography. Institute of Electrical and Electronics Engineers (IEEE) Transactions on Information Theory.1976 Nov; 22(6):644– 54. Crossref
  • Wagner NR, Magyarik MR. A public-key cryptosystem based on the word problem. In Blakley GR, Chaum D editors. Workshop on the Theory and Application of Cryptographic Techniques (CRYPTO), Advances in Cryptology, Lecture Notes in Computer Science (LNCS), Springer- Verlag. 1985; 196:19–36. Crossref
  • Birget J, Magliveras SS, Sramka M. On public-key cryptosystems based on combinatorial group theory [Internet]. 2005 [cited 2005 Jan]. Available from: Crossref.
  • Anshel I, Anshel M, Goldfeld D. An algebraic method for public-key cryptography. Mathematical Research Letters. 1999; 6(3):287–91. Crossref
  • Ko KH, Lee SJ, Cheon JH, Han JW et al. Public-key cryptosystem using braid groups. In Bellare M editor. Annual International Cryptology Conference, Advances in Cryptology — CRYPTO, Lecture Notes in Computer Science (LNCS), Springer-Verlag. 2000 Aug 11; 1880:166–83. Crossref.
  • Paeng S–H, Ha K–C, Kim J–H, Chee S, Park C. New public key cryptosystem using finite non Abelian groups. In Kilian J editor. Annual International Cryptology Conference, Advances in Cryptology — CRYPTO, Lecture Notes in Computer Science (LNCS), Springer-Verlag. 2001 Aug 2; 2139:470–85.
  • Paeng S.H, D. Kwon, K.-C. Ha, J. H. New Kim. Improved public key cryptosystem using finite non abelian groups,Cryptology ePrint. 2001. Archive: Report 2001/066.
  • Magliveras SS, Stinson DR, Trung TV. New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups. Journal of Cryptology. 2002 Sep; 15(4):285–97.
  • Grigoriev D, Ponomarenko I. On non-abelian homomorphic public-key crypto systems [Internet]. 2002 [updated 2002 Nov 14; cited 2002 Jul 23]. Available from: Crossref
  • Grigoriev D, Ponomarenko I. Homomorphic public-key cryptosystems over groups and rings [Internet]. 2003 [cited 2003 Sep 8]. Available from: Crossref.
  • Eick B, Kahrobaei D. Polycyclic groups: a new platform for cryptography [Internet]. 2004 [cited 2004 Nov 3]. Available from: Crossref.
  • Birman J, Ko KH, Lee SJ. A new approach to the word and conjugacy problems in the braid groups. Advances in Mathematics, ScienceDirect.1998 Nov 10; 139(2):322–53. Crossref
  • Birman J, Ko KH, Lee SJ. The infimum, supremum, and geodesic length of a braid conjugacy class. Advances in Mathematics, ScienceDirect. 2001 Dec 1; 164(1):41–56. Crossref
  • El-Rifai EA, Morton HR. Algorithms for positive braids. The Quarterly Journal of Mathematics, Oxford Academic. 1994 Dec 1; 45(4):479–97. Crossref
  • Gebhardt V. A new approach to the conjugacy problem in Garside groups [Internet]. 2003 [updated 2003 Oct 21; cited 2003 Jun 12]. Available from: Crossref.
  • Gonzales-Meneses J. Improving an algorithm to solve the multiple simultaneous conjugacy problems in braid groups [Internet]. 2002 [cited 2002 Dec 10]. Available from: Crossref.
  • Higman G. Suzuki 2-groups. Illinois Journal of Mathematics. 1963; 7:79–96.
  • Fujisaki E, Okamoto T. How to enhance the security of public key encryption at minimum cost. In Imai H, Zheng Y editors. International Workshop on Public Key Cryptography, Public Key Cryptography (PKC), Lecture Notes in Computer Science (LNCS), Springer-Verlag.1999 Oct 29; 1560:53–68.
  • Meshram A, Meshram C, Khobragade N. An IND-CPA Secure PKC Technique Based On Dihedral Group. Indian Journal of Computer Science and Engineering, 2017 Apr..

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.