Search Results for "encryption algorithm java" - Page 2

Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml

Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all...

A library help for signing data with PKCS11 token (certificates with SHA1withRSA Sign Algorithm) and create CMS packages. It uses Bouncy Castle Crypto API and SUNPKCS11. Also it verify the signed data and verify signing certificate's OCSP control.

JConfigura is a library usable in java environments for sharing configuration parameters between different java applications. Moreover it exculpates developers of aspects like property file reading and securing property files with rsa encryption.

The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources.

LEA is a lightweight eyetracking algorithm library (hence the name) written in and for Java. LEA is able to track eye movements with an ordinary webcam and returns relative movements (up, down, ...). It is also able to compensate for slight head motions.

JEnigma is a java API to implement the Enigma cipher, as used by the Enigma encryption machine.

The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.