Main > Free Download Search >

Free cryptography algorithms software for linux

cryptography algorithms

Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 813
Robsort Sorting Algorithm 1.0

Robsort Sorting Algorithm 1.0


Robsort Sorting Algorithm is a sorting algorithm which uses random numbers. more>>
Robsort in a GNU public license sorting algorithm devleloped by Robert Thompson. Robsort uses random number generation to sort arrays of integers. It is claimed to be the worlds least efficient sorting algorithm.

Scientists have calculated the robsort algorithm to approach an order of [n!] (n factorial) inefficiency, however this inefficiency could only theoretically be obtained by using truly random numbers.
<<less
Download (0.10MB)
Added: 2005-06-06 License: GPL (GNU General Public License) Price:
1601 downloads
C Algorithms Library 1.0.0

C Algorithms Library 1.0.0


C Algorithms Library is a collection of commonly used Computer Science algorithms. more>>
C Algorithms Library is a collection of commonly used Computer Science algorithms.
The focus is on code that is well documented and tested, portable, and reusable.
The C Programming Language has a much smaller standard library compared to other more modern programming languages such as Java or Python.
In particular, it lacks implementations of many common data structures and algorithms. This is a collection of such algorithms to attempt to alleviate this problem.
The source code is released under the Modified BSD license, and as such can be freely modified and reused in any project, either proprietary or free. It is written in 100% ANSI standard C.
Each algorithm is written to be independent from the other implementations, allowing particular algorithms to be included in projects as needed.
Data structures
Collections
ArrayList : Automatically resizing array.
Doubly linked list : A set of values stored in a list with links that point in both directions.
Singly linked list : A set of values stored in a list with links that point in one direction.
Queue : Double ended queue which can be used as a FIFO or a stack.
Set : Unordered set of values.
Mappings
Hash table : Collection of values which can be addressed using a key.
Trie : Fast mapping using strings as keys.
Binary search trees
AVL tree : Balanced binary search tree with O(log n) worst case performance.
Utility functions
All of the above data structures operate on void pointers. It is sometimes necessary to compare values (when sorting a list, for example) or generate a hash key (in a hash table or set). This is done by providing a pointer to a function which provides this functionality. The following functions provide this functionality for some common data types.
- Integer comparison and hash functions.
- String comparison and hash functions.
- Generic (void) pointer comparison and hash functions.
<<less
Download (0.33MB)
Added: 2006-01-31 License: BSD License Price:
1376 downloads
Optimization Algorithm Toolkit 1.3

Optimization Algorithm Toolkit 1.3


Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with optimization algorithms. more>>
Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. The project was developed initially by Jason Brownlee as a part of his Ph.D. program.
The goal of this project is to deliver obscure-and-prevalent, old-and-new optimization algorithms from research literature to both research scientists and algorithm practitioners alike. Algorithms include biologically inspired approaches such as evolutionary algorithms (genetic algorithms), swarm algorithms (ants and particle swarm), and immune system algorithms.
Also included are more conventional approaches such as approaches inspired by physics including simulated annealing and extremal optimization. Problem domains include numerical function optimization, traveling salesman problems, and protein folding all with many standard benchmark instances taken from research literature.
A user-friendly graphical interface is provided to rapidly evaluate and compare algorithm and problem configurations, visualize algorithm behavior, and graph algorithm performance over time. A robust, modular, and extensible framework underlies the platform to facilitate the easy addition and modification of algorithms, addition of new problem domains and problem instances as well as facilitate more advanced algorithm experimentation.
The algorithm implementations are extensible and easily support modification and applicaition to varied problem domains. Please report any bugs, feature requests or include your own algorithms by accessing the services on the project home website. This is an open source project (released under the GPL) so the source code is available. The project was compiled with Java 1.5 (update 9).
Enhancements:
- This release includes many framework and graphical interface fixes, as well as a few new algorithms to play with.
<<less
Download (6.5MB)
Added: 2007-07-14 License: GPL (GNU General Public License) Price:
843 downloads
Algorithm::Loops 1.031

Algorithm::Loops 1.031


Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. more>>
Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*.

SYNOPSYS

use Algorithm::Loops qw(
Filter
MapCar MapCarU MapCarE MapCarMin
NextPermute NextPermuteNum
NestedLoops
);

my @copy= Filter {tr/A-Z.,"()/a-z/d} @list;
my $string= Filter {s/s*$/ /} @lines;

my @transposed= MapCarU {[@_]} @matrix;

my @list= sort getList();
do {
usePermutation( @list );
} while( NextPermute( @list ) );

my $len= @ARGV ? $ARGV[0] : 3;
my @list= NestedLoops(
[ ( [ 1..$len ] ) x $len ],
sub { "@_" },
);

If you want working sample code to try, see below in the section specific to the function(s) you want to try. The above samples only give a feel for how the functions are typically used.

<<less
Download (0.022MB)
Added: 2006-10-12 License: Perl Artistic License Price:
1107 downloads
C++ Elliptic Curve Cryptography library 0.11.1

C++ Elliptic Curve Cryptography library 0.11.1


C++ Elliptic Curve Cryptography library is a C++ library for elliptic curves cryptography. more>>
C++ Elliptic Curve Cryptography library is a C++ library for elliptic curves cryptography.
Libecc is a C++ elliptic curve cryptography library that supports fixed-size keys for maximum speed.
The goal of this project is to become the first free Open Source library providing the means to generate safe elliptic curves, and to provide an important source of information for anyone with general interest in ECC.
Enhancements:
- This version brings the code completely up to date again with the latest of version of the working set (autoconf, compiler, etc.).
- The previous version was almost two years old and didnt even compile anymore.
<<less
Download (1.4MB)
Added: 2006-11-22 License: GPL (GNU General Public License) Price:
1092 downloads
Algorithm::Cluster 1.35

Algorithm::Cluster 1.35


Algorithm::Cluster is a Perl interface to the C Clustering Library. more>>
Algorithm::Cluster is a Perl interface to the C Clustering Library.

This module is an interface to the C Clustering Library, a general purpose library implementing functions for hierarchical clustering (pairwise simple, complete, average, and centroid linkage), along with k-means and k-medians clustering, and 2D self-organizing maps.

This library was developed at the Human Genome Center of the University of Tokyo. The C Clustering Library is distributed along with Cluster 3.0, an enhanced version of the famous Cluster program originally written by Michael Eisen while at Stanford University.

<<less
Download (0.048MB)
Added: 2007-05-16 License: Perl Artistic License Price:
894 downloads
Algorithm::SkipList 1.02

Algorithm::SkipList 1.02


Algorithm::SkipList is a Perl implementation of skip lists. more>>
Algorithm::SkipList is a Perl implementation of skip lists.

SYNOPSIS

my $list = new Algorithm::SkipList();

$list->insert( key1, value );
$list->insert( key2, another value );

$value = $list->find(key2);

$list->delete(key1);

This is an implementation of skip lists in Perl.

Skip lists are similar to linked lists, except that they have random links at various levels that allow searches to skip over sections of the list, like so:

4 +---------------------------> +----------------------> +
| | |
3 +------------> +------------> +-------> +-------> +--> +
| | | | | |
2 +-------> +--> +-------> +--> +--> +--> +-------> +--> +
| | | | | | | | |
1 +--> +--> +--> +--> +--> +--> +--> +--> +--> +--> +--> +
A B C D E F G H I J NIL

A search would start at the top level: if the link to the right exceeds the target key, then it descends a level.

Skip lists generally perform as well as balanced trees for searching but do not have the overhead with respect to inserting new items. See the included file Benchmark.txt for a comparison of performance with other Perl modules.

<<less
Download (0.030MB)
Added: 2007-05-17 License: Perl Artistic License Price:
895 downloads
Cryptonit 0.9.7

Cryptonit 0.9.7


Cryptonit is a client side cryptographic tool which allows you to encrypt/decrypt and sign/verify files with PKI certificates. more>>
Cryptonit project is a client side cryptographic tool which allows you to encrypt/decrypt and sign/verify files with PKI (Public Key Infrastructure) certificates.
Main features:
- Encryption/decryption based on highly reliable algorithms
- Signature/verification procedures ensuring tamper-proof documents
- Use of passwords, certificates & smart (chip) cards for file encryption
- Address book for saving and organizing contacts
- Ability to import contacts and their certificates from the corporate directory (LDAP import)
- Multiple user account management
- Interfaces in both English and French
- CRL download
- RSA cryptography (public key cryptography standard)
<<less
Download (2.4MB)
Added: 2006-05-23 License: GPL (GNU General Public License) Price:
1252 downloads
Parallel Genetic Algorithm Library 0.99

Parallel Genetic Algorithm Library 0.99


Parallel Genetic Algorithm Library is a C++ toolkit for producing genetic algorithm code. more>>
Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors.

This is useful not only for those with multi-processor computers, but also for distributed and cluster computing genetic algorithm environments such as openMosix.

<<less
Download (0.074MB)
Added: 2007-06-29 License: GPL (GNU General Public License) Price:
852 downloads
Algorithm::LUHN 1.00

Algorithm::LUHN 1.00


Algorithm::LUHN is a Perl module to calculate the modulus 10 double add double checksum. more>>
Algorithm::LUHN is a Perl module to calculate the modulus 10 double add double checksum.

SYNOPSIS

use Algorithm::LUHN qw/check_digit is_valid/;

$c = check_digit("43881234567");
print "It worksn" if is_valid("43881234567$c");

$c = check_digit("A2C4E6G8"); # this will cause an error

print "Valid LUHN characters are:n";
my %vc = Algorithm::LUHN::valid_chars();
for (sort keys %vc) {
print "$_ => $vc{$_}n";
}

Algorithm::LUHN::valid_chars(map {$_ => ord($_)-ord(A)+10} A..Z);
$c = check_digit("A2C4E6G8");
print "It worked againn" if is_valid("A2C4E6G8$c");

This module calculates the Modulus 10 Double Add Double checksum, also known as the LUHN Formula. This algorithm is used to verify credit card numbers and Standard & Poors security identifiers such as CUSIPs and CSINs.

You can find plenty of information about the algorithm by searching the web for "modulus 10 double add double".

<<less
Download (0.004MB)
Added: 2007-05-16 License: Perl Artistic License Price:
893 downloads
Algorithm::Merge 0.08

Algorithm::Merge 0.08


Algorithm::Merge is a Perl module package that provides three-way merge and diff. more>>
Algorithm::Merge is a Perl module package that provides three-way merge and diff.

SYNOPSIS

use Algorithm::Merge qw(merge diff3 traverse_sequences3);

@merged = merge(@ancestor, @a, @b, {
CONFLICT => sub { }
});

@merged = merge(@ancestor, @a, @b, {
CONFLICT => sub { }
}, $key_generation_function);

$merged = merge(@ancestor, @a, @b, {
CONFLICT => sub { }
});

$merged = merge(@ancestor, @a, @b, {
CONFLICT => sub { }
}, $key_generation_function);

@diff = diff3(@ancestor, @a, @b);

@diff = diff3(@ancestor, @a, @b, $key_generation_function);

$diff = diff3(@ancestor, @a, @b);

$diff = diff3(@ancestor, @a, @b, $key_generation_function);

@trav = traverse_sequences3(@ancestor, @a, @b, {
# callbacks
});

@trav = traverse_sequences3(@ancestor, @a, @b, {
# callbacks
}, $key_generation_function);

$trav = traverse_sequences3(@ancestor, @a, @b, {
# callbacks
});

$trav = traverse_sequences3(@ancestor, @a, @b, {
# callbacks
}, $key_generation_function);

USAGE

This module complements Algorithm::Diff by providing three-way merge and diff functions.

In this documentation, the first list to diff3, merge, and traverse_sequences3 is called the `original list. The second list is the `left list. The third list is the `right list.

The optional key generation arguments are the same as in Algorithm::Diff. See Algorithm::Diff for more information.

<<less
Download (0.010MB)
Added: 2007-05-16 License: Perl Artistic License Price:
892 downloads
Algorithm::SixDegrees 0.03

Algorithm::SixDegrees 0.03


Algorithm::SixDegrees is a Perl module that can find a path through linked elements in a set. more>>
Algorithm::SixDegrees is a Perl module that can find a path through linked elements in a set.

SYNOPSIS

use Algorithm::SixDegrees;

my $sd1 = Algorithm::SixDegrees->new();
$sd1->data_source( actors => &starred_in );
$sd1->data_source( movies => &stars_of );
@elems = $sd1->make_link(actors, Tom Cruise, Kevin Bacon);

my $sd2 = Algorithm::SixDegrees->new();
$sd2->forward_data_source( friends => &friends, @args );
$sd2->reverse_data_source( friends => &friend_of, @args );
@elems = $sd2->make_link(friends, Bob, Mark);

Algorithm::SixDegrees is a Perl implementation of a breadth-first search through a set of linked elements in order to find the shortest possible chain linking two specific elements together.

In simpler terms, this module will take a bunch of related items and attempt to find a relationship between two of them. It looks for the shortest (and generally, simplest) relationship it can find.

<<less
Download (0.011MB)
Added: 2007-05-17 License: Perl Artistic License Price:
891 downloads
Crypto++ 5.5

Crypto++ 5.5


Crypto++ project is a free C++ class library of cryptographic schemes. more>>
Crypto++ project is a free C++ class library of cryptographic schemes.
Main features:
- a class hierarchy with an API defined by abstract base classes
- AES (Rijndael) and AES candidates: RC6, MARS, Twofish, Serpent, CAST-256
- other symmetric block ciphers: IDEA, DES, Triple-DES (DES-EDE2 and DES-EDE3), DESX (DES-XEX3), RC2, RC5, Blowfish, Diamond2, TEA, SAFER, 3-WAY, GOST, SHARK, CAST-128, Square, Skipjack, Camellia, SHACAL-2
- generic cipher modes: ECB, CBC, CBC ciphertext stealing (CTS), CFB, OFB, counter mode (CTR)
- stream ciphers: Panama, ARC4, SEAL, WAKE, WAKE-OFB, BlumBlumShub
- public-key cryptography: RSA, DSA, ElGamal, Nyberg-Rueppel (NR), Rabin, Rabin-Williams (RW), LUC, LUCELG, DLIES (variants of DHAES), ESIGN
- padding schemes for public-key systems: PKCS#1 v2.0, OAEP, PSS, PSSR, IEEE P1363 EMSA2 and EMSA5
- key agreement schemes: Diffie-Hellman (DH), Unified Diffie-Hellman (DH2), Menezes-Qu-Vanstone (MQV), LUCDIF, XTR-DH
- elliptic curve cryptography: ECDSA, ECNR, ECIES, ECDH, ECMQV
- one-way hash functions: SHA-1, MD2, MD4, MD5, HAVAL, RIPEMD-128, RIPEMD-256, RIPEMD-160, RIPEMD-320, Tiger, SHA-2 (SHA-224, SHA-256, SHA-384, and SHA-512), Panama, Whirlpool
- message authentication codes: MD5-MAC, HMAC, XOR-MAC, CBC-MAC, DMAC, Two-Track-MAC
- cipher constructions based on hash functions: Luby-Rackoff, MDC
- pseudo random number generators (PRNG): ANSI X9.17 appendix C, PGPs RandPool
- password based key derivation functions: PBKDF1 and PBKDF2 from PKCS #5
- Shamirs secret sharing scheme and Rabins information dispersal algorithm (IDA)
- DEFLATE (RFC 1951) compression/decompression with gzip (RFC 1952) and zlib (RFC 1950) format support
- fast multi-precision integer (bignum) and polynomial operations, with SSE2 optimizations for Pentium 4 processors, and support for 64-bit CPUs
- finite field arithmetics, including GF(p) and GF(2^n)
- prime number generation and verification
- various miscellaneous modules such as base 64 coding and 32-bit CRC
- class wrappers for these operating system features (optional):
- high resolution timers on Windows, Unix, and MacOS
- Berkeley and Windows style sockets
- Windows named pipes
- /dev/random and /dev/urandom on Linux and FreeBSD
- Microsofts CryptGenRandom on Windows
- A high level interface for most of the above, using a filter/pipeline metaphor
- benchmarks and validation testing
- FIPS 140-2 Validated
Enhancements:
- This release added VMAC and Sosemanuk, and improved the speed of several other algorithms using x86/x86-64/MMX/SSE2 assembly.
- Random number generators and DSA-like signature algorithms were modified to reduce the risk of reusing random numbers and IVs after virtual machine state rollback.
<<less
Download (0.98MB)
Added: 2007-05-06 License: BSD License Price:
921 downloads
Algorithm::AhoCorasick 0.01

Algorithm::AhoCorasick 0.01


Algorithm::AhoCorasick provides efficient search for multiple strings. more>>
Algorithm::AhoCorasick provides efficient search for multiple strings.

Aho-Corasick is a classic (1975) algorithm for locating elements of a finite set of strings within an input text. It constructs a finite state machine from a list of keywords, then uses the machine to locate all occurrences of the keywords.

Construction of the machine takes time proportional to the sum of the lengths of the keywords and the machine processes the input string in a single pass - that is, the algorithm may be considerably more efficient than searching for each keyword separately.

<<less
Download (0.005MB)
Added: 2007-03-30 License: Perl Artistic License Price:
943 downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 5
  • 1
  • 2
  • 3
  • 4
  • 5