The implementation of the TEA symmetric encryption algorithm given in Figure 11.8–11.10. is not
portable between all machine architectures. Explain why. How could a message encrypted using
the TEA implementation be transmitted to decrypt it correctly on all other architectures?
What will be an ideal response?
Byte ordering is an issue. The algorithm as presented assumes that the 4 bytes in a 32-bit word are ordered the
same at the sender (encrypter) and the receiver (decrypter). To make it work for all architectures, we would
need to transmit messages in a network-standard byte order, and to re-order the bytes to suite the local
architecture on receipt.
Computer Science & Information Technology
You might also like to view...
Unmatched records are records in one table that have no matching records in a related table
Indicate whether the statement is true or false
Computer Science & Information Technology
What is the name of the value assigned to a routing protocol to indicate its reliability compared with other routing protocols that might be in use on the same router?
A. metric B. administrative distance C. hop count D. ACL
Computer Science & Information Technology