Search Results for "encryption algorithm java"
Sort By:
Showing 50 open source projects for "encryption algorithm java"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
Cloud SQL for MySQL, PostgreSQL, and SQL ServerFully managed, cost-effective relational database service for PostgreSQL, MySQL, and SQL Server. Try Enterprise Plus edition for a 99.99% availability SLA and category-leading performance.
-
1
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of... -
2
Fractal Zoomer
A Fractal Zoomer with various functions.
An application that lets you render some of the most known fractal functions, like the Mandelbrot set and many more! It comes with alot of options to further enhance your fractal experience! Its easy to use and does not require installation. A java version higher than 1.8 is required to be installed. -
3
SHA256-in-C
SHA-256 Algorithm Implementation in C
-
4
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... -
Turn Your Content into Interactive Magic - For FreeTransform anything you share into an engaging digital experience - for free. Instantly convert your PDFs, slides, and files into dynamic, interactive sessions with built-in collaboration tools, activities, and real-time assessment. From teaching to training to team building, make every presentation unforgettable. Used by millions for education, business, and professional development.
-
5
TimescapeGlobal
a space-time interpolation geostatistical tool
This software is a time-aware geostatistical tool. Including time variability adds further issues to the already complicated field of geostatistical interpolation. On the other hand, most of the distributions of variables used in Earth and environmental sciences show patterns of change over time, not only in space. This tool is a free, open-source software, based on a generalization of the Inverse Distance Weighted algorithm. It outputs three-dimensional, layered discrete models from which... -
6
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
7
A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.
-
8
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... -
9
Flamethyst is a flame fractal renderer written in java. It generalizes the classical algorithm in several ways, and support most features of Apophysis .flame files.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
Jafaran
Fast and more random implementations of java.util.Random.
Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided... -
11
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). -
12
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. Concerning performance... -
13
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 -
14
MathParser Java - Math Parser library
Mathematical Parser for Java
This project gives a mathematical parser for converting a simple string expression into a result which can be managed for using in other calculations, all in Java. Using a couple lines of code, you'll be able to parse complex arithmetic expressions efficiently. This library is powered by Dijkstra's Shuting-yard algorithm. The library has no dependencies with other external libraries. Dependency <dependency> <groupId>com.google.code.mathparser-java</groupId... -
15
Fylogenetica
Constructing level-1-networks consistent with a set of quartets
This project is an implementation of an algorithm by J. Keijsper and R. Pendavingh. The goal of the algorithm is to construct a phylogenetic level-1-network that is consistent with a given set of quartets. -
16
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...
-
17
egrsa
rsa-elgamal comparison
compare time of process between rsa and elgamal algorithm used to encryption and digital signature. -
18
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... -
19
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. -
20
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.
-
21
HcryptoJ (Historical cryptology in Java) is a Java based programming library for implementing and analyzing historical ciphers. HcryptoJ is designed to support research and teaching in historical cryptography and computer science. Licensed under GPL.
-
22
superseded by SgpDec http://sgpdec.sf.net Java implementation of the holonomy algorithm for the algebraic hierarchical decomposition of finite state automata.
-
23
Optimization tool that mimics the darwinian reproduction, selection, mutation process. It has 2 components: the optimization algorithm and an interpretar to define function to optimize and constraints. It is all written in java (netbeans).
-
24
Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.
-
25
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.
