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

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

31 Citations (Scopus)

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.

Original language	English
Pages (from-to)	912-922
Number of pages	11
Journal	Security and Communication Networks
Volume	6
Issue number	7
DOIs	https://doi.org/10.1002/sec.710
Publication status	Published - Jul 2013
Externally published	Yes

Keywords

Factorization
Non-Abelian
Public-key encryption
Quantum attack resistant

Access to Document

10.1002/sec.710

Cite this

@article{8664e59dead044a893ecc45cb94fd544,

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 = "English",

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 - Article

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this