A Study of Gröbner Bases and their Application in the Verification of Galois Field Arithmetic Circuits
| dc.contributor.author | Kapoor, Hastin | |
| dc.date.accessioned | 2024-06-04T17:24:40Z | |
| dc.date.available | 2024-06-04T17:24:40Z | |
| dc.date.issued | 2024-05-31 | |
| dc.description.abstract | Arithmetic in finite fields of 2^k elements is extremely important in cryptography, and thus it is just as important to be able to verify that these computations are being performed correctly by a given circuit. This paper aims to introduce the reader to Gröbner bases and their applications in the formal verification of Galois field arithmetic circuits. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1773/51437 | |
| dc.rights | Attribution-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-sa/3.0/us/ | * |
| dc.title | A Study of Gröbner Bases and their Application in the Verification of Galois Field Arithmetic Circuits | en_US |
| dc.type | Thesis | en_US |