Call for Paper - November 2020 Edition
IJCA solicits original research papers for the November 2020 Edition. Last date of manuscript submission is October 20, 2020. Read More

A Cryptographic Scheme of Finite Fields using Logical Operators

Print
PDF
International Journal of Computer Applications
© 2011 by IJCA Journal
Number 1 - Article 1
Year of Publication: 2011
Authors:
G.Naga Lakshmi
B.Ravi Kumar
Ch.Suneetha
A.Chandra Sekhar
10.5120/3809-5259

G.Naga Lakshmi, B.Ravi Kumar, Ch.Suneetha and A.Chandra Sekhar. Article:A Cryptographic Scheme of Finite Fields using Logical Operators. International Journal of Computer Applications 31(4):1-4, October 2011. Full text available. BibTeX

@article{key:article,
	author = {G.Naga Lakshmi and B.Ravi Kumar and Ch.Suneetha and A.Chandra Sekhar},
	title = {Article:A Cryptographic Scheme of Finite Fields using Logical Operators},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {31},
	number = {4},
	pages = {1-4},
	month = {October},
	note = {Full text available}
}

Abstract

Cryptography is the study of methods of sending messages in disguised form so that only the intended recipients can remove the disguise and read the massage. With widespread availability of computer technology, the rapid growth of wireless communications secured exchange of information has become a challenging task. The most basic of the modules in modern cryptography is that of a primitive, which may be regarded as a cryptographic building block which performs one or more desired functions, and may be combined with others to form a cryptographic protocol. The most well-known and perhaps the simplest primitive is encryption, which allows parties to achieve confidential data transmission over an insecure channel. In the present paper we proposed a cryptographic technique using elements of a finite field and logical operators basing on inverse property. To test the efficacy of the proposed scheme the cryptanalysis is performed.

Reference

  • A.P. Stakhov, “The golden matrices and a new kind of Cryptography”, Chaos, Solution and Fractals 32(2007) pp1138-1146.
  • Bon Wook Hwan Seok Jang Hwan Song, “On Constructing a 32x32 binary matrices as a Di ussinsg Layer for a 256-Bit Block Cipher, Lecture Notes in Computer Science, 2006 Vol.4296/2006,51-64.
  • Chen-Hun-Chen, YenJui-Cheng and Guo Juin-In, “Design a New Cryptography system”, Lecture Notes in Computer Science 2002, Vol. 2532/2002, 211-219.
  • Hun-Chen Chen, Jui Cheng Yen, “A new Cryptography systems and its VISI Realization”, Journal of Systems Architecture, Vol.49, Issues 7-9, October 2003, pages 355-367.
  • Martine Hell and Thomas Johnson, “Breaking the Stream Cipher F-FCSR- H and F-FCSR-16 in Real Time”, Journal of Cryptology, October 2009.
  • Wang Pengjun Lu Jingang Jian Xu and Jing Dai, “Power Optimization algorithm based on XNOR/OR logic”, Journal of Electronics Vol. 26, 2009-Issue (1), 138-144.
  • Xevgenity Dodis and John Steinberg, “Message Authentication Codes from Unpredictable Block Ciphers”, Lecture Notes in Computer Science, Vol.5677/2009.
  • D.Sravana Kumar, Ch.Suneetha and A.Chandra Sekhar “ A Block Cipher Using Logical XNOR and NOT Operations”. International Journal of Science and Advanced Technology (ISSN 2221-8386) Volume 1 No 4 June2011.