RSA, Elliptic Curve, DSA, and Elgamal ECES Practice Questions (Page 9)

Questions 41–43

1. 41foundation · easy

   What is the primary purpose of modular exponentiation in RSA encryption and decryption?

   • ATo verify the digital signature of the message
   • BTo compute the totient φ(n)
   • CTo efficiently compute c = m^e mod n and m = c^d mod n
   • DTo generate the prime numbers p and q
   Reveal Solution Discussion Select an answer first
2. 42foundation · easy

   What operation is used to compute kP, where k is a large integer and P is a point on an elliptic curve?

   • AMultiplication of the x and y coordinates separately
   • BScalar multiplication, which is repeated point addition
   • CPoint subtraction, which is the inverse of addition
   • DModular exponentiation of the point coordinates
   Reveal Solution Discussion Select an answer first
3. 43foundation · easy

   In Elgamal signatures, what is the verification equation?

   • Ag^H(m) ≡ y^r · r^s (mod p)
   • Br^H(m) ≡ g^y · s^r (mod p)
   • Cy^H(m) ≡ g^r · r^s (mod p)
   • Dg^r ≡ y^s · s^H(m) (mod p)
   Reveal Solution Discussion Select an answer first