A web demo suite for basic number theory concepts used in symmetric cryptography (AES)
Implement a web based demonstration of some basic number theoretic concepts used in cryptography. This includes (extended) Euclidean algorithm, arithmetic in GF(p), polynomial arithmetic with coefficients in Zp, and finally arithmetic in GF(2^n). The implementations need to be adequately generic, so...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/66468 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Implement a web based demonstration of some basic number theoretic concepts used in cryptography. This includes (extended) Euclidean algorithm, arithmetic in GF(p), polynomial arithmetic with coefficients in Zp, and finally arithmetic in GF(2^n). The implementations need to be adequately generic, so that users can change the parameters and inputs as desired. The ultimate purpose of this web demonstration is to serve as accompanying learning material for students of cryptography, and care should be taken in making the implementations not only work, but also easy to use and visually elegant across multiple platforms. The student will need to self-study the relevant mathematical concepts, and determine a suitable implementation framework. (Naturally, a very good foundation in discrete mathematics to understand the necessary number theoretic concepts is expected of the student.) Note that there is no fundamental research component in this project. |
|---|