FASTER DETERMINISTIC INTEGER FACTORIZATION

被引：0

作者：

Costa, Edgar ^{[1
]}

Harvey, David ^{[2
]}

机构：

[1] NYU, Courant Inst Math Sci, New York, NY 10012 USA

[2] Univ New S Wales, Sch Math & Stat, Sydney, NSW 2052, Australia

来源：

MATHEMATICS OF COMPUTATION | 2014年 / 83卷 / 285期

基金：

澳大利亚研究理事会;

关键词：

MULTIPLICATION; COEFFICIENTS;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M-int (N-1/4 logN)), where M-int (k) denotes the cost of multiplying k-bit integers. This result is due to Bostan, Gaudry, and Schost, following the Pollard-Strassen approach. We show that this bound can be improved by a factor of root log logN.

引用

页码：339 / 345

页数：7

共 50 条

[1] A BABYSTEP-GIANTSTEP METHOD FOR FASTER DETERMINISTIC INTEGER FACTORIZATION
Hittmeir, Markus
MATHEMATICS OF COMPUTATION, 2018, 87 (314) : 2915 - 2935
[2] A DETERMINISTIC ALGORITHM FOR INTEGER FACTORIZATION
Hiary, Ghaith A.
MATHEMATICS OF COMPUTATION, 2016, 85 (300) : 2065 - 2069
[3] Deterministic Integer Factorization with Oracles for Euler's Totient Function
Hittmeir, Markus
Pomykala, Jacek
FUNDAMENTA INFORMATICAE, 2020, 172 (01) : 39 - 51
[4] A TIME-SPACE TRADEOFF FOR LEHMAN'S DETERMINISTIC INTEGER FACTORIZATION METHOD
Hittmeir, Markus
MATHEMATICS OF COMPUTATION, 2021, 90 (330) : 1999 - 2010
[5] Specialized integer factorization
Coppersmith, D
ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 542 - 545
[6] FASTER INTEGER MULTIPLICATION
Fuerer, Martin
SIAM JOURNAL ON COMPUTING, 2009, 39 (03) : 979 - 1005
[7] Faster Integer Programming
Monroe, Don
COMMUNICATIONS OF THE ACM, 2024, 67 (10) : 9 - 11
[8] Faster Integer Multiplication
Fuerer, Martin
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 57 - 66
[9] A Method of Integer Factorization
Pan, Zhizhong
Li, Xiao
SECURITY AND PRIVACY, ICSP 2021, 2021, 1497 : 64 - 76
[10] Faster deterministic dictionaries
Pagh, R
PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 487 - 493

← 1 2 3 4 5 →