CFP last date
20 December 2024
Reseach Article

Cryptographic Scheme for Digital Signals using Finite State Machines

by B.Krishna Gandhi, Dr.A.Chandra Sekhar, S.Srilakshmi
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 29 - Number 6
Year of Publication: 2011
Authors: B.Krishna Gandhi, Dr.A.Chandra Sekhar, S.Srilakshmi
10.5120/3565-4904

B.Krishna Gandhi, Dr.A.Chandra Sekhar, S.Srilakshmi . Cryptographic Scheme for Digital Signals using Finite State Machines. International Journal of Computer Applications. 29, 6 ( September 2011), 61-63. DOI=10.5120/3565-4904

@article{ 10.5120/3565-4904,
author = { B.Krishna Gandhi, Dr.A.Chandra Sekhar, S.Srilakshmi },
title = { Cryptographic Scheme for Digital Signals using Finite State Machines },
journal = { International Journal of Computer Applications },
issue_date = { September 2011 },
volume = { 29 },
number = { 6 },
month = { September },
year = { 2011 },
issn = { 0975-8887 },
pages = { 61-63 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume29/number6/3565-4904/ },
doi = { 10.5120/3565-4904 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:15:07.857365+05:30
%A B.Krishna Gandhi
%A Dr.A.Chandra Sekhar
%A S.Srilakshmi
%T Cryptographic Scheme for Digital Signals using Finite State Machines
%J International Journal of Computer Applications
%@ 0975-8887
%V 29
%N 6
%P 61-63
%D 2011
%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. In the present paper, new cryptographic schemes are proposed using finite state machine and recurrence matrix.

References
  1. A.P. Stakhov, ”The ‘‘golden’’ matrices and a new kind of cryptography”, Chaos, Soltions and Fractals 32( (2007) pp1138–1146
  2. A.P. Stakhov. “The golden section and modern harmony mathematics. Applications of Fibonacci numbers,”7,Kluwer Academic Publishers; (1998). pp393–99.
  3. A.P. Stakhov. “The golden section in the measurement theory”. Compute Math Appl; 17(1989):pp613–638.
  4. K.R.Sudha , A.chandra Sekhar ,Prasad Reddy P.V.G.D. “ Cryptography protection of Digital Signals using some recurrence relations” International Journal of Computer Science and Network security, Vol (7) no 5 m may 2007 ,203-207.
  5. D.Sravan Kumar.Ch.Suneetha A.Chandra Sekhar “ Encryption of Data streams using Paul’s spin ½ matrices”, International Journal of Engineering science and Technology. Vol2(6), 2010, 2024 -2028.
  6. Adesh K.Pandey. reprint 2009, “An introduction to automata theory and formal languages ‘S.K.Kararia & sons. New Delhi.
  7. A.Menezed, P.Van Oorschot and S.Vanstone Hand book of Applied Cryptography e-Book
  8. W. Y. YE Yongwei and YANG
  9. 4Qinghua, (2003) “Magic cube encryption for digital image using chaotic sequence”, Journal of Zhejiang University of Technology, 31(2):173–176.
  10. Z. L. Z. X. feng and FAN Jiu-lun, (2007) “A digital image encryption algorithm based onchaotic sequences”, Microelectronics & Computer, 2.
  11. 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

Keywords

Moore Machine key recurrence relation cryptography