• FINITE STATE MACHINES AND RECURRENCE MATRICES OF CRYPTOLOGY

Abstract

Cryptology is the process of Cryptography (Encryption) and Cryptanalysis (Decryption). The application of Mathematical models playing a vital role in the security goals and consequently the security attacks for secure communication. The cracking of the code is also a major challenge in recent times. In this process the role of mathematics is, defining a function for encryption in such a way that tracing the inverse of the function must be a difficult process. The fundamental mathematical model in cryptology is the concept of Matrices and in particular nonsingular matrices. In this paper we proposed an innovative technique for cryptology using Finite State Machines (FSM) and matrices obtained from recurrence relations.