Data Structures for Cryptography Questions

Focuses on the data representations and structures that support correct and efficient cryptographic implementations. Candidates should be able to reason about representations for large integers and limb arrays, bitsets and bit operations, byte buffers and memory layout, hash table use for key indexing, ring buffers for streaming processing, and data structures used in key stores and certificate caches. Topics include memory alignment, endianness, secure memory erasure, constant time access patterns, concurrency and thread safety, and the performance and security trade offs that follow from different structure choices.