Technical Fundamentals & Core Skills Topics
Core technical concepts including algorithms, data structures, statistics, cryptography, and hardware-software integration. Covers foundational knowledge required for technical roles and advanced technical depth.
Number Theory and Mathematical Foundations of Cryptography
The mathematics underpinning cryptographic schemes: modular arithmetic, prime generation, discrete logarithms, group and field theory, and hardness assumptions. Covers deriving why schemes are secure and the parameter choices that keep them so. The theory layer distinguishing a cryptographer from a library user.
Post-Quantum and Lattice-Based Cryptography
Cryptography designed to resist quantum attacks: lattice-based schemes, the underlying hard problems (LWE, SIS), and the mathematics of post-quantum standards. Covers why current public-key schemes are vulnerable to quantum algorithms and how migration candidates work. A specialized, forward-looking cryptography area.
Symmetric Encryption and Block Ciphers
Symmetric-key cryptography: block-cipher design (AES, Feistel structures), modes of operation, stream ciphers, and authenticated encryption with associated data (AEAD). Covers padding, IV/nonce handling, and the failure modes of misusing modes. Foundational for anyone building or evaluating data-at-rest and data-in-transit protection.
Cryptography Fundamentals
Core concepts and vocabulary of cryptography: confidentiality, integrity, authentication, and non-repudiation; the difference between symmetric and asymmetric primitives; and how standard algorithms, libraries, and protocols fit together. Covers threat models, common standards, and applying primitives and cryptographic libraries correctly to real-world security problems. The entry point for the cryptography track.
Asymmetric Cryptography and Key Exchange
Public-key cryptography: RSA, Diffie-Hellman, elliptic-curve cryptography, and public-key infrastructure (PKI). Covers key establishment and agreement protocols, certificate trust chains, and the mathematical hardness assumptions each scheme rests on. Essential for TLS, secure messaging, and identity systems.
Hashing and Hash Tables
How hash tables and hash-based structures work internally, and how to reason about their performance and correctness. Covers hash function properties (determinism, uniform distribution, speed, avalanche effect), cryptographic versus non-cryptographic hash choices, collision resolution (separate chaining, open addressing: linear probing, quadratic probing, double hashing, Robin Hood hashing, cuckoo hashing), load factor and amortized-cost resizing, and what makes an object hashable (the __hash__/__eq__ contract, immutability, custom composite keys). Covers hash-map-backed cache design (LRU and LFU eviction, TTL) and thread-safe concurrent hash maps (lock striping, CAS-based updates, safe concurrent resizing). Also covers hash-based structures beyond arrays and strings: consistent hashing for distributed routing and sharding, hash joins, hash-flooding and algorithmic-complexity security attacks and their mitigations, and probabilistic membership/cardinality structures such as Bloom filters, Cuckoo filters, Count-Min Sketch, and HyperLogLog. Excludes using a hash map purely as an optimization trick inside an array or string problem (two-sum, group anagrams, longest substring without repeating characters); that pattern belongs to Arrays, Strings, and Hashing. This topic is about the hash table itself: how it is built, how it fails under skewed or adversarial input, and how it scales.
Zero-Knowledge Proofs and Advanced Primitives
Advanced cryptographic constructions: zero-knowledge proofs, commitment schemes, secure multiparty computation, and homomorphic techniques. Covers the properties (completeness, soundness, zero-knowledge) and the settings where these primitives enable privacy-preserving verification. Frontier material for research-oriented cryptography roles.
Cryptographic Hashing and Digital Signatures
Cryptographic hash functions (collision resistance, preimage resistance), message authentication codes, and digital-signature schemes. Covers HMAC, signature verification, and how hashing underpins integrity, commitments, and authentication. Distinct from non-cryptographic hashing used in data structures.
Bit Manipulation
Working directly with binary representations: bitwise operators, masking, shifting, bit counting, and integer-encoding tricks. Covers using bit-level operations for compact state, fast arithmetic, and low-level optimization. Especially relevant where memory and cycles are constrained.