On finite state machines and recursive functions application to cryptosystems

Abstract

It is well known that Cryptography is a branch of science which deals with newlinecommunicating original message by encryption and decryption method using ciphers. newlineA cipher (Cryptographic algorithm)is a mathematical function used in the encryption newlineand decryption process which works in combination with a key to encrypt the plain newlinetext. The same plain text encrypts to different cipher text with different keys. A newlinecipher all possible keys and all the protocols that make the cipher work comprise a newlinecryptosystem. newlineA finite state machine is a model behavior composed of a finite number of newlinestates, transitions between those states and actions. Its applications include analysis newlineof digital evidence for finding weaknesses in the forensic analysis of criminal and newlinecivil investigations. Also, finite state machine approach is widely used in handling newlineunexpected events in defense security zones and video gaming industry. newlineWe would like to study the methods in implementing finite state machine newlineusing cryptosystem analysis by mathematical devices like matrices, generating newlinefunctions and recursive functions. newline