MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Integrity Algorithms
→
CCM, GCM and Key Wrapping I
→
In SHA-3, for a message digest size of 256, what i...
1.
In SHA-3, for a message digest size of 256, what is the bitrate r (capacity = 512) ?
A.
576
B.
1088
C.
1152
D.
832
Answer» C. 1152
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
SHA-3 has an advantage over other algorithms because, there is no need for table look ups, arithmetic operations or data dependent operations.
Which step function works only W[0, 0]?
How many iterations / rounds does the Keccak function have ?
In SHA-3, for a message digest size of 256, what is the bitrate r (capacity = 512) ?
In SHA-3, which function does the operation L[2,3]<- C[1] XOR L[2,3] XOR ROT(C[3],1) represent?
In SHA-3, which step function does the operation L[2,3] <- L[2,3] XOR NOT(L[3,3]) AND L[4,3] represent?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies