Search Results for "encryption algorithm java"
Sort By:
Showing 15 open source projects for "encryption algorithm java"
View related business solutions-
Run applications fast and securely in a fully managed environmentRun frontend and backend services, batch jobs, deploy websites and applications, and queue processing workloads without the need to manage infrastructure.
-
RealEstateAPISmart API’s with future unicorns in mind. Unlimited property data and machine-learning out of the box. Designed for teams that want to shake up their industry.
-
1
Javaluator
A java infix evaluator based on "Shunting Yard" algorithm.
Evaluate an arithmetic expression is as simple as: Double result = new DoubleEvaluator().evaluate("(e^3-1)*sin(pi/4)*ln(pi^2)"). But Javaluator provides you with much more ... Key features: - Functions support, including variable argument count. - Constants support: e, pi, etc ... - Variables support: Example sin(x) for x = pi/4. - Highly configurable: Reduce the built-in operator or function sets, define your own brackets. - Extensible: Define your own grammar, or extends the... -
2
Latin Square Toolbox
Generates Latin squares and counts their transversals
The Latin Square Toolbox contains software tools for efficiently generating Latin squares and counting their transversals with various user-configurable options. This open source release aims to help educate folks on Latin squares and their important applications to cryptography. This version contains three tools: 0. Latin Square Generator (LSG) 1. Latin Square Transversal Counter (LSTC) 2. Latin Square Property Checker (LSPC) -
3
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary... -
4
Jafaran
Fast and more random implementations of java.util.Random.
...Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm. -
We Stop Hackers From Sending Emails From Your Domain with DMARCPowerDMARC is a comprehensive email security solution designed to protect your brand reputation and safeguard your email communications. By leveraging advanced technologies such as DMARC, SPF, DKIM, BIMI, MTA-STS, and TLS-RPT, PowerDMARC offers a robust defense against email threats like spoofing, phishing, and ransomware.
-
5
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. ... -
6
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later. -
7
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
8
Galois sub-hierarchy builder
Visualize Galois sub-hierarchy of 2d matrix
GSH builder is a free Galois Sub-Hierarchy visualization tool. The algorithm for calculating GSH is called Pluton and the present Java realization is based on two articles. "Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. ... -
9
Bracer
Repository has been moved to: http://dtitov.github.com/bracer
Java library for parsing and evaluating math expressions. Javadoc is available at http://bracer.sourceforge.net/javadoc/ P.S. This library depends on Apache Commons Math, so don't forget to include commons-math-2.2.jar to your project. -
All-in-One Behavioral Health EHR SoftwareOpus is a comprehensive EHR, CRM, and RCM platform designed to streamline operations for behavioral health treatment centers, including addiction, mental health, and SUD (substance use disorder) clinics. The platform provides integrated tools for patient management, billing, scheduling, and telehealth services. Opus enhances efficiency with features like intelligent lead routing, insurance verification, automated tasks, and customizable forms. It also includes advanced reporting, AI-driven progress note generation, and seamless lab integrations. With a focus on flexibility and scalability, Opus is ideal for small to large multi-center organizations in the behavioral health space.
-
10
OpenForecast is a package of general purpose, forecasting models written in Java that can be applied to any data series. No knowledge of forecasting is required. Using this package, the most appropriate algorithm for your data will be selected.
-
11
This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.
-
12
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
-
13
The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.
-
14
-
15
NAC is a collection of tools for cryptography. The goal is to provide simple-to-use crypto tools (like an OTP, String and number generator, public key algorithm...) you can use under Linux, Windows...
- Previous
- You're on page 1
- Next
