RESULTS OF ECMI - Elliptic Curve Implementation Method
                  for large integers factorization

THIS IMPLEMENTATION OF THE ECM ALGORITHM IS NOT VERY
FAST; THEESE ARE REPORTS OF ITS PERFORMANCES ON MY
HOME COMPUER

HARDWARE :
  CPU model name	: AMD Athlon(TM) XP 2000+
  CPU MHz		: 1666.240
  CPU cache size	: 256 KB
  CPU bogomips		: 3322.67
  RAM MB		: 512 MB
  RAM MHz		: 266 MHz

SOFTWARE :
  Operative System : Gentoo GNU/Linux [kernel v2.6.1]
  ecmi.c           : my implementation of the elliptic curve method

RESULTS  :
N[integer to factorize]: 3369738766071892021
Loaded 5 primes in memory as factor base.
Factor: 204518747
Factor: 16476429743
Factorization has been completed in 443 seconds.