briansmith/ring
Ring
Ring is a low-level cryptographic primitive library and security toolset designed for building portable, secure applications. It provides a collection of implementations for RSA, elliptic curve cryptography, and authenticated symmetric encryption.
The project focuses on constant-time cryptography to prevent secret data from leaking through timing side-channel attacks. It utilizes a formal verification tool that generates arithmetic logic from templates, ensuring mathematical correctness and eliminating manual implementation errors.
The library includes capabilities for producing cryptographically strong random sequences for keys and salts, as well as tools for authenticated stream encryption. It supports a cross-platform build process that allows binaries to be compiled for multiple hardware architectures using specific system roots and toolchains.
Correctness is maintained through exhaustive vector testing and an extended suite of cryptographic checks to verify primitives.
Features
- Cross-Platform Cryptographic Primitives - Provides a portable set of low-level cryptographic primitives including RSA and elliptic curve operations.
- Cryptographic Primitives - Implements a portable collection of low-level cryptographic primitives for building secure applications.
- Formal Verification Generators - Generates formally proven cryptographic arithmetic logic from templates to eliminate manual implementation errors.
- Timing Attack Prevention - Writes cryptographic code that executes in fixed time to prevent secret data leakage.
- Cryptographic Random Number Generators - Produces cryptographically strong random sequences for secure keys, nonces, and salts.
- Verified Implementations - Provides formally verified cryptographic arithmetic implementations to ensure mathematical correctness.
- Elliptic Curve Cryptography - Implements fundamental elliptic curve primitives for secure key exchanges and digital signatures.
- RSA Implementations - Performs asymmetric encryption and decryption tasks using the RSA algorithm.
- Timing-Side-Channel Protections - Uses constant-time coding patterns and fixed-length arithmetic to mitigate timing side-channel attacks.
- Verified Arithmetic Logic - Generates formally verified arithmetic logic from templates to ensure mathematical correctness in cryptographic operations.
- Constant-Time Arithmetic Logics - Implements branchless arithmetic logic to prevent secret data leaks through timing side-channel attacks.
- Formal Verification Tools - Utilizes a formal verification tool to generate mathematically proven arithmetic logic from templates.
- Cryptographic Toolchains - Supports a cross-platform build process for compiling cryptographic binaries across multiple hardware architectures and system roots.
- Cross-Architecture Binary Compilation - Compiles software into executable binaries for multiple target hardware architectures.
- Cross-Compilation Toolchains - Supports generating executable binaries for diverse hardware architectures from a single host.
- Authenticated Encryption - Provides authenticated encryption modes to ensure the confidentiality and integrity of data streams.
- Low-Level Cryptography Toolsets - Offers a portable set of low-level primitives for authenticated encryption and secure random generation.
- AEAD Encryptions and Decryptions - Provides authenticated encryption with associated data (AEAD) to ensure stream confidentiality and integrity.
- Primitive Vector Validators - Validates cryptographic correctness using extensive input vector suites and failure logging.
- Cryptographic Test Vectors - Validates cryptographic correctness by running extensive suites of input vectors for edge-case analysis.
- Test Suite Execution - Executes an extended suite of cryptographic checks and slow tests to ensure correctness.
- Rust Cryptography - Safe and fast crypto primitives using BoringSSL.
