Cryptanalysis and Security Proofs Questions

Evaluating the strength of cryptographic constructions: attack techniques, cryptanalysis of ciphers and protocols, reduction-based security proofs, and formal analysis. Covers reasoning about what an adversary can and cannot do and how security guarantees are argued rigorously. The offensive-and-verification counterpart to scheme design.

EasyTechnical
19 practiced

Estimate the time required to brute-force symmetric keys of length 56, 80, 112, and 128 bits on a machine that can test 1e9 keys per second. Provide results in seconds, days, and years, and briefly discuss how parallelization or specialized hardware changes these estimates.

EasyTechnical
22 practiced

Describe how you would convert a theoretical attack cost (for example 2^{60} operations and 128 GB memory) into a real-world feasibility assessment. Include considerations such as attacker parallelism, memory distribution, hardware & electricity cost, logistics of acquiring hardware, time-to-completion, and how to present risk to non-technical stakeholders.

EasyTechnical
18 practiced

Explain the meet-in-the-middle attack on double-DES (ciphertext C = E_{k2}(E_{k1}(P))). Derive the time and memory complexity in terms of single-DES key size k=56 and show the numeric work factor and memory requirement. Explain why double-DES was not considered secure and how 3DES addresses the issue.

HardTechnical
36 practiced

Analyze small-subgroup and invalid-curve attacks against Diffie-Hellman and elliptic-curve schemes. Show mathematically how a malicious peer can exploit lack of subgroup checks to recover private key material, provide a concrete attack example with group orders and cofactors, and list efficient defenses to implement on both client and server sides.

HardSystem Design
19 practiced

Describe the Bellcore (CRT-RSA) fault attack in full mathematical detail: show how a single faulty exponentiation modulo p or q yields a pair of values whose difference reveals a nontrivial gcd with N, and thus factors N. Then design a complete set of mathematical countermeasures (including verification steps and blinding techniques), and prove that your defense prevents key leakage under a single-fault model.

Unlock Full Question Bank

Get access to all 13 Cryptanalysis and Security Proofs interview questions and detailed answers.

Sign in to Continue

Join thousands of developers preparing for their dream job.