Point Decomposition Problem in Binary Elliptic Curves
Cryptography and Security
2015-04-21 v2 Number Theory
Abstract
We analyze the point decomposition problem (PDP) in binary elliptic curves. It is known that PDP in an elliptic curve group can be reduced to solving a particular system of multivariate non-linear system of equations derived from the so called Semaev summation polynomials. We modify the underlying system of equations by introducing some auxiliary variables. We argue that the trade-off between lowering the degree of Semaev polynomials and increasing the number of variables is worth.
Cite
@article{arxiv.1504.02347,
title = {Point Decomposition Problem in Binary Elliptic Curves},
author = {Koray Karabina},
journal= {arXiv preprint arXiv:1504.02347},
year = {2015}
}