Search Results for "security"

XY modular Polynom manipulation in Java for calculating elliptic curves point order

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...

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)

...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. ...

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...

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...

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...

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.

compare time of process between rsa and elgamal algorithm used to encryption and digital signature.

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.

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.

Crypt-EG is an easy visual cryptosystem program that implements ElGamal method using elliptic curves.

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

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.

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.

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.

Provides efficient, effective implementations of 32- and 64-bit hash functions based on Rabin fingerprints / irreducible polynomials, in Java. Also provides integration with java.security.MessageDigest API.

<b>SicHer</b> is an encryption client that will allow secure chat across the internet using AES and a Diffe-Hellman key exchange.

Tool for performing special mathematic operations needed for cryptography on your mobile. Useful for cryptography-lectures.