Understanding Cryptography by Christof Paar and Jan Pelzl - Chapter 4 Solutions - Ex4.2

- 4 mins

Exercise 4.2

For the AES algorithm, some computations are done by Galois Fields (GF). With the following problems, we practice some basic computations.

Compute the multiplication and addition table for the prime field . A multiplication table is a square (here: ) table which has as its rows and columns all field elements. Its entries are the products of the field element at the corresponding row and column. Note that the table is symmetric along the diagonal. The addition table is completely analogous but contains the sums of field elements as entries.

Solution

This solution is verified as correct by the short script I wrote to check it (see below).

2. Addition and Multiplication Tables for :

I wrote a python script which can calculate addition and multiplication tables for fields:

from pprint import pprint

def generate_addition_table(n):
    row = [0] * 7
    table = [row[:] for i in range(0, n)]
    for a, b, c in [(a, b, (a+b) % 7) for a in range(0,n) for b in range(0,n)]:
        table[a][b] = c
    return table

def generate_multiplication_table(n):
    row = [0] * 7
    table = [row[:] for i in range(0, n)]
    for a, b, c in [(a, b, (a*b) % 7) for a in range(0,n) for b in range(0,n)]:
        table[a][b] = c
    return table

if __name__ == "__main__":
    n = 7
    print "Addition Table GF({}):".format(n)
    pprint(generate_addition_table(7))
    print "Multiplication Table GF({}):".format(n)
    pprint(generate_multiplication_table(7))

Thomas Busby

Thomas Busby

I write about computing stuff

comments powered by Disqus
rss facebook twitter github youtube mail spotify instagram linkedin google google-plus pinterest medium vimeo stackoverflow reddit quora