matrix power
Recently Published Documents


TOTAL DOCUMENTS

78
(FIVE YEARS 6)

H-INDEX

10
(FIVE YEARS 0)

2021 ◽  
Vol 20 (4) ◽  
pp. 29-41
Author(s):  
Imane Hafaidia ◽  
Noureddine Benrabia ◽  
Mourad Ghiat ◽  
Hamza Guebbai

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1683
Author(s):  
Eligijus Sakalauskas ◽  
Inga Timofejeva ◽  
Ausrys Kilciauskas

A new sigma identification protocol (SIP) based on matrix power function (MPF) defined over the modified medial platform semigroup and power near-semiring is proposed. It is proved that MPF SIP is resistant against direct and eavesdropping attacks. Our security proof relies on the assumption that MPF defined in the paper is a candidate for one-way function (OWF). Therefore, the corresponding MPF problem is reckoned to be a difficult one. This conjecture is based on the results demonstrated in our previous studies, where a certain kind of MPF problem was proven to be NP-complete.


2021 ◽  
Vol 9 (5) ◽  
pp. 681-683
Author(s):  
K.K.W.A. S. Kumara ◽  

In this paper, considering fractional matrix power definition, we define matrix powers of matrixusing matrix exponential and matrix logarithm. Finally present a guide for computingthe matrix powers of matrix.


Author(s):  
Michael Kilian ◽  
Jurgen Kassner ◽  
Patrick Soboll ◽  
Michael Schneider
Keyword(s):  

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 860
Author(s):  
Eligijus Sakalauskas ◽  
Lina Dindienė ◽  
Aušrys Kilčiauskas ◽  
Kȩstutis Lukšys

A Shannon cipher can be used as a building block for the block cipher construction if it is considered as one data block cipher. It has been proved that a Shannon cipher based on a matrix power function (MPF) is perfectly secure. This property was obtained by the special selection of algebraic structures to define the MPF. In an earlier paper we demonstrated, that certain MPF can be treated as a conjectured one-way function. This property is important since finding the inverse of a one-way function is related to an N P -complete problem. The obtained results of perfect security on a theoretical level coincide with the N P -completeness notion due to the well known Yao theorem. The proposed cipher does not need multiple rounds for the encryption of one data block and hence can be effectively parallelized since operations with matrices allow this effective parallelization.


Carbon Energy ◽  
2019 ◽  
Vol 1 (2) ◽  
pp. 276-288 ◽  
Author(s):  
Hongyi Xu ◽  
Chengxin Peng ◽  
Yuhua Yan ◽  
Fei Dong ◽  
Hao Sun ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document