Top
Back: generateG
Forward: ECPP
FastBack: atkins_lib
FastForward: hyperel_lib
Up: crypto_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.12.3.34 factorLenstraECM

Procedure from library crypto.lib (see crypto_lib).

Usage:
factorLenstraECM(N,S,B); optional: factorLenstraECM(N,S,B,d); d+1 the number of loops in the algorithm (default d=0)

Return:
a factor of N or the message no factor found

Note:
- computes a factor of N using Lenstra's ECM factorization
- the idea is that the fact that N is not prime is dedected using the operations on the elliptic curve
- is similarly to Pollard's p-1-factorization

Example:
 


Top Back: generateG Forward: ECPP FastBack: atkins_lib FastForward: hyperel_lib Up: crypto_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-6, Dec 2012, generated by texi2html.