Search Results for "c call tree"

This release marks the first production-ready publication of 1654, a dependency-free cryptographic vault engine built around a strict vault abstraction and a wide-state cryptographic design. 1654 is not a wrapper around existing crypto libraries. It is a self-contained system whose cryptographic behavior is fully defined within the repository. Key Characteristics Vault-oriented model Encrypted data is treated as a sealed container-safe with explicit operations, not as a...

[IMPORTANT] Retroshare is now distributed on Github. Please go to http://retroshare.net to find the latest releases and sources. RetroShare is a cross-platform, secured and decentralized communication system. It lets you to securely chat, share photos, videos, and more with family and friends, using OpenPGP to authenticate peers and OpenSSL to encrypt all communication.

Cryptographically-secure Random Number Generator.It is seeded with a 480-bit key and a 480-bit nonce. The target technology is a stream cipher. Each call to ::Invoke() returns a 32bit word. ( insert notes here about SALMON's operating speed ) SALMON uses a block cipher called SERPENT at the very end portion of its output. SERPENT was a finalist from the NIST selection tournaments. There is also mild use of a portion of Salsa20/12 called a "quarter round function"....

Hash mode interface to the Keccak code package. This program illustrates the use of the Keccak permutation. Usage is much more than a hash function. The NIST compatible settings are subject to change when they publish FIPS PUB 180-5. I wrote this program when evaluating the permutation and developing tree hashing for the Intel(R) MIC architecture.

The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(

Multiprecision unsigned number template library (MUNTL). The program is intended for the organization of calculations with the big precision for unsigned numbers. Program is very fast because do not use any heap call (new, malloc etc.)

The modWASTE project is used by WASTE developers to experiment with modifications that may be added to the main WASTE source tree. These modifications are experiments for WASTE 2. modWASTE may eventually contain features not avalible in WASTE.