Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing

ePrint Report: Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing

Diego F. Aranha, Benjamin Salling Hvass, Bas Spitters, Mehdi Tibouchi

We generalize the Bernstein-Yang (BY) algorithm for constant-time modular inversion to compute the Kronecker symbol, of which the Jacobi and Legendre symbols are special cases. We start by developing a basic and easy-to-implement divstep version of the algorithm defined in terms of full-precision division steps. We then describe an optimized version due to Hamburg over …

algorithm application bas compute curve elliptic eprint report evaluation hashing modular report