An exponent one-fifth algorithm for deterministic integer factorisation

10/12/2020
by   David Harvey, et al.
0

Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of a positive integer N in N^2/9+o(1) bit operations. Prior to this breakthrough, the best known complexity bound for this problem was N^1/4+o(1), a result going back to the 1970s. In this paper we push Hittmeir's techniques further, obtaining a rigorous, deterministic factoring algorithm with complexity N^1/5+o(1).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/11/2017

Faster integer and polynomial multiplication using cyclotomic coefficient rings

We present an algorithm that computes the product of two n-bit integers ...
02/23/2018

Deterministic factoring with oracles

We revisit the problem of integer factorization with number-theoretic or...
08/30/2018

Randomized Polynomial-Time Root Counting in Prime Power Rings

Suppose k,p∈N with p prime and f∈Z[x] is a univariate polynomial with de...
11/22/2016

Faster integer multiplication using plain vanilla FFT primes

Assuming a conjectural upper bound for the least prime in an arithmetic ...
06/11/2015

Fractal surfaces from simple arithmetic operations

Fractal surfaces ('patchwork quilts') are shown to arise under most gene...
10/09/2020

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

This paper describes an algorithm which computes the characteristic poly...
02/12/2020

Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm

We study the fixed-support Wasserstein barycenter problem (FS-WBP), whic...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.