咨询与建议

限定检索结果

文献类型

  • 3 篇 期刊文献

馆藏范围

  • 3 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3 篇 理学
    • 3 篇 数学
  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 3 篇 软件工程

主题

  • 3 篇 factoring algori...
  • 3 篇 smooth numbers
  • 3 篇 discrete logarit...
  • 3 篇 dirichlet charac...
  • 1 篇 large sieve
  • 1 篇 z*(n)-generating...
  • 1 篇 large sieve esti...
  • 1 篇 z(n)(*)-generati...
  • 1 篇 brun-titchmarsh ...
  • 1 篇 z(n)*-generating...

机构

  • 2 篇 warsaw univ inst...
  • 1 篇 univ warsaw inst...

作者

  • 3 篇 pomykala jacek
  • 1 篇 durnoga konrad

语言

  • 3 篇 英文
检索条件"主题词=Discrete Logarithm Problem for Composite Numbers"
3 条 记 录,以下是1-10 订阅
排序:
Small Generating Sets and DLPC problem
收藏 引用
FUNDAMENTA INFORMATICAE 2016年 第2期145卷 143-150页
作者: Pomykala, Jacek Warsaw Univ Inst Math Banacha 2 PL-02097 Warsaw Poland
In the paper we investigate the set of odd, squarefree positive integers n that can be factored completely in polynomial time O (log(6+epsilon) n), given the prime decomposition of orders or d(n)b for b 2), which is ... 详细信息
来源: 评论
On Deterministic Reduction of Factoring Integers to Computing the Exponents of Elements in Modular Group
收藏 引用
FUNDAMENTA INFORMATICAE 2017年 第3期152卷 289-295页
作者: Pomykala, Jacek Warsaw Univ Inst Math Banacha 2 PL-02097 Warsaw Poland
In the paper we prove that all but at most x/A(x) positive integers n <= x can be completely factored in deterministic polynomial time C(x), querying the prime decomposition exponent oracle at most D(x) times. The ... 详细信息
来源: 评论
Large Sieve, Miller-Rabin compositeness Witnesses and Integer Factoring problem
收藏 引用
FUNDAMENTA INFORMATICAE 2017年 第2期156卷 179-185页
作者: Durnoga, Konrad Pomykala, Jacek Univ Warsaw Inst Informat Banacha 2 PL-02097 Warsaw Poland
G. Miller in his seminal paper from the mid 1970s has proven that the problem of factoring integers reduces to computing Euler's totient function phi under the Extended Riemann Hypothesis. We show, unconditionally... 详细信息
来源: 评论