In SHA-3, if the desired output is l bits, then j blocks are produced, such that
(a) (j-1) x r < l <= (j) x r
(b) (j) x r< l <= (j+1) x r
(c) (j-1) x r < l <= (j+1) x r
(d) (j+1) x r < l <= (j+2) x r
This question was posed to me in an interview.
This is a very interesting question from Secure Hash Algorithms (SHA) topic in division Other Public Key Cryptosystems and Cryptographic Hash Functions of Cryptograph & Network Security