Q. The value of the base of natural logarithms is

View solution

Q. RC5 uses 2 magic constants to define their subkeys. These are

View solution

Q. The total number of subkeys t used in the RC5 algorithm is given by the formula (r corresponds to number of rounds)

View solution

Q. The standard/nominal version of the RC5-w/r/b has parameters w/r/b as

View solution

Q. The number of rounds in RC5 can range from 0 to _____________

View solution

Q. What are the allowable values of word size in bit for RC5 algorithm?

View solution

Q. Which of the following is true for the RC5 algorithm?

i) Has variable number of rounds
ii) Has fixed Key length
iii) High memory Requirements
iv) Uses only primitive computational operations commonly found on microprocessors

View solution

Q. Which of the following statements are true with respect to the blowfish algorithm –

i) Provided key is large enough, brute-force key search is not practical, especially given the high key schedule cost
ii) Key dependent S-boxes and sub keys make analysis very difficult
iii) Changing both halves in each round increases security
iv) Blowfish has improved avalanche effects

View solution

Q. The 32bit output of s-box 1 is XORed with s-box 2.

View solution

Q. A single blowfish s-box converts 8-bits to _________ bits.

View solution

Q. What is the number of iterations required in total to generate all the sub-keys in blowfish?

View solution

Q. P15 gets XORed with

View solution

Q. P17 gets XORed with

View solution

Q. To generate the sub-key P1 to P18 we use the hexadecimal equivalent digits of ____________

View solution

Q. In blowfish, the keys are stored in the form of an array ranging from K1, K2 to Ki. What is the value of i?

View solution

Q. How many entries are present in each of the S-boxes present in the blowfish algorithm?

View solution

Q. How many S-boxes are present in the blowfish algorithm?

View solution

Q. XOR and addition operations take place on bytes of size

View solution

Q. Blowfish algorithm uses the Feistel Structure.

View solution

Q. The blowfish algorithm’s key expansion converts a key of at most 448 bits into several subkey arrays totaling ___________ bytes.

View solution