.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
block matrix
quick exponentiation
triangular matrix
group algebra
discrete logarithm problem
primitive polynomial
companion matrix
matrix order
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容