This task comprises three parts.
Part one. This task is to implement a 5-bit CFB TEA algorithm.
Part two. Encrypt your student number using 5-bit CFB
TEA algorithm as devised above.
Part three. Add all the digits of your student number mod 8.
Let the result be c. Then implement c-bit CFB TEA algorithm, and encrypt your student number
using this algorithm. Compare the time needed to encrypt using 5-bit CFB TEA algorithm and
c-bit CFB TEA algorithm, and write your result in Task5Report.PDF. Explain what has happened.
Remark: If the result of the modulo operation is 0 or 5, that is c = 0 or c = 5, then you need to
implement 4-bit CFB TEA instead.