Research Article

ENCRYPTIONS OF DATA STREAMS USING PAULI SPIN Ω MATRICES AND FINITE STATE MACHINE

by  B. Krishna Gandhi, A. Chandra Sekhar, S. Sri Lakshmi
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 37 - Issue 2
Published: January 2012
Authors: B. Krishna Gandhi, A. Chandra Sekhar, S. Sri Lakshmi
10.5120/4578-6497
PDF

B. Krishna Gandhi, A. Chandra Sekhar, S. Sri Lakshmi . ENCRYPTIONS OF DATA STREAMS USING PAULI SPIN Ω MATRICES AND FINITE STATE MACHINE. International Journal of Computer Applications. 37, 2 (January 2012), 8-12. DOI=10.5120/4578-6497 

                        @article{ 10.5120/4578-6497,
                        author  = { B. Krishna Gandhi,A. Chandra Sekhar,S. Sri Lakshmi },
                        title   = { ENCRYPTIONS OF DATA STREAMS USING PAULI SPIN Ω MATRICES AND FINITE STATE MACHINE },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 37 },
                        number  = { 2 },
                        pages   = { 8-12 },
                        doi     = { 10.5120/4578-6497 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2012
                        %A B. Krishna Gandhi
                        %A A. Chandra Sekhar
                        %A S. Sri Lakshmi
                        %T ENCRYPTIONS OF DATA STREAMS USING PAULI SPIN Ω MATRICES AND FINITE STATE MACHINE%T 
                        %J International Journal of Computer Applications
                        %V 37
                        %N 2
                        %P 8-12
                        %R 10.5120/4578-6497
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Cryptography is the science of transmission and reception of secret messages. Recently electronic communication has become an essential part of every aspect of human life. Message encryption has become very essential to avoid the threat against possible attacks by hackers during transmission process of the message. Finite state machines (FSM), also known as finite state automation (FSA), at their simplest, are models of the behaviors of a system or a complex object, with a limited number of defined conditions or modes, where mode transitions change with circumstance. In the present paper, new cryptographic scheme is proposed using finite state machine and Pauli spins ¬Ω matrices.

References
  • B.Krishna Gandhi, .A.Chandra Sekhar, S.Srilakshmi (September 2011) ‚ÄúCryptographic scheme for digital signals using finite state machine‚Äù international journal of computer applications.
  • A.Chandra Sekhar,D.Sravana Kumar and CH.Suneetha, ‚ÄúEncryption of Data Streams using Boolean Matrices, Proceedings of International conference on challenges and application of Mathematics in Technology ed. By S.Chakravaty(Advanced Research series, Macmillan Publishers India Ltd., 2010),pp.523-531.
  • D.Sravana Kumar, CH.Suneetha and A.Chandra Sekhar ‚Äú Encryption of Data Streams using Pauli spins ¬Ω matrices‚Äù International journal of Engineering Science and Technology Vol . 2(6), 2010, 2020-2028. [4 ]A.P.Stakhov ‚Äú The Golden matrices and a new kind of cryptography‚Äù chaos, solutions and Fractals 32(2007) pp1138-1146.
  • Adesh K.Pandey. reprint 2009, ‚ÄúAn introduction to automata theory and formal languages ‚ÄòS.K.Kararia & sons. New Delhi.
  • A.Menezed, P.Van Oorschot and S.Vanstone Hand book of Applied Cryptography e-Book.
  • John E.Hopcroft, Rajeev Motwain, Jeffrey D.Ulman. ‚Äú Introduction to automata theory,language,and computation‚Äù Vanstone3rd impression,2007 CRC Press., Dorling Kindersley (India) Pvt.Ltd.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Moore Machine key recurrence relation cryptography Pauli Spin 1/2 matrices Quantum Mechanics Entanglement

Powered by PhDFocusTM