Advertisement

Applying SAT-Solvers to Extension Fields of Low Degree

  • Gregory V. Bard
Chapter

Abstract

In this book we have been discussing polynomial equations over finite fields of characteristic two for quite some time. However, the finite field in question has almost always been \(\mathbb{G}\mathbb{F}\)(2). In cryptanalysis, this is usually the field of interest, with notable exceptions, including several ciphers: Rijndael [89] which later become the Advanced Encryption Standard (AES), which uses \(\mathbb{G}\mathbb{F}\)(256); the cryptosystem called TTM [127], over the same field; the Courtois Toy Cipher (CTC) [14] [73], can be modeled over \(\mathbb{G}\mathbb{F}\)(8) for certain settings. The stream cipher family QUAD [42] can operate over any finite field, but finite fields of characteristic two would be the natural setting (see Section 5.2 on Page 66).

Keywords

Advance Encryption Standard Polynomial System Product Formula Triple Product Irreducible Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.Department of MathematicsFordham UniversityBronxUSA

Personalised recommendations