Cryptography Protection of Digital Signals using Fibonacci – Pell Transformation via Golden Matrix
Esh Narayan1, Abhishek Mishra2, Sunil Kr. Singh3

1Esh Narayan*, Research Scholar,Computer Science and Engineering, IFTM University, Moradabad
2Dr. Abhishek Mishra, Associate Professor, Computer Science and Engineering, IFTM University, Moradabad
3Sunil Kr. Singh, Research Scholar, Electrical Engineering, IFTM University, Moradabad

Manuscript received on December 02, 2020. | Revised Manuscript received on December 05, 2020. | Manuscript published on December 30, 2020. | PP: 188-194 | Volume-10 Issue-2, December 2020. | Retrieval Number: 100.1/ijeat.B20691210220 | DOI: 100.1/ijeat.B20691210220
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: At this time the security of communication can be the important role of electronic communication. In this paper we can discuss the new transform for the protection of digital signals using with golden matrix. Fibonacci – Pell (FP) Transform can be find sufficient results to secure the signals and the aims of this paper to describe the security of signals using new type of recurrence formula. The recurrence relation can be find sufficient results to secure the signals. Multiple encryptions are used in this algorithm. Fibonacci – Pell (FP) Transform used for encryption and affine cipher can be used for super encryption. It ensures that to secure the data from attackers in this cryptographic method is fast and simple.
Keywords: Golden cryptography (GC), Golden Matrix (GM), Fibonacci – Pell (FP) Transform, Recurrence Relation (RR), Learning Algorithm Improves (LAI)