Is there any implementation that computes div(x,y) mod l, where l is the order of the base point G and x,y are from that field (i.e. they are ge), or a function that calculates the inverse of a scalar in that field (inside the monero code base)?

(I saw that there might exist a function that computes it in the case thatx,y are fe- called fe_invert (or maybe fe_divpowm1?))



No. Bulletproofs currently use openssl's BN API for this.


The division part no. The mod l part, yes, sc_reduce in src/crypto/crypto-ops.c.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.