I’m not asking how to implement it, but how adding or substracting 2 points on an elliptic curve is done at the mathematical level when the target is a fpga instead of regular computer hardware.
It’s also not a pure computer science question : on fpga, faster stuff can use more area and thus be slower : using primes in elliptic curves for example allows faster cpu/gpu computation because those machines typically lacks carryless multiply instructions. Folks at SuperUser or Crypto.stackechange would close this as a hardware question, especially since they might never did hear about what is a fpga or an asic while on the reverse course, crypo accelerating chips are common.
I might be wrong, but I’m sure a question that would have asked the same thing for floating points instead of elliptic curve would not have been closed. At least not for this reason.