Search Results for "robust"

Common Lisp provides a SEARCH function to lookup given keys in a string, but its implementation can be subotimal: it can be beaten in some cases by even the simpliest brute-force algorithm. This project is aimed at implementing robust string matching algorithms for Common Lisp.

...That is to say that the algorithm which encrypts the information works in the same direction as the algorithm that decrypts it. This in itself is the very nature of quantum mechanics - "forward only". Through a quantum-entanglement-like operation, we created very robust encryption methodology which will secure information for some time to come through sheer numbers and flexibility. With 2^65536 possible keys a brute force attack on a key is simply infeasible. The full version, due to release March 11, 2013 will allow password protection which helps protect your information by forcing the impostor to not only produce the 65536 bit key, but have your password as well and allows for individual passwords for individual files.