Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.
-
Updated
May 14, 2025 - C
Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.
TLSF: two-level segregated fit O(1) allocator
MAMBO-V: Dynamic Side-Channel Leakage Analysis on RISC-V
Two-Level Segregated Fit - O(1) Memory Allocation Algorithm
This repository contains the code and data associated with our paper "Tailorable codes for lattice-based KEMs with applications to compact ML-KEM instantiations", to appear in IACR TCHES 2025.
This C project takes a unique approach to linked lists. Using a pre-allocated memory pool, it generates sets of list heads and nodes at startup. By default, supports up to 10 lists with a total of 100 nodes (adjustable). Emphasizing speed and memory efficiency, this implementation is designed for integration into programs dependent on efficiency.
Secret independent (constant time) implementation of deterministic ECDSA nonces (RFC 6979).
Add a description, image, and links to the constant-time topic page so that developers can more easily learn about it.
To associate your repository with the constant-time topic, visit your repo's landing page and select "manage topics."