Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Information Security using Z Transforms and Finite State Machine


Affiliations
1 Department of Mathematics, J.N.T.U. (A) College of Engineering Ananthapuramu –A.P. 515001, India
     

   Subscribe/Renew Journal


Information security is the most burning topic in the field of computer science and engineering. Encoding is a very easy process but decoding is not so easy unless we know the apt key. Key management is very important in cryptology. Generating dynamic keys is most essential now a days and also the cipher text.

In mathematics the Z transforms converts discrete data sequence, which is real or complex in to complex domain. It is useful in many areas such as digital Signal processing, control theory, economics etc.

Automata theory is the study of abstract computing devices or machines. In computer science we find many examples of finite state system and the theory of finite state systems, as a useful design tool for these systems.

In the present paper an innovative technique for encrypting and hiding the data is proposed based on finite state machines and Z transformation. The efficacy of the proposed method is analysed, and the analysis shows an improved cryptographic protection in digital signals.


Keywords

Cryptography, Finite State Machine, Moore Machine, Z Transformation of Discrete Signal and Modular Arithmetic.
Subscription Login to verify subscription
User
Notifications
Font Size


  • A. Menezed, P. Van Oorschot and S. Vanstone Hand book of Applied Cryptography e-Book.
  • Ciphers: http://en.wikipedia.org/wiki/Cipher.
  • W. Stallings; “Cryptography and Network Security” 2nd Edition, Prentice Hall, 1999.
  • Bruce Schneier: Applied Piper, “Encryption”. Security and Detection, Ecos 97. European Conference;
  • Adesh K. Pandey. Reprint 2009, “An introduction to automata theory and formal languages „S.K. Kararia and sons. New Delhi.
  • John E. Hopcroft, Rajeev Motwain, Jeffrey D.Ulman. “Introduction to automata theory, language, and computation” Vanstone3rd imp.
  • B. Krishna Gandhi, A. Chandra Sekhar, S. Srilakshmi “Cryptographic scheme for digital signals using finite state machine” international journal of computer applications (September 2011)
  • S. Srilakshmi “New encryption schemes using Laplace transformation and Finite state machine ”IJIRSETVol3 Issue 13 July 2017.

Abstract Views: 569

PDF Views: 0




  • Information Security using Z Transforms and Finite State Machine

Abstract Views: 569  |  PDF Views: 0

Authors

Sirivaram Srilakshmi
Department of Mathematics, J.N.T.U. (A) College of Engineering Ananthapuramu –A.P. 515001, India

Abstract


Information security is the most burning topic in the field of computer science and engineering. Encoding is a very easy process but decoding is not so easy unless we know the apt key. Key management is very important in cryptology. Generating dynamic keys is most essential now a days and also the cipher text.

In mathematics the Z transforms converts discrete data sequence, which is real or complex in to complex domain. It is useful in many areas such as digital Signal processing, control theory, economics etc.

Automata theory is the study of abstract computing devices or machines. In computer science we find many examples of finite state system and the theory of finite state systems, as a useful design tool for these systems.

In the present paper an innovative technique for encrypting and hiding the data is proposed based on finite state machines and Z transformation. The efficacy of the proposed method is analysed, and the analysis shows an improved cryptographic protection in digital signals.


Keywords


Cryptography, Finite State Machine, Moore Machine, Z Transformation of Discrete Signal and Modular Arithmetic.

References