Symmetric Encryption and Block Ciphers Questions

How symmetric-key primitives are constructed and why they work: block-cipher internals (Feistel networks vs substitution-permutation networks, the AES round structure and S-box design, key schedules and why a weak one degrades security), stream ciphers (ChaCha20 and CTR-mode keystream generation), and the internal mechanics of modes of operation (ECB, CBC, CTR, XTS, GCM), including why some are parallelizable, why ECB leaks structure, and why some require a unique nonce. Covers authenticated encryption construction internals (how GHASH and Poly1305 work, why nonce reuse breaks their security algebraically, formal security notions like IND-CPA and INT-CTXT), padding schemes and the mechanics of padding-oracle attacks, and cryptanalysis of block ciphers (differential and linear cryptanalysis, reduced-round attacks). This is the design and internals layer: how these primitives are built and proven secure, distinct from choosing which algorithm or mode to deploy, managing key lifecycle and rotation, or architecting data protection for a system, which belong to the applied cryptography layer.

HardSystem Design
33 practiced

Design an authenticated-encryption solution for a high-throughput, low-latency messaging system (e.g., RPC streaming). Specify concrete primitives (AEAD choices), per-connection and per-message nonce strategies, batch processing, associated data for routing metadata, rekeying policies, and how to handle out-of-order messages and replay protection. Justify how your design balances throughput and security.

MediumTechnical
33 practiced

Provide scenarios where AES-SIV is preferable to AES-GCM or ChaCha20-Poly1305. Include considerations such as storage/deduplication, deterministic encryption requirements, environments with poor randomness, long-term data-at-rest protection, and whether streaming or low-latency requirements influence your choice.

MediumSystem Design
29 practiced

You need to design a streaming AEAD approach for encrypting very large files or live video where random access and partial validation are required. Propose a chunking scheme with per-chunk nonces and explain how to maintain integrity across chunks (e.g., chaining tags, a merkle tree, or higher-level signing), how to handle seeking and partial reads, and how to limit state while preventing replay or reorder attacks.

MediumTechnical
51 practiced

Describe the cryptographic consequences of nonce or IV reuse in AEAD schemes (for example AES-GCM) when used after key establishment. Provide concrete examples of attacks (loss of confidentiality, forgery) and relate these issues back to choices made in key-derivation and nonce construction during the key-exchange design.

HardTechnical
24 practiced

A protocol constructs a 96-bit nonce as 32-bit timestamp || 64-bit counter and uses AES-GCM. Describe an attacker strategy exploiting counter wraparound, clock rollback, or cloned devices, and show how nonce reuse might occur in practice. Propose a robust nonce construction and server-side checks to prevent exploitation.

Unlock Full Question Bank

Get access to all 30 Symmetric Encryption and Block Ciphers interview questions and detailed answers.

Sign in to Continue

Join thousands of developers preparing for their dream job.