An Algorithm for Safer EncryptionVinay Iyengar, USA Finalist, 17-18
My research project was about developing more efficient polynomial arithmetic algorithms for Galois fields of characteristic 3. These mathematical groups are commonly used particularly for elliptic curve cryptography, and efficient polynomial arithmetic algorithms are crucial. Through my research, I was able to develop a new method for this arithmetic that was orders of magnitude faster than the best algorithms previously presented. Furthermore, I was able to show my method’s applicability toward elliptic curve cryptography. In conclusion, my research presents a significantly improved algorithm for characteristic 3 Galois field arithmetic, and has the potential to make encryption significantly faster and safer.