Asymmetric Encryption and Key Exchange Questions

The construction and mathematics-adjacent mechanics of public-key (asymmetric) cryptography: how RSA, Diffie-Hellman, and elliptic-curve schemes actually work, including the group law and point-arithmetic formulas, scalar-multiplication algorithms (double-and-add, Montgomery ladder, windowed methods, GLV, multi-scalar batching), curve models and coordinate systems, and the hardness assumptions (integer factorization, discrete log, ECDLP) each scheme rests on. Covers key-establishment and authenticated key-exchange protocol design: forward-secrecy mechanics, key confirmation, downgrade protection, key-derivation and context binding, group and multi-party key agreement, and hybrid classical/post-quantum key-exchange composition. Also covers implementation-level attacks against these primitives and their mitigations: timing and side-channel leakage in modular exponentiation and scalar multiplication, invalid-curve and small-subgroup attacks, fault attacks, and padding-oracle attacks. Distinct from selecting, deploying, and operating these primitives in production: PKI certificate lifecycle, CA hierarchy, revocation, and key storage and rotation belong to applied cryptography and key management.

EasyTechnical
84 practiced

Define a protocol downgrade attack in the context of key exchange. Provide an example where an active attacker forces negotiation to an insecure parameter set, and explain at least two countermeasures protocols use to prevent downgrade (for example transcript binding and explicit downgrade sentinels).

MediumTechnical
63 practiced

Explain TLS 1.3 key schedule at a high level: how early secrets, handshake secrets and application secrets are derived using HKDF. Describe how these derivations provide forward secrecy and support post-handshake key updates. Indicate where client and server authentication and key confirmation occur.

MediumTechnical
67 practiced

Explain why including explicit context and protocol identifiers (for example transcript hashes, ciphersuite IDs, or role labels) in KDF inputs is critical. Provide an example where missing context allowed two different protocols to derive the same symmetric key from different inputs and caused cross-protocol key reuse vulnerability.

MediumSystem Design
73 practiced

Design a lightweight downgrade-protection mechanism for a negotiation protocol where endpoints advertise supported key-exchange algorithms and parameters. The mechanism must remain compatible with middleboxes that may not understand new algorithms. Explain how to cryptographically bind advertisements to the final negotiated choice without breaking proxies that need to rewrite or inspect the handshake.

HardTechnical
78 practiced

Define Key-Compromise Impersonation (KCI) in the context of authenticated Diffie-Hellman. Provide an example protocol vulnerable to KCI and propose modifications or protocol choices (for example, SIGMA family or TLS patterns) that prevent KCI while maintaining forward secrecy.

Unlock Full Question Bank

Get access to all 27 Asymmetric Encryption and Key Exchange interview questions and detailed answers.

Sign in to Continue

Join thousands of developers preparing for their dream job.