Search Results for "security linux"
Sort By:
38 projects for "security linux" with 2 filters applied:
-
$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.
-
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
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
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. -
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
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... -
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
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... -
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. -
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.
-
10
A collection of small utilities with a connection to cryptography and cryptanalysis. Written for efficiency and a small memory footprint.
-
11
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. -
12
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.
-
13
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.
-
14
Matlab, Maple and C/C++ applications of Linear Algebra in many domains, including curves in many dimensions, Cryptography and Chaos etc.
-
15
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.
-
16
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.
-
17
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....
-
18
-
19
Crypt-EG is an easy visual cryptosystem program that implements ElGamal method using elliptic curves.
-
20
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.
-
21
CryptoHelper is a Java program designed to aid in the decryption of classical ciphers, ie pre WWII ciphers. It brings together tools like frequency analysis, friedman tests, enciphering/deciphering for several clasical ciphers, and brute force algorithm
-
22
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.
-
23
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.
-
24
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...
-
25
Ganzúa is a cryptanalysis tool for classical ciphers (mono and polyalphabetic) that lets the user define almost completely arbitrary cipher and plain alphabets, allowing for the proper cryptanalysis of cryptograms obtained from non-English texts.
