In this paper, we have proposed a public key cryptography using recursive block matrices involving generalized Fibonacci numbers over a finite field Fp. For this, we define multinacci block matrices, a type of upper triangular matrix involving multinacci matrices at diagonal places and obtained some of its algebraic properties. Moreover, we have set up a method for key element agreement at end users, which makes the cryptography more efficient. The proposed cryptography comes with a large keyspace and its security relies on the Discrete Logarithm Problem(DLP).
翻译:在本文中,我们建议使用含有有限字段Fp的普通Fibonacci数字的递归式块状矩阵进行公用钥匙加密。 为此,我们定义了多角块矩阵,这是一种在对角位置的多角矩阵的上三角矩阵,并获得了其某些代数特性。此外,我们还为终端用户制定了关键要素协议方法,使加密效率更高。提议的加密带有大密钥空间,其安全依赖于Discrete Logarithm 问题(DLP ) 。