@article{10902/31261,
year = {2024},
month = {2},
url = {https://hdl.handle.net/10902/31261},
abstract = {Let p be a prime and Fp the finite field with p elements. We show how, when given an superelliptic curve Y n + f(X) ∈ Fp[X, Y ] and an approximation to (v0, v1) ∈ F2 p such that vn 1 = −f(v0), one can recover (v0, v1) efficiently, if the approximation is good enough. As consequence we provide an upper bound on the number of roots of such bivariate polynomials where the roots have certain restrictions. The results has been motivated by the
predictability problem for non-linear pseudorandom number generators and, other potential applications to cryptography.},
organization = {Author is partially supported by grant PID2019-110633GB-I00 funded by MCIN/AEI/10.13039/ 501100011033.},
publisher = {American Institute of Mathematical Sciences},
publisher = {Advances in Mathematics of Communications, 2024, 18(1), 222-232},
title = {Reconstructing points of superelliptic curves over a prime finite field},
author = {Gutiérrez Gutiérrez, Jaime},
}