The multi-dimension RSA and its low exponent security

Zhenfu Cao

doi:10.1007/BF02916982

The multi-dimension RSA and its low exponent security

Zhenfu Cao^*

^*此作品的通讯作者

Harbin Institute of Technology

科研成果: 期刊稿件 › 文章 › 同行评审

12 引用（Scopus）

摘要

Using a well-known result of polynomial over the finite field double-struck F sign_p, we show that the Euler-Fermat theorem holds in _N[x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacking RSA is not suitable for the multi-dimension RSA. Therefore, it is believed that the security of the new cryptosystem is mainly based on the factorization of large integers.

源语言	英语
页（从-至）	349-354
页数	6
期刊	Science in China, Series E: Technological Sciences
卷	43
期	4
DOI	https://doi.org/10.1007/BF02916982
出版状态	已出版 - 8月 2000
已对外发布	是

访问文件

10.1007/BF02916982

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{f2f7e3f3a4074d79b992df3322fcd8e7,

title = "The multi-dimension RSA and its low exponent security",

abstract = "Using a well-known result of polynomial over the finite field double-struck F signp, we show that the Euler-Fermat theorem holds in N[x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacking RSA is not suitable for the multi-dimension RSA. Therefore, it is believed that the security of the new cryptosystem is mainly based on the factorization of large integers.",

keywords = "Euler-Ferma theorem in [x], Factorization, Low exponent security, Multi-dimension RSA, Polynomial over finite field",

author = "Zhenfu Cao",

year = "2000",

month = aug,

doi = "10.1007/BF02916982",

language = "英语",

volume = "43",

pages = "349--354",

journal = "Science in China, Series E: Technological Sciences",

issn = "1006-9321",

publisher = "Science Press ",

number = "4",

}

TY - JOUR

T1 - The multi-dimension RSA and its low exponent security

AU - Cao, Zhenfu

PY - 2000/8

Y1 - 2000/8

N2 - Using a well-known result of polynomial over the finite field double-struck F signp, we show that the Euler-Fermat theorem holds in N[x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacking RSA is not suitable for the multi-dimension RSA. Therefore, it is believed that the security of the new cryptosystem is mainly based on the factorization of large integers.

AB - Using a well-known result of polynomial over the finite field double-struck F signp, we show that the Euler-Fermat theorem holds in N[x]. We present a multi-dimension RSA cryptosystem and point out that low exponent algorithm of attacking RSA is not suitable for the multi-dimension RSA. Therefore, it is believed that the security of the new cryptosystem is mainly based on the factorization of large integers.

KW - Euler-Ferma theorem in [x]

KW - Factorization

KW - Low exponent security

KW - Multi-dimension RSA

KW - Polynomial over finite field

UR - https://www.scopus.com/pages/publications/0042689537

U2 - 10.1007/BF02916982

DO - 10.1007/BF02916982

M3 - 文章

AN - SCOPUS:0042689537

SN - 1006-9321

VL - 43

SP - 349

EP - 354

JO - Science in China, Series E: Technological Sciences

JF - Science in China, Series E: Technological Sciences

IS - 4

ER -

The multi-dimension RSA and its low exponent security

摘要

访问文件

其它文件与链接

指纹

引用此