Scalar Multiplication based Matrix Public Key Cryptography

Dr. Addepalli V.N. Krishna

In this work, a matrix key is used as Global Parameter. The work is considered for a large prime number which constitutes the field. A random integer is considered as private key and the Global matrix is exponentiated by the private key to generate public key. The process supports for Security features like authentication and confidentiality which are the necessary services for encryption process. Since the process supports Discrete Lagorithm problem, which is a hard problem it supports sufficient security against crypto analysis. In this work, instead of doing direct exponentiation of matrix key to the power of integer (Private Key), the study focuses on different scalar multiplication techniques that can be performed on matrix key during its exponentiation process to reduce the amount of computing resources for the completion of the process.

Volume 12 | 04-Special Issue

Pages: 307-310

DOI: 10.5373/JARDCS/V12SP4/20201493