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.
Highlights
Overview of different methods and techniques used in signal protection in golden cryptography, Sudha K.R., A.ChandraSekha, Prasad Reddy in 2007 says that the Communications security is very importance in electronic communications.Swain Sujata, Pratihary Chidananda and Ray PrasantaKumar ( 2016) proposed that the method is well known that, recursive relation for the sequence are an equation that relates to certain of its preceding termsInitial conditions for the sequence are explicitly given values for a finite number of the terms of the sequence.GOLDEN MATRIX If x is a real number the mathematical form of golden matrices is defined as:................ (1)We can be used recurrence relations for both equilibrium and Lucas – balancing numbers and investigates all application to cryptography
From the results in the preceding section, we can conclude that this new proposed generalized cryptosystem based on k-Fibonacci numbers is more secure than the original golden cryptography against chosen-plaintext attacks
This new proposed generalized cryptosystem based on k-Fibonacci numbers is more secure than the original golden cryptography against chosen plaintext attack
Summary
Overview of different methods and techniques used in signal protection in golden cryptography, Sudha K.R., A.Chandra. GOLDEN MATRIX If x is a real number the mathematical form of golden matrices is defined as: We can be used recurrence relations for both equilibrium and Lucas – balancing numbers and investigates all application to cryptography. LUCAS NUMBER This is the recurrence formula of Lucas numbers LKthen defined the equation: These are the (2 ) matrix LUCAS BALANCING NUMBER This is the recurrence formula of Lucas-balancing numbers Cn . The equations 1and 2 are called golden matrices These recurrence relations are useful in some counting problems such as Fibonacci numbers, Balancing numbers, Lucas- balancing numbers, Lucas numbers, etc. Esh Narayan*, Research Scholar,Computer Science and Engineering, IFTM University, Moradabad.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
