Search Results for "c algorithms"

Library and command line tools for XZ and LZMA compressed files

(New version 1.05 is released) Dynamic Arrays is a set of useful incredibly fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me...

LibSecRm (LIBrary for SECure ReMoval) is a set of replacements for these standard C functions which cause data removing from files. The data is first securely wiped on-the-fly, to protect the user's privacy, then the original functions are called. There is NO NEED to rebuild your software, because LibSecRm is a pre-loadable library, meaning you just need to RUN the software with LibSecRm loaded. LibSecRm is also a development library. The following wiping methods are supported:...

HashSum is a .NET port from GNU's md5sum and sha1sum. It supports: hash algorithm selection between MD5 and SHA1 (more could be added later) and compatibility between HashSum and GNU's checksum file format

Major looseless compression algorithms library and documentation. First project: Arithmetic, Huffman, LZ77, LZ78, LZW, RLE. Second project reimplements Deflate. Documentation explains major Entropy Compression Methods.

xcks is a cross-platform program which calculates and verifies checksums. It is able to read and write XCKS and ZXCKS checksums' files. xcks comes with libxcks which can be used independently of xcks. libxcks is a C++17 library. It can compute checkums, read and write XCKS and ZXCKS checksums' files. xcks is licensed under GPLv3+. libxcks is licensed under LGPLv3+.

Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items, such as files/directories, into as few as possible volumes of a specific size (e.g. CDs or DVDs).

Moved to GitHub.com/gdraheim/zziplib/ The ZZIPlib provides read access on ZIP-archives. The library uses only the patent-free compression-algorithms supported by Zlib. It provides functions that transparently access files being either real files or zipped files, both with the same filepath

A slightly reduced strength bulk encryption. In exchange for the reduced strength, you get the ability to rsync the encrypted files, so that local changes in the plaintext file will result in (relatively) local changes to the cyphertext file.

Use of Michael Rabin's Information Dispersal Algorithm to provide secure, dispersed storage in a networked environment. For full download, please get both Math-FastGF2 and Crypt-IDA releases under the files link. See project wiki for more information.

Command-line tool for identifying and uncompressing a wide array of archive formats. It aims to unlock old and hard-to-find archive types.

minidjvu is a DjVu encoder for black-and-white images.

OpenDark is a free simplification of 'dark'. It's the first open BWT-DC compressor, which has a simple code, high speed and compression ratio. And it's waiting for your ideas! :)

Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.

Destral is an open source, multiplatform implementation of the Hacha 3.0, Hacha 3.5 and HJSplit split and join algorithms. These utilities are widely used in forums and news to distribute one large file as many smaller files. A Qt GUI is also planned

Lossless compression program with various algorithms included. Intended for large XML files, but can compress any files. Best results with block compression (BWT+MTF+RLE) on large block over alphabet of words.

Basic Compression Library is a portable library of well known compression algorithms, such as Huffman coding, written in standard ANSI C. It is intended to serve as a set of building blocks for specialized compression algorithms.

A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.

PileWorks provides the organizational structure for coordinating several different projects which approach some aspect of Pile Technology. PileWorks defines a set of interfaces and implements some basic infrastructure for Pile engines and agents.

This is a very powerfull criptography project that basicaly can be used to transmit or store secure data and study some cipher, hash and compression algorithms to understands how it works.

Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.

ReHash is an easy-to-use console-based hash calculation tool written in C++. It supports many algorithms and output formats and it can be fully configured using some of the many command-line arguments which can be passed to the tool.

LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In...

Lrzip is a lossless compression application designed to scale with modern hardware resources using a variety of different back end compression algorithms with the ability to have unlimited size compression windows and optional high grade encryption. The larger the file the better the compression possible and the more powerful the hardware the faster it can compress with a heavily multithreaded design.