RSA, Diffie-Hellman, elliptic curves, digital signatures, certificates, certificate authorities, TLS handshake and post-quantum basics.
40 cards · basic cards · AI-written, checked twice. Edit anything.
- What two large primes compose the RSA modulus n?
Show answer
Two secret primes, conventionally called p and q- What is the standard value for the RSA public exponent e?
Show answer
65537- In RSA encryption, who uses the public key?
Show answer
The sender encrypts with the recipient's public key- What is the current minimum recommended RSA key size?
Show answer
2048 bits- How is the RSA private exponent d computed?
Show answer
As the multiplicative inverse of e modulo φ(n), where φ(n) = (p-1)(q-1)- What core problem does Diffie-Hellman solve?
Show answer
Allowing two parties to derive a shared secret over an insecure channel- What is the discrete logarithm problem?
Show answer
Finding x given g^x mod p, without knowing x- Why do both parties in Diffie-Hellman derive the same shared secret?
Show answer
Both compute g^(ab) mod p independently from their private values a and b- What is the primary vulnerability of unauthenticated Diffie-Hellman?
Show answer
Man-in-the-middle attacks, since there is no verification of peer identity- What equation defines an elliptic curve over a finite field?
Show answer
y^2 = x^3 + ax + b (mod p)- What is the elliptic curve discrete logarithm problem?
Show answer
Finding the scalar k given the point Q = kG on the elliptic curve- What cryptographic operation does ECDH provide?
Show answer
Key exchange, the elliptic curve variant of Diffie-Hellman- What does ECDSA stand for?
Show answer
Elliptic Curve Digital Signature Algorithm- How is an RSA signature created?
Show answer
Hash the message, then raise the hash to the power d (private exponent) modulo n- How is an RSA signature verified?
Show answer
Raise the signature to power e modulo n and check if it matches the hash of the message
FlashKeepers