CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Block Cipher Using Graph Structures and Logical XOR Operation

by CH. Suneetha, D. Sravan Kumar, A.Chandra sekhar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 33 - Number 7
Year of Publication: 2011
Authors: CH. Suneetha, D. Sravan Kumar, A.Chandra sekhar
10.5120/4030-5753

CH. Suneetha, D. Sravan Kumar, A.Chandra sekhar . A Block Cipher Using Graph Structures and Logical XOR Operation. International Journal of Computer Applications. 33, 7 ( November 2011), 6-10. DOI=10.5120/4030-5753

@article{ 10.5120/4030-5753,
author = { CH. Suneetha, D. Sravan Kumar, A.Chandra sekhar },
title = { A Block Cipher Using Graph Structures and Logical XOR Operation },
journal = { International Journal of Computer Applications },
issue_date = { November 2011 },
volume = { 33 },
number = { 7 },
month = { November },
year = { 2011 },
issn = { 0975-8887 },
pages = { 6-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume33/number7/4030-5753/ },
doi = { 10.5120/4030-5753 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:19:31.786324+05:30
%A CH. Suneetha
%A D. Sravan Kumar
%A A.Chandra sekhar
%T A Block Cipher Using Graph Structures and Logical XOR Operation
%J International Journal of Computer Applications
%@ 0975-8887
%V 33
%N 7
%P 6-10
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. 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.
  2. 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.
  3. 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.
  4. Carlistle Aams and Stafford Tavares, “The Structured Design of Cryptographically good s-boxes, Journal of Cryptology, 1990, Vol.3, No.1, Pages 27-41.
  5. Eli Biham, “Cryptanalysis of multiples modes of operation”, Journal of Cryptology, 1998, Vol.11, No.1,pgs 45-58.
  6. Ivan B. Damgard and Lars R, Kundsen, “Two-key Triple Encryption” Journal of Cryptology (1998), Vol. 11, Number 3, pages 209-218.
  7. John Blaack and Phillip Rogaway “CBC MACs for Arbitrary-Length Messages: The Three-key constructions” Journal of cryptology(2005) Vol. 18 pages 111-131.
  8. 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.
  9. B. Krishna Gandhi, A. Chandra Sekhar and PVDG Prasad Reddy “Cryptographic schemes for digital signals”, IETECH International Journal of Advanced Computations, ACo817, 2007.
  10. 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.
  11. Lorenz Minder and Alistair Sinclair, “The Extended k-tree Algorithm” Journal of cryptologyDOI: 10.1007/s00145-011- 9097-y.
  12. 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. 13. Victor Shoup and Rosario Gennaro “Securing Threshold Cryptosystems against Chosen Cipher text Attack, Journal of Cryptology (2002) Vol15,Number2 pages75-96.
  14. 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.
Index Terms

Computer Science
Information Sciences

Keywords

Adjacency matrix Logical XOR operation Decryption. Encryption

Powered by PhDFocusTM