FACTORING

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

检索结果分析

结果分析中...
选择条件：
  • 学科=理学—数学x
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Quest towards “factoring larger integers with commercial D-Wave quantum annealing machines”被引量：3
《Science China(Physics,Mechanics & Astronomy)》2019年第6期130-130,共1页XinMei Wang 
Integer factorization (IFP), also called prime factorization, is an important problem in number theory, cryptography, and quantum computation. Factoring large integers to attack the RSA cryptosystem is intractable for...
关键词：QUEST towards FACTORING larger INTEGERS with commercial D-WAVE quantum ANNEALING MACHINES 
New Finding on Factoring Prime Power RSA Modulus N = p^rq
《Journal of Mathematical Research with Applications》2017年第4期404-418,共15页Sadiq SHEHU Muhammad Rezal Kamel ARIFFIN 
This paper proposes three new attacks. In the first attack we consider the class of the public exponents satisfying an equation e X-N Y ＋（ap^r＋ bq^r）Y = Z for suitably small positive integers a, b. Applying contin...
关键词：RSA prime power factorization LLL algorithm simultaneous diophantine approximations continued fraction 
On the elliptic curve y^2=x^3-2r Dx and factoring integers
《Science China Mathematics》2014年第4期719-728,共10页LI XiuMei ZENG JinXiang 
supported by National Natural Science Foundation of China (Grant No. 11271212)
Let D=pq be the product of two distinct odd primes.Assuming the parity conjecture,we construct infinitely many r≥1 such that E2rD:y2=x3-2rDx has conjectural rank one and vp(x([k]Q))≠vq(x([k]Q))for any odd integer k,...
关键词：elliptic curve integer factoring Selmer group 
An efficient algorithm for factoring polynomials over algebraic extension field被引量：1
《Science China Mathematics》2013年第6期1155-1168,共14页SUN Yao WANG DingKang 
supported by National Key Basic Research Project of China (Grant No.2011CB302400);National Natural Science Foundation of China (Grant Nos. 10971217, 60970152 and 61121062);IIE'S Research Project on Cryptography (Grant No. Y3Z0013102)
An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its CrSbner basis, no extra Grbbner ...
关键词：algorithm FACTORIZATION algebraic extension field 
Identity based signature scheme based on cubic residues被引量：4
《Science China(Information Sciences)》2011年第10期2001-2012,共12页XING DongSheng CAO ZhenFu DONG XiaoLei 
supported by the National Natural Science Foundation of China (Grant Nos.60970110,60972034);the State Key Program of National Natural Science of China (Grant No.61033014)
We propose a novel method to compute a cubic root of a cubic residue in Eisenstein ring. By applying our method, a new identity based signature scheme is proposed based on cubic residues. We formally prove that our sc...
关键词：Eisenstein ring identity based signature cubic residue FACTORING random oracle proven security 
Optimal Algorithm for Algebraic Factoring
《Journal of Computer Science & Technology》1997年第1期1-9,共9页支丽红 
This paper presents an optimized method for factoring multivariate polynomials over algebraic extension fields defined by an irreducible ascending set.The basic idea is to convert multivariate polynomials to univariat...
关键词：Hensel lemma integer substitution ascending set algebraic extensions field 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部