Hybridized Characteristic 3 Galois Field Arithmetic for Elliptic Curve Cryptography, Phase III
ISEF · 2014 Materials Science
Overview
Given a rapid rise in cyber security threats for Internet users, corporations, and governments, there is a dire need for safer cryptographic algorithms. The purpose of this 3rd year capstone project was to create a highly efficient and scalable characteristic 3 Galois field arithmetic algorithm for high-security elliptic curve cryptography applications. By using a novel combination of logarithm and conventional arithmetic within Galois extension fields, a new algorithm was developed. When evaluated based on theoretical, computational, and statistical analyses, this algorithm proved to be more efficient than the best algorithms previously presented in literature in terms of pre-computation and operation speed. Furthermore, this algorithm showed a distinct applicability to creating NIST-level security elliptic curve cryptosystems and has major implications for the field of cryptography.
Competition history
- ISEF 2014
Resources
Related projects
ISEF · 2018
A Practical Cryptosystem with Provable Security: Three New Innovations in Cryptography
ISEF · 2026
Irreducible Polynomials Over Finite Fields as Cryptographical Frameworks for Cybersecurity
ISEF · 2014
Winning the War against Hackers: A Hybrid Asymmetric Cryptographic Algorithm for Safe and Secure Data
ISEF · 2014
Design and Performance Analysis of Optimization Algorithms for Efficient Cryptographic Processing in Secure Internet Routing Protocol
Closest projects by meaning, across every fair and year in the corpus.
Source: Regeneron International Science and Engineering Fair