On zero-dimensional polynomial systems and their applications to the elliptic curve discrete logarithm problem
In this thesis, we first study the problem of solving zero-dimensional multivariate polynomial systems over finite fields and then study the elliptic curve discrete logarithm problem over binary fields. First, we discuss a mostly theoretical framework for solving zero-dimensional polynomial systems....
Saved in:
Main Author: | Yun, Yang |
---|---|
Other Authors: | Xing Chaoping |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/73162 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the low-lying zeros of Hasse–Weil L-functions for elliptic curves
by: Baier, Stephan, et al.
Published: (2009) -
Incomplete character sums and polynomial interpolation of the discrete logarithm
by: Niederreiter, H., et al.
Published: (2014) -
Cubic permutation polynomials and elliptic curves
by: Attawut Wongpradit
Published: (2013) -
Fault attacks on hyperelliptic curve discrete logarithm problem over binary field
by: WANG, Mingqiang, et al.
Published: (2014) -
Analysis of algorithms to solve the discrete logarithm problem
by: Sim, Ernest Zi-En
Published: (2024)