An organization uses a random keystream that covers the entire data length, discarding it when data encryption is finished. Which method best addresses the confidentiality requirement in this implementation?
Generate a temporary random key for each message that matches the data size and is used once
Implement elliptic curve cryptography to balance security with reduced overhead
Use password-based encryption with salting and hashing for key creation
Use symmetric encryption with a shared key for multiple messages
A temporary random key that is used once, matching the data length, avoids repeated patterns or partial predictability. Reusing a single key across transmissions can create opportunities for analysis and key discovery. Password-based methods depend on user inputs, which can be prone to brute-force attempts. Elliptic curve cryptography can offer robust security, yet it does not guarantee that each data segment uses a unique one-time key matching the entire content length.
Ask Bash
Bash is our AI bot, trained to help you pass your exam. AI Generated Content may display inaccurate information, always double-check anything important.
What is a one-time pad (OTP) and how is it related to this encryption method?
Open an interactive chat with Bash
Why does using the same key across multiple messages pose a security risk?
Open an interactive chat with Bash
How is elliptic curve cryptography (ECC) different from the encryption method described here?