MCQOPTIONS
Bookmark
Saved Bookmarks
→
Cryptography and Network Security
→
Hmac Daa Cmac
→
Calculate the GCD of 8376238 and 1921023 using Euc..
1.
Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm.
A.
13
B.
12
C.
17
D.
7
Answer» B. 12
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The multiplicative Inverse of 1234 mod 4321 is
117 mod 13 =
[(a mod n) – (b mod n)] mod n = (b – a) mod n
[(a mod n) + (b mod n)] mod n = (a+b) mod n
[(A_MOD_N)_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬®_(B_MOD_N)]_MOD_N_=_(B_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬®_A)_MOD_N?$#
The multiplicative Inverse of 1234 mod 4321 is$
11<sup>7</sup> mod 13 =$
The multiplicative Inverse of 24140 mod 40902 is
The multiplicative Inverse of 550 mod 1769 is
[(a mod n) + (b mod n)] mod n = (a+b) mod ?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply