首页> 外文期刊>Journal of complexity >On oracle factoring of integers
【24h】

On oracle factoring of integers

机译:On oracle factoring of integers

获取原文
获取原文并翻译 | 示例
           

摘要

We present an oracle factorisation algorithm, which in polynomial deterministic time, finds a nontrivial factor of almost all positive integers n based on the knowledge of the number of points on certain elliptic curves in residue rings modulo n. (c) 2023 Elsevier Inc. All rights reserved.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号