Publication

Factoring with two large primes

Arjen Lenstra
1991
Journal paper

Abstract

We describe a modification to the well-known large prime variant of the multiple polynomial quadratic sieve factoring algorithm. In practice this leads to a speed-up factor of 2 to 2.5. We discuss several implementation-related aspects, and we include some examples. Our new variation is also of practical importance for the number field sieve factoring algorithm.

Official source

https://infoscience.epfl.ch/record/149704?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A new elementary proof of the Prime Number Theorem

Florian Karl Richter

Let

\Omega(n)

denote the number of prime factors of

n

. We show that for any bounded

f\colon\mathbb{N}\to\mathbb{C}

one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a ...

2021

Factoring with two large primes

Graph Chatbot

Chat with Graph Search

Non-planarity of Markoff graphs mod p

The double exponential runtime is tight for 2-stage stochastic ILPs

A new elementary proof of the Prime Number Theorem

Non-planarity of Markoff graphs mod p

The double exponential runtime is tight for 2-stage stochastic ILPs

A new elementary proof of the Prime Number Theorem