Cryptography using multinacci block matrices | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 6، دوره 14، شماره 10، دی 2023، صفحه 57-65 اصل مقاله (364.38 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2023.29918.4295 | ||
| نویسندگان | ||
| Munesh Kumari* 1؛ Jagmohan Tanti2 | ||
| 1Department of Mathematics, Central University of Jharkhand, Ranchi, India | ||
| 2Department of Mathematics, Babasaheb Bhimrao Ambedkar University, Lucknow, India | ||
| چکیده | ||
| In this paper, we propose public key cryptography using recursive block matrices involving generalized Fibonacci numbers over a finite field $\mathbb{Z}_{p}$. For this, we define multinacci block matrices, a kind of upper triangular matrix involving multinacci matrices at diagonal places and give some of its algebraic properties. Moreover, we set up a method for key element agreement at end users, which makes cryptography more efficient. The proposed cryptography comes with a large key space and its security relies on the Discrete Logarithm Problem (DLP). | ||
| کلیدواژهها | ||
| Fibonacci matrix؛ Block Matrix؛ Cryptography؛ Keyspace | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,952 تعداد دریافت فایل اصل مقاله: 10,894 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 722 |
| تعداد مقالات | 10,383 |
| تعداد مشاهده مقاله | 72,838,579 |
| تعداد دریافت فایل اصل مقاله | 64,535,123 |