Search Results for "security software"
Sort By:
Showing 17 open source projects for "security software"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
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'... -
2
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. -
3
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) -
4
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... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
SEPIA: Security-oriented PN Framework
Petri net framework for security related modeling and reasoning.
SEPIA provides implementations for various types of Petri nets. 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... -
6
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... -
7
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... -
8
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... -
9
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. -
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
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.
-
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
MpNT is a multi-precision number theory library that provides a base for building cryptographic applications. It may however be used in any domain where efficient integer, modular, and floating-point computations involving large numbers are required.
-
13
GiANT is a graphical interface for computer algebra systems (OS X/UNIX/Win). Currently GiANT lets the user work with number fields via KASH, but we aim to develop it into a GUI Library to run on top of any CAS and expose any of its functions.
-
14
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...
-
15
Java Randomness Test Suite is a gui application to run randomness tests on random stream resource (file or algorithm). Application can be run in command line. Includes general statistical tests, NIST and DIEHARD tests.
-
16
Multiprecision unsigned number template library (MUNTL). The program is intended for the organization of calculations with the big precision for unsigned numbers. Program is very fast because do not use any heap call (new, malloc etc.)
-
17
- Previous
- You're on page 1
- Next
