Encryption and Decryption Scheme by Using Finite State Machine

G. Karudaiyar¹, S. Karthikeyan² and B. Sainath³

^1,3 Master of Engineering, Embedded System, Sathyabama University, India. ²Assistant Professor,Electronics And Communication,Sathyabama University, India.

ABSTRACT: Cryptography is the science of using mathematics to encrypt and decrypt information. Encryption is the process of masking information to make it unreadable without a key approach. Secrecy is to be maintained for confidential communications. Decryption is the process of extracting the original information from the encrypted data. In This Approach secrecy is maintained by using finite state machine. Fibonacci series are the series of numbers in which each number is the sum of the foregoing numbers.Moore Machine is one of the finite state machine that is being used. Recurrence relations are recursive definitions of mathematical functions or sequences. In this paper cryptographic scheme using Moore machine is applied to verify is result on Fibonacci numbers.

KEYWORDS: Fibonacci; MooreMachine; Recurrence Relation

This work is licensed under a Creative Commons Attribution 4.0 International License.