西安电子科技大学ISN综合业务网国家重点实验室,陕西,西安,710071
纸质出版:2011
移动端阅览
司光东, 杨加喜, 谭示崇, 等. RSA算法中的代数结构[J]. 电子学报, 2011,39(1):242-246.
SI Guang-dong, YANG Jia-xi, TAN Shi-chong, et al. Algebra Structure of RSA Arithmetic[J]. Acta Electronica Sinica, 2011, 39(1): 242-246.
本文首次应用二次剩余理论对RSA中的代数结构进行了研究.计算出了
Z
*
n
中模
n
的二次剩余和二次非剩余的个数
对它们之间的关系进行了分析
并用所有二次剩余构成的群对
Z
*
n
进行了分割
证明了所有陪集构成的商群是一个Klein四元群.对强RSA的结构进行了研究
证明了强RSA中存在阶为
(
n
)/2的元素
并且强RSA中
Z
*
n
可由三个二次非剩余的元素生成.确定了
Z
*
n
中任意元素的阶
证明了
Z
*
n
中所有元素阶的最大值是
lcm
(
p
-1
q
-1)
并且给出了如何寻找
Z
*
n
中最大阶元素方法.从而解决了RSA中的代数结构.
Based on the theory of quadratic residues
the algebra structure of RSA arithmetic is researched in this paper.This work calculates numbers of quadratic residues and non-residues in the group
Z
*
n
and investigates their relationship.
Z
*
n
is divided up by the group made up with all quadratic residues in
Z
*
n
and all cosets form a quotient group of order 4 which is a Klein group.Studyed the structure of strong RSA further
it shows that the element of order
(
n
)/2 exists and the group
Z
*
n
can be generated by three e
lements of quadratic non-residues.Let the facterization
n=p·q
the order of each element can be calculated
and the biggest order of all element is
lcm
(
p
-1
q
-1) in
Z
*
n
. It also shows how to find the element of the biggest order.So the algebra structure of RSA arithmetic is solved.
0
浏览量
1715
下载量
4
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621