| 1. | As a consequence, analogues over finite fields could be defined.
|
| 2. | Most AES calculations are done in a special finite field.
|
| 3. | Finite fields are used in most cryptographic protocols used for computer security.
|
| 4. | Any finite field extension of a finite field is separable and simple.
|
| 5. | Any finite field extension of a finite field is separable and simple.
|
| 6. | The Reed Solomon code is based on univariate polynomials over finite fields.
|
| 7. | Exponentiation in finite fields has applications in public key cryptography.
|
| 8. | For example, we have the general linear groups over finite fields.
|
| 9. | Let L / K be a finite field extension of global fields.
|
| 10. | This exploits the property that all finite fields contain generators.
|
