COMPUTER ETHICS AND SECURITY
CRYPTOGRAPHY AND ENCRYPTION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Cryptographic function
|
|
|
One-way function
|
|
|
Autonomous function
|
|
|
Encryption algorithm
|
Detailed explanation-1: -Theorem 1 The multiplication function f× is a weak one-way function. Proof. Let GOOD be the set of inputs (x, y) to f× such that both x and y are prime numbers. When (x, y) ∈ GOOD, the adversary cannot invert the multiplication function f×(x, y) because of hardness of factoring.
Detailed explanation-2: -The one-way function, Hash-Based Message Authentication Code with Secure Hashing Algorithm 1 (HMAC-SHA1), is run over the header and payload with a secret key. The sender writes the HMAC-SHA1 hash into the authentication tag, and the receiver runs the same computation and checks its result against the tag.
Detailed explanation-3: -It’s a fine one-way function, based (as you noted) on the computational difficulty of the discrete logarithm problem.