Top
Back: PollardRho
Forward: quadraticSieve
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.22 pFactor

Procedure from library crypto.lib (see crypto_lib).

Usage:
pFactor(n,B.P); n to be factorized, B a bound , P a list of primes

Return:
a list of factors of n or n if no factor found

Note:
Pollard's p-factorization
creates the product k of powers of primes (bounded by B) from the list P with the idea that for a prime divisor p of n we have p-1|k, and then p devides gcd(a^k-1,n) for some random a

Example:
 


Top Back: PollardRho Forward: quadraticSieve 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.