Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

A Block Cipher Using Graph Structures and Logical XOR Operation

International Journal of Computer Applications
© 2011 by IJCA Journal
Volume 33 - Number 7
Year of Publication: 2011
CH. Suneetha
D. Sravan Kumar
A.Chandra sekhar

CH. Suneetha, Sravan D Kumar and A.Chandra sekhar. Article: A Block Cipher Using Graph Structures and Logical XOR Operation. International Journal of Computer Applications 33(7):6-10, November 2011. Full text available. BibTeX

	author = {CH. Suneetha and D. Sravan Kumar and A.Chandra sekhar},
	title = {Article: A Block Cipher Using Graph Structures and Logical XOR Operation},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {33},
	number = {7},
	pages = {6-10},
	month = {November},
	note = {Full text available}


Cryptography is the science of making and breaking the secret communications. Due to wide spread use of internet in modern times virtually every computer in the world is connected to every other computer. So, there is a threat of hacking and stealing of the message. In general cryptographic primitives are designed to satisfy particular security objectives which may be built from the basic features of confidentiality and authentication. In the present paper a new block cipher encryption is proposed using adjacency matrix of undirected graph structures. In addition logical XOR operation is technically applied to get a good avalanche effect which is one of the desired properties of a good encryption algorithm.


  • Amos Beimel, Tal Malkin, Kobbi Nissim and Enav Weinreb, “How should we solve search problems privately”, Journal of Cryptology, Springer 2010, Volume-23, Number- 2, pages 344-371.
  • Anna M. Johnston, Peter S. Gemmell, “Authenticated key exchange Provably Secure against the Man-in-Middle Attack”, Journal of Cryptology (2002) Vol. 15 Number 2 pages 139-148.
  • C. Blundo, A. Santis, D.R. Stinson and U. Vaccaro “Graph decompositions and secret sharing schemes”, Journal of Cryptology, 1995, Vol.8, No.1, pgs 39-64.
  • Carlistle Aams and Stafford Tavares, “The Structured Design of Cryptographically good s-boxes, Journal of Cryptology, 1990, Vol.3, No.1, Pages 27-41.
  • Eli Biham, “Cryptanalysis of multiples modes of operation”, Journal of Cryptology, 1998, Vol.11, No.1,pgs 45-58.
  • Ivan B. Damgard and Lars R, Kundsen, “Two-key Triple Encryption” Journal of Cryptology (1998), Vol. 11, Number 3, pages 209-218.
  • John Blaack and Phillip Rogaway “CBC MACs for Arbitrary-Length Messages: The Three-key constructions” Journal of cryptology(2005) Vol. 18 pages 111-131.
  • J. Kelesey B. Schneir and D. Wagner, “key-schedule cryptanalysis of IDEA,G-DEA,GOST,SAFER and triple- DES. In N. Koblitz editor”, Advances in cryptology- Proc.CRYPTO’96, LNCS 1109, pages 237-251.Spro;nger- Verlag Berlin 1996.
  • B. Krishna Gandhi, A. Chandra Sekhar and PVDG Prasad Reddy “Cryptographic schemes for digital signals”, IETECH International Journal of Advanced Computations, ACo817, 2007.
  • B. Krishna Gandhi, A. Chandra Sekhar and S. Srilakshmi “Cryptographic schesmes for digital signals using finite state machines”, International Journal of Computer Applications, Vol.29, No.6,Sept-2011.
  • Lorenz Minder and Alistair Sinclair, “The Extended k-tree Algorithm” Journal of cryptologyDOI: 10.1007/s00145-011- 9097-y.
  • Steve Lu, Dameil Machala and Rafail Osterousky, “Visual Cryptography using graphs”, J. Comb Optim, 21:47-66, DOI 10.1007?s 10878-009-9241-x.
  • 13. Victor Shoup and Rosario Gennaro “Securing Threshold Cryptosystems against Chosen Cipher text Attack, Journal of Cryptology (2002) Vol15,Number2 pages75-96.
  • 14. Yvo Desmedt, Josef Piprzyk, Ron Sternfield, Xiaoming Sun and Tartary, “Graph Coloring Applied to Secure Computation in Non-Abilian Groups”, Journal of Cryptology, Springer, online from 5th September 2011.