Efficient matrix multiplication for cryptography with a companion matrix over F2

Эндаумент фонд ТГУ!
Впиши своё имя в историю университета
- Сделать пожертвование -

Add to "Quick Collection"

Description	Size	Format
Efficient matrix multiplication for cryptography with a companion matrix over F2	588 KB	Adobe Acrobat PDF	Read	Download
DOI Доступ к ресурсу на сайте издателя			10.17223/2226308X/16/29

Title: Efficient matrix multiplication for cryptography with a companion matrix over F2
Creator: Pal, S.
Date: 2023
DOI: 10.17223/2226308X/16/29
Description: A number of schemes in cryptography and other allied areas require operations on matrices that are computationally expensive. However, the computational load due to standard operations like multiplication can be drastically reduced by the choice of special matrices. One such special matrix is the companion matrix of a monic polynomial of degree n over a finite field. Due to its cyclic structure and sparseness property, such a matrix not only helps us to reduce the complexity of matrix multiplication but also can be applied for cryptographic purposes. In this paper, an algorithm is proposed for the multiplication of an arbitrary matrix with a companion matrix over a finite field of order p. In our algorithm, we not only reduce the complexity but also minimize the number of multiplication operations as much as possible. The complexity of multiplication of any n х n matrix with a companion

Relationships: Show Relationship Browser for this Object
collection(s): Журналы ТГУ
Identifier: смотреть в электронном каталоге НБ ТГУ
Type: статьи в журналах
Source: Прикладная дискретная математика. Приложение. 2023. № 16. С. 114-117
Language: rus

Created: 15-09-2023

710 Visitors

606 Hits

112 Downloads

Журналы ТГУ Efficient matrix multiplication for cryptography with a companion matrix over F2