Search Results for "mod-apache-snmp"

GDLOG is an implementation of the General Number Field Sieve algorithm for discrete logarithm problem in GF(p).

...Checkout our options for GPU acceleration of graphs or contact us to learn more: https://www.blazegraph.com/product/gpu-accelerated/. The early work was released under the Apache 2 open source license and is available on here at Sourceforge. This work was (partially) funded by the DARPA XDATA program under AFRL Contract #FA8750-13-C-0002 and DARPA Contract #D14PC00029.

A simple sieve/prefactor program for the so-called Eisenstein-Mersenne Primes: 3^p +- 3^((p + 1)/2) + 1. See http://oeis.org/A125738, A125739 and [1] for a good introduction. Some easily established properties are: p must be prime; sign is minus for p=+-1 (mod 12), plus otherwise; composites only have factors of form 6kp+1 (integer k). Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. ...

A library encapsulating bilinear pairing computation and group computation in the cyclic groups G_1, G_2, G_T. The bilinear pairing is a bilinear, non-degenerate map between G_1 and G_2 to an element in G_T. The users can build complex pairing-based software by the Pairing library without much knowledge of elliptic curves or pairing or number theory. The library is smaller than 57 Kbytes, suitable for hand held devices. The size is only 3.7% of the size of the BPC...

Engineering Calculator Suite

reputron is a knowledge extraction engine platform that covers all aspect of text mining, relevance, indexing and querying on a corpus of text documents.