Search Results for "sieve"
Sort By:
Showing 44 open source projects for "sieve"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
Docker Mailserver
Production-ready fullstack but simple mail server
...The project emphasizes secure defaults while exposing configuration via environment variables and mounted files, allowing you to define users, aliases, domains, and sieve filters without rebuilding images. It integrates smoothly with Let’s Encrypt for TLS, supports LDAP and other auth backends, and ships with scripts to validate DNS records and common misconfigurations. Persistent volumes keep mailboxes and state, making upgrades straightforward and rollbacks less risky. Administrators appreciate the clear docs, test suite, and opinionated conventions that help avoid fragile bespoke setups. -
2
Modoboa
Mail hosting made simple
Modoboa is a mail hosting and management platform including a modern and simplified Web User Interface. It provides useful components such as an administration panel and webmail. Modoboa integrates with well known software such as Postfix or Dovecot. A SQL database (MySQL, PostgreSQL or SQLite) is used as a central point of communication between all components. Modoboa is developed with modularity in mind, expanding it is really easy. Actually, all current features are extensions. It is... -
3
mtsieve
A multi-threading framework using a prime sieve to do work
mtsieve is a framework wrapped around primesieve to distribute prime numbers to worker classes to do work with those prime numbers. The "mt" means that it is multi-threaded. The "sieve" means that the framework is typically used to eliminate candidate terms with small from a set of numbers. The numbers remaining after using mtsieve can then be used by programs such as llr and pfgw to test those numbers for primality. Another usage could be to use those prime numbers to test each for a specific characteristic, such as whether it is a Wieferich or Wall-Sun-Sun number. ... -
4
-
Outgrown Windows Task Scheduler?Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
-
5
Pure C99 Quadratic Sieve 230-bit minute, RSA-100 factored, easily accessible on Windows and Linux. Hello and welcome at sourceforge.net, i'm your student at Université de Franche-Comté, Mon, 11 Jul 2022. This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software - use its own "big num" library named cint - use AVL trees to organize information - use Lanczos Block, a pure C iterative matrix eigenvalues finder algorithm - use Pollard's Rho algorithm to answer under 64 bits The Microsoft Windows executable is included in the zip, the readme.md gives you details. ...
-
6
AfterLogic WebMail Lite
Fast and easy-to-use webmail front-end for your existing mail server.
Fast and easy-to-use webmail front-end for your existing IMAP mail server, Plesk or cPanel. Install it on your web servers for personal or commercial use, redistribute, integrate with other software, or alter the source code (provided that you contribute your changes back to the community). For free. -
7
NFB integer factorization
No-factor-base (NFB) sub-exponential factorization algorithm
This is an easy-to-understand algorithm of integer factorization with heuristically evaluated complexity L(4/15, 2), which is better than the general number field sieve algorithm with L(1/3, 1.923). NFB searches common factors of the quadratic residues modulo n using GCD. All relations are processed by the Gaussian elimination procedure. Different strategies of searching the relations can be applied, many giving complexity better than L(1/3, 1.923). -
8
Linux-reminders
A simple reminder Gui for Linux using wxpython
A simple reminder tool for those of us who have lots to do and a mind like a sieve. The following types of reminder can be created: One off, at a specified date and time; every 15 minutes; every 30 minutes; every 45 minutes; every hour; daily; monthly; weekly; annually; last day of the month; penultimate day of the month; the 1st,2nd,3rd,4th or last Monday of the month; the 1st,2nd,3rd,4th or last Tuesday of the month; the 1st,2nd,3rd,4th or last Wednesday of the month; the 1st,2nd,3rd,4th or last Thursday of the month; the 1st,2nd,3rd,4th or last Friday of the month; the 1st,2nd,3rd,4th or last Saturday of the month; the 1st,2nd,3rd,4th or last Sunday of the month. ... -
9
Eratostene
Show the prime numbers in the form of the Sieve of Eratosthenes
[Versione in italiano sotto] This program can be used to find the prime numbers between 1 and a given number. Also the primes can be visualized in the form of Sieve of Eratosthenes with six columns. The sieve is created in Html and it is possible to save it in a file so that it can be opened with any other browser also after the program was closed. If the browser has the support for JavaScript, it should be possible to show the factorization of a non prime number clicking on it. [Versione in italiano] Questo programma permette di trovare i numeri primi compresi tra 1 ed un numero dato. ... -
All-in-one security tool helps you prevent ransomware and breaches.Blumira’s detection and response platform enables faster resolution of threats to help you stop ransomware attacks and prevent data breaches. We surface real threats, providing meaningful findings so you know what to prioritize. With our 3-step rapid response, you can automatically block known threats, use our playbooks for easy remediation, or contact our security team for additional guidance. Our responsive security team helps with onboarding, triage and ongoing consultations to continuously help your organization improve your security coverage.
-
10
Hedwig is an open source IMAP, SMTP, POP3 server written in Java, designed with ease of installation and configuration in mind. Hedwig enables storage of mail message headers in a relational database(MySQL or Oracle) and mail messages in a file system. Visit http://hwmail.sourceforge.net/ for more information.
-
11
AfterLogic WebMail Lite PHP is a free AJAX webmail application. Users can receive, view, manage, compose, and send email through web interface (IMAP and SMTP supported). Source code included.
-
12
VirtualMailServer Script
Easy installation and configuration of a complete mail server
Sorry. VirtulMailServer is not anymore an opensource project cause it's been involved in a commercial project. VMS is now an app for Bulk Email and it comes with new fully working features. If you are interested in the project, please contact me: claudio.taccogna@gmail.com . See you. -
13
Primenum
Calculation of Primenumbers
*Changelog: NOW AS A DEB PACKAGE! Only for Unix-and unixoid Operating Systems! (It is programmed on Linux Ubuntu 15.10) You can with the Shell- and Python Program calc prime numbers to, no: NO LIMIT (Okay, maybe the processor speed: Calculation of prime numbers to 1.000.000 prime numbers a AMD Athon II M300 goes to 90min! and by a i7 6700HQ 12min!) A installer and README is to package packed ;-) -
14
GGNFS is an open source implementation of General Number Field Sieve algorithm for factoring integers.
-
15
GDLOG
Implementation of the GNFS for discrete logarithm problem in GF(p)
GDLOG is an implementation of the General Number Field Sieve algorithm for discrete logarithm problem in GF(p). -
16
syv
Simple Yaml Validation
Syv (pronounce sieve) stands for simple yet powerful yaml validation. Describe your data with a full-fledged data definition language (in yaml notation), then define the file format you want. Syv out unacceptable values! C++ YAML validation library, requires yaml-cpp (0.5.1) and Boost.Regex (any). -
17
EMsieve
A simple sieve/prefactor program for Eisenstein-Mersenne Primes
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. -
18
Annoyed by listening to music you already listened years ago? This command line utility sorts out new MP3s that you already have and reports the ones you like that are in a better quality.
-
19
DataSieve
The DataSieve Project
A data sieve filters data from a stream and builds a multidimensional database or data cube. -
20
Mozilla filter to sieve converter
javascript to convert thunderbird/seamonkey filters to sieve rules
Web form that converts pasted rule set from thunderbird/seamonkey msgFilterRules.dat filter file into sieve rules suitable for uploading to an imap mail server and compatible with the sieve rule editor plugin for roundcube 'sieverules' (http://www.roundcubeforum.net/7-third-party-contributions/46-api-based-plugins/4878-sieverules-plugin.html) -
21
Prime-Number-Finder
Prime Number Finder usign Sieve of Eratosthenes
Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. ... -
22
fastest primes
A fast prime number generator based on the Sieve of Eratosthenes
The purpose of this project is to make a prime number generator that offers many user adjustable settings and that is also very fast. While there are other prime number generators that can still beat this one in speed, no other ones that I am aware of allow the level of adjustment of sieve size that this one does. If you are running 64-bit Windows, make sure to download the 64-bit executable as it is faster than the 32-bit executable. -
23
PHP sieve library
A PHP sieve library
libsieve-php is a library to manage and modify sieve (RFC5228) scripts. It contains a parser for the sieve language (including extensions) and [not yet] a client for the managesieve protocol. It is written entirely in PHP 5. -
24
A Mozilla Thunderbird Add-on for managing remote sieve scripts. It's a JavaScript based implementation of the ManageSieve Protocol (RFC 5804).
-
25
GJSieve
A basic prime number sieve/tester.
If you are looking for the 64-bit version, find it here: http://sourceforge.net/projects/gjsieve/files/200/gjsieve203.exe/download GJSieve is a basic, yet full-featured sieve and tester for numbers of several classifications, including Proth, Cullen, and Woodall. GJSieve is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for both Windows and OSX. Currently, the application differs greatly across platforms. This may change in the future. They both, however, do the same thing.
