A NEW KIND OF DIGITAL SIGNATURE SCHEME USING GOLDEN MATRICES BASED ON FACTORING PROBLEM

F Bani-Ahmad,M.T Shatnawi,N Tahat,S Shatnawi

doi:10.12732/ijpam.v107i1.5

Abstract

A.P. Stakhov in (12) proposed the concepts golden matrices and new kind of cryptography. In this paper, we propose a new kind of digital signature scheme based on factoring problem and the golden matrices, called the golden digital signature. The method is very fast and simple for technical realization and can be used for signature protection of digital signals (telecommunication and measurement system).

Highlights

In the last decades the theory of Fibonacci numbers [1], [3] was complemented by the theory of the so-called Fibonacci Q−matrix [2], [3]
Stakhov [12] developed a theory of the golden matrices that are a generalization of the matrix (2) for continuous domain
We propose a new kind of digital signature based on factoring and golden matrices

Summary

Introduction

In the last decades the theory of Fibonacci numbers [1], [3] was complemented by the theory of the so-called Fibonacci Q−matrix [2], [3]. Note that the symmetrical hyperbolic Fibonacci functions are connected to the Fibonacci numbers by the following correlations: Fn =. Stakhov [12] developed a theory of the golden matrices that are a generalization of the matrix (2) for continuous domain. He defined the golden matrices in the terms of the symmetrical hyperbolic Fibonacci function (5) and (6). The golden matrices that are the functions of the continuous variable x are the following form. The inverse golden matrices that are the functions of the continuous variable x are the following form. We propose a new kind of digital signature based on factoring and golden matrices

Algorithm for Signing and Verification Message

Simple Example

Conclusion