FACTORING

作品数：28被引量：52H指数：4
导出分析报告
相关作者：崔国华郑明辉张军明刘冬花李东魁更多>>
相关机构：华中科技大学赤峰学院包头师范学院重庆教育学院更多>>
相关期刊：《Journal of Beijing Institute of Technology》《国际商务研究》《通讯和计算机（中英文版）》《Journal of Pharmaceutical Analysis》更多>>
相关基金：国家自然科学基金国家教育部博士点基金国家重点基础研究发展计划北京市自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 学科=电子电信x
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Factoring larger integers with fewer qubits via quantum annealing with optimized parameters被引量：9
《Science China(Physics,Mechanics & Astronomy)》2019年第6期5-12,共8页WangChun Peng BaoNan Wang Feng Hu YunJiang Wang XianJin Fang XingYuan Chen Chao Wang 
supported by the National Natural Science Foundation of China(Grant Nos.61332019,61572304,61572034,and 61272096);the Grant of the Special Zone Project of National Defense Innovation
RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard(and hence intractable) problem for a classical computer. However, Shor's algorithm shows that its complexity is polynomial f...
关键词：integer factorization QUANTUM ANNEALING QUBO D-WAVE 
Forgery Attacks on Wang＇s Signature Schemes Based on Factoring and Discrete Logarithm
《Journal of Systems Science and Information》2009年第1期43-48,共6页Dezhi Gao Xiangqian Liang 
This project is supported by National Natural Science Foundation of China（60673053）
To enhance the security of signature schemes, Wang proposed two signature schemes based on the difficulties of simultaneously solving the factoring and discrete logarithm＇ problems with almost the same sizes of arith...
关键词：CRYPTOGRAPHY SECURITY digital signature FACTORING discrete logarithm 
A novel group signature with one time secret key
《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》2005年第6期560-564,共5页谢琪 于秀源 
Project (No. 10271037) supported by the National Natural Sci-ence Foundation of China
A new group signature with one time secret key is proposed. The main merits are that it only needs the trusted center issuing the partial secret key one time for each group member; and that the group member can genera...
关键词：CRYPTOGRAPHY Group signature Discrete logarithm problem Factoring problem 
Enhancing the Security of He-Kiesler Signature Schemes被引量：1
《Journal of Beijing Institute of Technology》2003年第3期326-328,共3页李春辉 陈一宏 
Although the He Kiesler signature is said to be proposed based on the discrete logarithm problem and the factorization problem, it has been proved that the signature is not as secure as it was stated to be. A new sig...
关键词：digital signture scheme discrete logarithm FACTORING 
AN EFFICIENT BIT COMMITMENT SCHEME BASED ON FACTORING ASSUMPTION
《Journal of Electronics(China)》2001年第2期155-159,共5页Zhong Ming Yang Yixian (information Security Center, Beijing Univ. of Posts and Telecomm. Beijing 100876) 
Supported by the National Natural Science Foundation of China(No.69772035,69882002) and "863" Programme
Recently, many bit commitment schemes have been presented. This paper presents a new practical bit commitment scheme based on Schnorr's one-time knowledge proof scheme,where the use of cut-and-choose method and many r...
关键词：BIT COMMITMENT FACTORING ASSUMPTION One-time knowledge PROOF Probabilistic POLYNOMIAL-TIME oracle 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部