35
Views
0
CrossRef citations to date
0
Altmetric
Research Article

A type of public cryptosystem using polynomials and pell sequences

, , &

References

  • Buchman “Introduction to cryptography” Springer-verlag 200
  • Neal Koblitz “A course in number theory and cryptography” IBSN 3-578071-8 SPIN 10893308.
  • K.H. Rosen “Elementary number theory and its applications” Third edition, Addson Wesly.
  • S. L. Basin (1963) Generalized Fibonacci Sequences and Squared Rectangles, The American Mathematical Monthly, 70:4, 372-379. doi: 10.1080/00029890.1963.11987595
  • Abdullah K. (2010). Comparison between the RSA cryptosystem and elliptic curve cryptography (Thesis, Master of Science (MSc)). The University of Waikato, Hamilton, New Zealand.
  • Fred Piper and Sean Murthy “Cryptography: A very short introduction”. E.H.Lock Wood, Math, Gazette 51(1967), PP 243-244. doi: 10.2307/3613247
  • T. Koshy, Fibonacci and Lucas and Pell numbers and pascal’s triangle with Applications (John Wiley, New York, 2001).
  • Feng-Zhen Zhao & Tianming Wang (2005) The values of a class of series involving generalized Fibonacci and Lucas numbers, International Journal of Mathematical Education in Science and Technology.
  • A. ChandraSekhar, D. ChayaKumari, Ch. Pragathi, S. Ashok Kumar “Multiple Encryptions of Fibonacci Lucas transformations” International Organization of Scientific Research (IOST) e-ISSN: 2278-5728,. Volume 12, Issue 2 Ver. II (Mar. - Apr. 2016), PP 66-72
  • Dr. D. Chayakumari, Dr. S. Ashok Kumar, D. Triveni “super-encryption method of laplace transformations using fibonacci numbers” vol 50 issue 7 Journal of Huazhong University of Science and Technology ISSN-1671-4512.
  • Sekhar, A. Chandra, et al. “Linearly independent spanning sets and linear transformations for Multi-level Encryption.” Journal of Information and Optimization Sciences 36.4 (2015): 385-392. doi: 10.1080/02522667.2014.961821
  • Gaurav Mittal, Sunil Kumar, Shiv Narain & Sandeep Kumar (2021) Group ring based public key cryptosystems, Journal of Discrete Mathematical Sciences and Cryptography.
  • Dasdemir, Ahmet. “On the Pell, Pell-Lucas and modified Pell numbers by matrix method.” Applied Mathematical Sciences 5.64 (2011): 3173-3181.
  • Horadam, A. F. “Applications of modified Pell numbers to representations.” Ulam Quarterly 3.1 (1994): 34-53.
  • Çelik, Songül, İnan Durukan, and Engin Özkan. “New recurrences on Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, and Jacobsthal-Lucas numbers.” Chaos, Solitons & Fractals 150 (2021): 111173. doi: 10.1016/j.chaos.2021.111173
  • Yagmur, Tulay, and Nusret Karaaslan. “Gaussian modified Pell sequence and Gaussian modified Pell polynomial sequence.” Aksaray University Journal of Science and Engineering 2.1 (2018): 63-72.
  • Horadam, A. F., and J. M. Mahon. “Pell and pell-lucas polynomials.” Fibonacci Quart 23.1 (1985): 7-20.
  • Karaaslan, Nusret. “A note on modified Pell polynomials.” Aksaray University Journal of Science and Engineering 3.1 (2019): 1-7.
  • Halici, Serpil. “On the Pell polynomials.” Sci 5.37 (2011): 1833-1838.
  • Aziz, Semaa Hassan, Suha Shihab, and Mohammed Rasheed. “On Some Properties of Pell Polynomials.” Al-Qadisiyah Journal of Pure Science 26.1 (2021): 39-54.
  • Can Kızılateş & Selihan Kirlak (2022) A new generalization of Fibonacci and Lucas type sedenions, Journal of Discrete Mathematical Sciences and Cryptography.
  • Mathe Ramakrishna, V. Atukuri, and Srinivasa Kumar Devireddy. “Securing information: cryptography and steganography.” International Journal of Computer Science and Information Technologies 3.3 (2012): 4251-4255.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.