McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2025
→
Uncategorized topics
→
Cryptography and Network Security (CNS)
→
GCD(a,b) = GCD(b,a mod b)
Q.
GCD(a,b) = GCD(b,a mod b)
A.
true
B.
false
C.
cannot be determined
D.
none
Answer» A. true
2.2k
0
Do you find this helpful?
2
View all MCQs in
Cryptography and Network Security (CNS)
Discussion
No comments yet
Login to comment
Related MCQs
Which Cryptographic system uses C1 = (e1r) mod p and C1 = (e2r x P) mod p at the encryption side?
Does the set of residue classes (mod 3) form a group with respect to modular addition?
The value of 52003 mod 7 is(use fermat's theorem)