New public key cryptosystems based on non-Abelian factorization problems

Lize Gu; Licheng Wang; Kaoru Ota; Mianxiong Dong; Zhenfu Cao; Yixian Yang

doi:10.1002/sec.710

New public key cryptosystems based on non-Abelian factorization problems

Lize Gu
, Licheng Wang^*
, Kaoru Ota
, Mianxiong Dong
, Zhenfu Cao
, Yixian Yang

^*此作品的通讯作者

Beijing University of Posts and Telecommunications
The University of Aizu
Shanghai Jiao Tong University

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

32 引用（Scopus）

摘要

Two novel public key encryption schemes based on the non-Abelian factorization problems were proposed. Both of them are proved to be indistinguishable against adaptively chosen ciphertext attack (IND-CCA2) in the random oracle models. These constructions have the potential to resist Shor's quantum algorithm attack proposed in 1994 and give affirmative answers for the open question announced by Myasnikov, Shpilrain and Ushakov in 2011.

源语言	英语
页（从-至）	912-922
页数	11
期刊	Security and Communication Networks
卷	6
期	7
DOI	https://doi.org/10.1002/sec.710
出版状态	已出版 - 7月 2013
已对外发布	是

访问文件

10.1002/sec.710

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{4d2f810b011741a8b7a079c79e3932cb,

title = "New public key cryptosystems based on non-Abelian factorization problems",

abstract = "Two novel public key encryption schemes based on the non-Abelian factorization problems were proposed. Both of them are proved to be indistinguishable against adaptively chosen ciphertext attack (IND-CCA2) in the random oracle models. These constructions have the potential to resist Shor's quantum algorithm attack proposed in 1994 and give affirmative answers for the open question announced by Myasnikov, Shpilrain and Ushakov in 2011.",

keywords = "Factorization, Non-Abelian, Public-key encryption, Quantum attack resistant",

author = "Lize Gu and Licheng Wang and Kaoru Ota and Mianxiong Dong and Zhenfu Cao and Yixian Yang",

year = "2013",

month = jul,

doi = "10.1002/sec.710",

language = "英语",

volume = "6",

pages = "912--922",

journal = "Security and Communication Networks",

issn = "1939-0114",

publisher = "John Wiley and Sons Ltd",

number = "7",

}

TY - JOUR

T1 - New public key cryptosystems based on non-Abelian factorization problems

AU - Gu, Lize

AU - Wang, Licheng

AU - Ota, Kaoru

AU - Dong, Mianxiong

AU - Cao, Zhenfu

AU - Yang, Yixian

PY - 2013/7

Y1 - 2013/7

N2 - Two novel public key encryption schemes based on the non-Abelian factorization problems were proposed. Both of them are proved to be indistinguishable against adaptively chosen ciphertext attack (IND-CCA2) in the random oracle models. These constructions have the potential to resist Shor's quantum algorithm attack proposed in 1994 and give affirmative answers for the open question announced by Myasnikov, Shpilrain and Ushakov in 2011.

AB - Two novel public key encryption schemes based on the non-Abelian factorization problems were proposed. Both of them are proved to be indistinguishable against adaptively chosen ciphertext attack (IND-CCA2) in the random oracle models. These constructions have the potential to resist Shor's quantum algorithm attack proposed in 1994 and give affirmative answers for the open question announced by Myasnikov, Shpilrain and Ushakov in 2011.

KW - Factorization

KW - Non-Abelian

KW - Public-key encryption

KW - Quantum attack resistant

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

U2 - 10.1002/sec.710

DO - 10.1002/sec.710

M3 - 文章

AN - SCOPUS:84879531866

SN - 1939-0114

VL - 6

SP - 912

EP - 922

JO - Security and Communication Networks

JF - Security and Communication Networks

IS - 7

ER -

New public key cryptosystems based on non-Abelian factorization problems

摘要

访问文件

其它文件与链接

指纹

引用此