QuadraticSieve(1)

QuadraticSieve1

Attempts to find a prime factor of the typed-in integer

Usage

QuadraticSieve

Overview

It uses William Hart's highly optimized multi-polynomial quadratic sieve method to find prime factors of the large (more than forty digits) integer it will ask to type in.

Releases

Unchanged in 5 releases since Debian 9 (Stretch).

  1. 9–13

From flintqs 1:1.0-4 in Debian 13 (Trixie). Parsed by carta from the page's man source.