Encryption practice test question - confused :)

[elisabeth_]

Hey everyone,

I'm working through some practice test questions but have hit a wall with this one:

I'm unsure of how to even begin figuring it out - can anyone share some tips? 🙂

Thanks! x

 

[ex_bubblehead]

Quite simple:

Each row is a 5-bit binary.

Convert the 5-bit binary to decimal using the rule outlined.

Add 17 to the result and apply the modulo function. The result is the encrypted value. Convert to a 5-bit binary and fill in an empty grid.

The modulo function returns the remainder after evenly dividing the given value (in this case 32) as many times as possible into the number that results after the addition.

Some examples:

1 Mod 32 = 1
33 Mod 32 = 1
32 Mod 32 = 0
64 Mod 32 = 0
75 Mod 32 = 11

 

[elisabeth_]

Dear ex_bubblehead,

Thank you so much for your helpful reply and I think I have now figured it out 🙂