A 16-round Feistel network is used in an algorithm that divides these things into their namesake subarrays. That method by Bruce Schneier has a less well-known successor algorithm named Twofish, where the size (-5[1])of these things is twice as big as the block size. (15[1])A general protocol of an algorithm named for these things uses a generator g to construct a finite cyclic group of order (*) n, (-5[1])which results (-5[1])in the value of these things being g to the power of the quantity a times b. (10[1])That algorithm (10[1])named for these things, (10[2])which involves taking (10[1]-5[1])discrete logarithms, (10[3])is named after (-5[1])Diffie and Hellman. (10[2])Carmichael’s (10[2])totient (10[1]-5[1])function derives the “private” form of these objects (10[2]-5[1])in RSA (10[2])decryption. (10[4])For 10 points, (10[1])name these often-secret cryptographic (10[1]-5[2])pieces of information, (10[2])used to (10[1])encode or decode data. ■END■ (10[6])