.png){kind=icon}
.png){kind=icon}
Return
Applying quick exponentiation for block upper triangular matrices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.078.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The best method for exponentiation is highly dependant on the algebraic set employed. Block upper triangular matrices defined in Z(P), have very interesting properties for multiple applications, in which exponentiation is very important in order to achieve adequate performance. We analyze the usage of quick exponentiation methods with these matrices and, as a practical application, we propose a new public-key cryptosystem and digital signature scheme based on a generalization of the well known discrete logarithm problem to block upper triangular matrices. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
block matrix
quick exponentiation
triangular matrix
group algebra
discrete logarithm problem
primitive polynomial
companion matrix
matrix order
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available