McqMate

Q. |
## In RSA, Ф(n) = _______ in terms of p and q. |

A. | (p)/(q) |

B. | (p)(q) |

C. | (p-1)(q-1) |

D. | (p+1)(q+1) |

Answer» C. (p-1)(q-1) |

3.8k

0

Do you find this helpful?

17

View all MCQs in

Information Cyber Security (ICS)No comments yet

- In RSA, Ф(n) = in terms of p and q.
- In RSA, we select a value ‘e’ such that it lies between 0 and Ф(n) and it is relatively prime to Ф(n).
- In RSA, we select a value ‘e’ such that it lies between 0 and Ф(n) and it is relatively prime to Ф(n).
- What is the size of the RSA signature hash after the MD5 and SHA-1 processing?
- In Asymmetric-Key Cryptography, although RSA can be used to encrypt and decrypt actual messages, it is very slow if the message is
- In Asymmetric-Key Cryptography, although RSA can be used to encrypt and decrypt actual messages, it is very slow if the message is
- For RSA to work, the value of P must be less than the value of
- RSA is also a stream cipher like Merkel-Hellman.
- RSA algorithm is best example of_______
- For RSA to work, the value of P must be less than the value of