Kumari, Sarita (2013) Recurrent Sequences and Cryptography. MSc thesis.
![[img]](/style/images/fileicons/application_pdf.png) | PDF 822Kb |
Abstract
Fibonacci numbers are defined as recursively as F_(n+1)=F_n+F_(n-1) with initial conditions F_1=F_2=1. Lucas numbers also enjoys the same recurrence relation but with different initial conditions L_1=1,L_2=3. Large prims are very useful in public key cryptography. Lucas numbers can also be exploited for these purposes
| Item Type: | Thesis ( MSc) |
|---|---|
| Uncontrolled Keywords: | Recurrence relation, Cryptography, RSA Algorithm, Diffie-Hellman Algorithm, Digital Signatures. Public Key |
| Subjects: | Mathematics and Statistics > Applied Mathematics |
| Divisions: | Sciences > Department of Mathematics |
| ID Code: | 5318 |
| Deposited By: | Hemanta Biswal |
| Deposited On: | 17 Dec 2013 10:21 |
| Last Modified: | 17 Dec 2013 10:21 |
| Supervisor(s): | Panda, G K |
Repository Staff Only: item control page
