givintfactor.h File Reference

factorisation More...

#include <iostream>
#include "givaro/givinteger.h"
#include "givaro/givintprime.h"
#include "givaro/givrandom.h"
#include "givaro/givintfactor.inl"

Data Structures
class	IntFactorDom< MyRandIter >
	Integer Factor Domain. More...

Namespaces
namespace	Givaro
	Namespace in which the whole Givaro library resides.

Macros
#define	factor_first_primes(tmp, n)
#define	factor_second_primes(tmp, n)
#define	Pollard_cst   1

Detailed Description

factorisation

• Prime numbers
  • Factor sets :
  • Pollard's rho method for factorization
  • Elliptic curves factorization by Lenstra

Macro Definition Documentation

factor_first_primes

#define factor_first_primes	(		tmp,
			n )

Value:

(tmp = isZero(mod(tmp,n,23))?23:( isZero(mod(tmp,n,19))?19:( isZero(mod(tmp,n,17))?17:  (isZero(mod(tmp,n,2))?2:( isZero(mod(tmp,n,3))?3:( isZero(mod(tmp,n,5))?5:( isZero(mod(tmp,n,7))?7: ( isZero(mod(tmp,n,11))?11:13 ))))))))

factor_second_primes

#define factor_second_primes	(		tmp,
			n )

Value:

(tmp = isZero(mod(tmp,n,31))?31:( isZero(mod(tmp,n,29))?29: ( isZero(mod(tmp,n,37))?37: ( isZero(mod(tmp,n,41))?41:( isZero(mod(tmp,n,43))?43:  ( isZero(mod(tmp,n,71))?71:( isZero(mod(tmp,n,67))?67:( isZero(mod(tmp,n,61))?61:( isZero(mod(tmp,n,59))?59: ( isZero(mod(tmp,n,53))?53:( isZero(mod(tmp,n,47))?47: ( isZero(mod(tmp,n,97))?97: ( isZero(mod(tmp,n,89))?89:( isZero(mod(tmp,n,83))?83:( isZero(mod(tmp,n,79))?79:73)))))))))))))))

Pollard_cst

#define Pollard_cst   1