- 0

The C++ Galois Field Arithmetic Library, implements a specialised version of Galois Fields known as extension fields or in other words fields of the form GF(2^m) and was developed as a base for programming tasks that involved cryptography and error correcting codes.

http://galois.codeplex.com/Tags | addition algorithm arithmetic binary bit boost |

Implementation | C++ |

License | EPL |

Platform | Windows |

This is a C++ library providing classes and operators for arithmetic operations on general finite field elements.

arithmetic finite-field galois-field1. ElGamal encryption2. ECDSA / ElGamal signaturesBasics------Currently the only high-level operation implemented is Diffie-Hellman key exchanges:```rustextern crate ecc;use ecc::fields::{P256, R256}; // NIST's fields for P-256use ecc::curves::C256; // NIST's curve P-256use ecc::crypto::DiffieHellman;fn main() { type Curve = C192<P192, R192>; type Point = AffinePoint<Curve, P192, R192>; let (X, x): (Point, _) = DiffieHellman::key_gen(); let out = X.serialize(); // out: Vec<uint> -> Send

An exercise in implementing Sudoku solver with bit arithmetic.

* Commercial Support https://www.trueinteractions.com<h2>Status</h2>[![Codacy Badge](https://www.codacy.com/project/badge/6ea8c1d425af42cf9211a3ddf7a42240)](https://www.codacy.com/public/trevorlintongithub/tint2) | OSX | Windows | Linux | iOS | Android ---------- | ---------- | ---------- | ---------- | ---------- | ----------Build | [![Build Status](https://travis-ci.org/trueinteractions/tint2.svg?branch=master)](https://travis-ci.org/trueinteractions/tint2) | [![Build

Installs the boost libraries and creates the binary libraries

Schifra is a very robust, highly optimized and extremely configurable Reed-Solomon error correcting code library for both software and IP core based applications with implementations in C++ and VHDL.

addition algorithm bch block-code boostcommand line adaptive arithmetic encoding utility (32-bit probabilities)

This is afast and efficient binary compression method based on 2-byte data right (low) bit truncation to 8-bit dictionary entries . 6-bit binary compression method is based on 4-byte data translation through 6-bit parity table into compressed data . (htt

Library to perform arithmetic coding and decoding of text or binary data

Binary serialization at the bit level on top of the binary package

Solving simple arithmetic expressions using RPN and Shunting-yard Algorithm

32-bit and 64-bit fixed-point library for fast arithmetic operations. Suitable for performing computationally intensive operations on a computing platform that does not have a floating-point unit (like most smaller embedded systems, such as Cortex-M3, CortexM0, ATmega, PSoC 5, PSoC 5 LP, PSoC 4, Arduino platforms e.t.c). Common applications include BLDC motor control and image processing. Best performance on a 32-bit or higher architecture (although 8-bit architectures should still be fine).

boost-like libary for binary and numeric data manipulation

128-bit floating point library with 64 effective bits of precision (vs. 53 for the built-in Double type) and a 64 bit exponent (vs. 11 for Doubles). Greater range avoids under/overflows and makes log arithmetic unnecessary.