[Resource Topic] 2017/403: Condition on composite numbers easily factored with elliptic curve method

Welcome to the resource topic for 2017/403

Title:
Condition on composite numbers easily factored with elliptic curve method

Authors: Masaaki Shirase

Abstract:

For a composite integer N that we would like to factor, we consider a condition for the elliptic curve method using N as a scalar value to succeed and show that if N has a prime factor p such that $p=(DV^2+1)/4,\ V \in {\mathbb Z},\ D\in {3, 11, 19, 35, 43, 51, 67, 91, 115, 123, 163, 187, 235, 267, 403, 427}$, we can find a non-trivial divisor of N (multiple of p) in a short time. In the authors’ implementation on PARI/GP, a 1024-bit N was factored in a few seconds when p was 512 bits.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.