Softpedia
 

WINDOWS CATEGORIES:



GLOBAL PAGES >>
SOFTPEDIA REVIEWS >>
MEET THE EDITORS >>
WEEK'S BEST
  • Bitdefender Total ...
  • Ocster Backup Pro ...
  • Hard Disk Sentinel...
  • FlashFXP [DISCOUNT...
  • DVDFab DVD Copy [D...
  • Kaspersky Internet...
  • Avast! Internet Se...
  • Avira Internet Sec...
  • Webroot SecureAnyw...
  • McAfee Total Prote...
  • Home > Windows > Science / CAD
     Report malware

    YAFU 1.34

    download button

    Downloads: 1,328  Tell us about an update
    User Rating:
    Rated by:
    Excellent (5.0/5)
    1 user(s)
    Developer:

    License / Price:

    Size / OS:

    Last Updated:

    Category:

    Freeware / $0
    2.7 MB / Windows NT / 2K / XP / Vista / XP X64 / Vista64 / 7 / 7 x64 / 8 32-bit / 8 64-bit
    [view history]
    C: \ Science / CAD

     Read user reviews (0)  Send to friend   Follow (1 user)

    YAFU description

    Integer factorization made easy

    YAFU or Yet Another Factoring Utility is an interactive Command Line instrument for integer factorization.

    Implements multi-threaded SIQS as well as ECM, P+1, P-1, SQUFOF, Pollard's Rho, and Fermat's method. The program also contains a very fast implementation of the Sieve of Eratosthenes.

    What's New in This Release: [ read full changelog ]

    · new sse2 code: faster small prime sieving in siqs
    · new sse4.1 code: even faster small prime sieving in siqs
    · new sse4.1 code: faster large prime bucket sieving in siqs
    · makefile additions to include sse4.1 code in the fat binary on compatible hardware
    · runtime flag to utilize sse4.1 code on compatible hardware
    · enabled multipliers for fermat factorization
    · fixed bug in qs filtering
    · fixed a bug in .job file filling - handle no line break on last line
    · fixed "too many refactorizations" bug
    · added a function to factor all single precision integers within a specified range
    · frontend calculator now uses GMP
    · Updated "gnfs.h" to use GMP
    · automatic processing of several SNFS forms: N = a*b^n +/- c, for b < 100, c < 2^30, N < 1024 bits N = b^n +/- 1, for b > 100, N < 1024 bits N = a^n +/- b^n, for gcd(a,b) = 1, a,b

     Softpedia guarantees that YAFU 1.34 is 100% CLEAN, which means it does not contain any form of malware, including spyware, viruses, trojans and backdoors. [read more >]


    TAGS:

    integer factorization | multi-threaded SIQS | Fermat method | factorization | integer | Fermat

    Go to top

    WindowsGamesDriversMacLinuxScriptsMobileHandheldNews

    SUBMIT PROGRAM   |   ADVERTISE   |   GET HELP   |   SEND US FEEDBACK   |   RSS FEEDS   |   UPDATE YOUR SOFTWARE   |   ROMANIAN FORUM