Application of Ackermann’s Recurrence Relation and Moore Machine on Cryptography

Digital communication has emerged as an important aspect in today’s world. Due to which we need to secure the data to a great extent otherwise there will be data loss. Various methods have been developing day by day to ensure data protection high level. This paper is based on the application of recurrence relation namely, Ackermann’s function, and using concept of Moore machine in Cryptography. Encryption and Decryption can be done by the aforesaid methods in order to pass the message from sender to receiver securely.