New public key cryptosystems based on non‐Abelian factorization problems. Issue 7 (1st March 2013)

• Record Type: Journal Article
• Authors: Gu, Lize; Wang, Licheng; Ota, Kaoru; Dong, Mianxiong; Cao, Zhenfu; Yang, Yixian
• Is Part Of: Security and communication networks. Volume 6:Issue 7(2013:Jul.)
• Page Start: 912
• Page End: 922
• Publication Date: 2013-03-01
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.710
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>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. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>