📚 CBC-MAC Learning Examples

Choose from carefully crafted examples to understand CBC-MAC step by step:

Or use random values:

Part 1: Basic CBC-MAC

Plaintext:	1100000000111100101010
Key (k):	11100100
IV Length (l):	4 (where l < plaintext length/2)
IV:	1100

🧪 Test Function F_k(text):

This section allows you to test how the cryptographic function F_k transforms binary input. Enter binary text of the required length and see the step-by-step calculation.

Your text: (Binary string of size 2)	11001010
Function output: (F_k result)

Final Output:

Part 2: Secure CBC-MAC

Select the option you would use to make CBC-MAC secure:

Plaintext:	1100000000111100101010
Key:	11100100
IV Length (l):	4 (where l < plaintext length/2)
IV:	1100

🧪 Test Function F_k(text) - Secure CBC-MAC:

This section allows you to test how the cryptographic function F_k transforms binary input in the secure CBC-MAC implementation. Enter binary text of the required length and see the step-by-step calculation.

Your text: (Binary string of size 4)	11001010
Function output: (F_k result)

Final Output: