In finite fields, we have a \(\pmod n\) operation for a list of integers (\(\mathbb{Z}\)), and where \(n\) is a prime number. This works for our add (+) and multiply (\(\times\)) operations, and where: \( a \pmod n + b \pmod n = (a+b) \pmod n\); and \(a \pmod n \times b \pmod n = (a \times b) \pmod n\).