Search Results for "security"
Sort By:
Showing 47 open source projects for "security"
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.
-
Context for your AI agentsBuild data pipelines that feed your AI models and agents without managing infrastructure. Crawl any website, transform content, and push directly to your preferred vector store. Use 10,000+ tools for RAG applications, AI assistants, and real-time knowledge bases. Monitor site changes, trigger workflows on new data, and keep your AIs fed with fresh, structured information. Cloud-native, API-first, and free to start until you need to scale.
-
1
Msieve 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
-
2
CRC RevEng
Arbitrary-precision CRC calculator and algorithm finder
CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams'... -
3
SHA256-in-C
SHA-256 Algorithm Implementation in C
-
4
ExRandom
Sampling exactly from the normal and exponential distributions
ExRandom is a small header-only C++11 library for exact sampling from the normal, exponential, and discrete normal distributions (provided that the underlying generator is perfect). This library provides an implementation of the algorithms described in C. F. F. Karney, Sampling exactly from the normal distribution, ACM Trans. Math. Software 42(1), 3:1-14 (Jan. 2016), https://doi.org/10.1145/2710016, https://arxiv.org/abs/1303.6257. -
Reach Your Audience with Rise Vision, the #1 Cloud Digital Signage Software SolutionRise Vision is the #1 digital signage company, offering easy-to-use cloud digital signage software compatible with any player across multiple screens. Forget about static displays. Save time and boost sales with 500+ customizable content templates for your screens. If you ever need help, get free training and exceptionally fast support.
-
5
mep4j
Math Expression Parser 4 Java
Math Expression Parser 4 Java MEP4J is a high performance math expression strings parser for Java (J2SE >= 5). Compare its performance against similiar libraries and let me know your experince. The library manages the 5 operators (+, -, /, %, *) together with the following functions: - "abs" - "cos" - "sin" - "acos" - "asin" - "cosh" - "sinh" - "tan", - "tanh" - "atan" - "sqrt" - "cbrt" - "root" - "log" - "log10" - "log1p" - "exp" - "expm1" - "atan2" - "pow" The... -
6
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) -
7
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for... -
8
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). -
9
SEPIA: Security-oriented PN Framework
Petri net framework for security related modeling and reasoning.
...Along Place/Transition-nets, it supports Petri nets with distinguishable token colors and defines coloured workflow nets, where coloured tokens are interpreted as data elements used during process execution. To support information flow analysis of processes, SEPIA defines so-called IF-Nets, tailored for security-oriented workflow modeling which enable users to assign security-levels (HIGH, LOW) to transitions, data elements and persons/agents participating in the process execution. SEPIA builds upon TOVAL (http://sourceforge.net/p/toval), JAGAL (http://sourceforge.net/p/jagal) and SEWOL (https://sourceforge.net/projects/jawl/). To use SEPIA, make sure these libraries are on the build path. ... -
AestheticsPro Medical Spa SoftwareAestheticsPro is the most complete Aesthetics Software on the market today. HIPAA Cloud Compliant with electronic charting, integrated POS, targeted marketing and results driven reporting; AestheticsPro delivers the tools you need to manage your medical spa business. It is our mission To Provide an All-in-One Cutting Edge Software to the Aesthetics Industry.
-
10
WOLFGANG
Editor for Petri nets
Wolfgang is a lightweight tool that allows users to easily create and edit Petri nets and check them against general and workflow specific net properties. Specifically, Wolfgang supports full PNML conform editing functionality of Place-Transition Nets (P/T-Nets) and Colored Petri Nets (CPN) as they are defined in the SEPIA package. Its simple and easy to use interface allows to quickly create Petri nets from scratch, edit them graphically in many ways, store and even export them as PDFs. Use... -
11
xorlisp
Bit level lambda continuations and nothing else - Queue automata
Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a... -
12
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of... -
13
Visual Integer Factor
Puzzle game demonstrating whats so hard about binary integer factoring
VisualIntFactor will be an interactive educational and scientific tool demonstrating multiply, factor, conversion between unary counting and binary integers, all in the same grid of hexagons. This grid is based on pascals triangle, which is a 1d cellular automata that calculates (X choose Y) factorials by each cell being the sum of the 2 cells upleft and upright. Draw a binary integer from a cell going upright, then explore the allowed transforms which may lead you to a factored state in 2... -
14
Pythia
High quality fast "true random" number generator (shuffling) for JS
:: Pythia :: This is a high quality fast "true random" number generator / shuffling system. This means that Pythia never ever repeats the same numbers again regardless of how many tests you do. This also means that it never generates any numbers in a predictable order no matter how many times you refresh. Pythia solves a great problem and is by far the best solution out there. How to use: var my_pythia = new pythia(); Pythia API: .generate - Generate a new random... -
15
MathX
Fixed-length Arithmetic-types library
MathX is a fixed-length arithmetic-types written in pure c++ templates. The goal is to provide signed-integer, unsigned-integer, IEEE-754 float-point and fixed-point types, all with specific number of bits. To this moment, only signed-integer and unsigned-integer are completed for little-endain architecture. Any compiler that support c++03 or c++11 can successfully compile MathX. Refer to README for more information. -
16
A collection of small utilities with a connection to cryptography and cryptanalysis. Written for efficiency and a small memory footprint.
-
17
RSAT
A script to perform SAT attacks on RSA
SAT solvers are being used more and more in partial key exposure attacks. The scope of this script is to show that SAT solvers can be used in partial key exposure attacks of RSA with very good results. -
18
FroZenLight connects simple line art and mathematics. The source of light can be positioned so that either symmetric reflection patterns or secret messages (Cryptography) are created. Example light patterns and math exercises for education are provided.
-
19
egrsa
rsa-elgamal comparison
compare time of process between rsa and elgamal algorithm used to encryption and digital signature. -
20
mcrypt, and the accompanying libmcrypt, are intended to be replacements for the old Unix crypt, except that they are under the GPL and support an ever-wider range of algorithms and modes.
-
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
Matlab, Maple and C/C++ applications of Linear Algebra in many domains, including curves in many dimensions, Cryptography and Chaos etc.
-
23
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.
-
24
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.
-
25
a number of clients try to find a secret key by calculating the encryptions to all possible keys of a given key range and comparing them to the encryptin of the secret key until a matching one is detected....
