Navigation:
- Freeware
- - Graphic Apps
- - CAD
- - Msieve
Msieve 1.53 freeware
... is a C library implementing a suite of algorithms to factor large integers. It contains an implementation of the SIQS and GNFS algorithms; the latter has helped complete some of the largest public factorizations known. ...
| Author | jasonp_sf |
| Released | 2016-11-11 |
| Filesize | 1.20 MB |
| Downloads | 564 |
| OS | Windows XP, Windows Vista, Windows Vista x64, Windows 7, Windows 7 x64, Windows 8, Windows 8 x64, Windows 10, Windows 10 x64 |
| Installation | Instal And Uninstall |
| Keywords | marthematical library, implement algorithm, GNFS algorithm, math, mathematical, implement |
| Users' rating (3 rating) |
Msieve Free Download - we do not host any Msieve torrent files or links of Msieve on rapidshare.com, depositfiles.com, megaupload.com etc. All Msieve download links are direct Msieve download from publisher site or their selected mirrors.
| 1.53 | Nov 11, 2016 | New Release | Replaced the GPU sorting library with calls to CUB; this is more compatible with the latest GPU models and works with CUDA toolkits more recent than v5.5, which the old library was stuck with. Added primality proving of factors found (thanks David Cleaver / Brian Gladman). Added a primality test for factors of NFS relations; apparently the sieving tools will occasionally output relations with factors that are composite, and this may be the cause of mysterious problems with extremely large jobs. Modified the matrix build in the NFS linear algebra to always use quadratic characters near 2^32, to always choose them so they do not occur in relations, and to decide the number of characters at runtime with a compiled-in maximum. This paranoia should prevent huge factorizations from failing in the square root, like almost happened to Greg Childers. |
| 1.48 | Jan 10, 2011 | New Release | · Performed a massive overhaul of the stage 1 NFS polynomial selection, with a huge amount of help from Jayson King. Once this is tuned a little better, polynomial selection should become massively faster, especially on CPUs. The GPU code is much simpler and more flexible now too · Added a fast MPI parallel all-against-all xor implementation courtesy of · Added more cache size detection for Intel processors · Added a fix to prevent potential overflow in the hashtable code · Increased the maximum input size to 1024 bits · Corrected a bug in Windows win32 inline assembler code · Removed the unmaintained Visual Studioo 2008 build projects · Updated Visual Studio 2010 CUDA build for NVIDIA Parallel Nsight 1.5 and the CUDA 3.2 toolkit |
