search

jtcoolen / Distributed-key-generation-and-threshold-encryption

Non-interactive distributed key generation based on ideal class groups of imaginary quadratics fields and threshold encryption based on elliptic curve pairings
MIT License
0 stars 0 forks source link

Implement Shanks’ NUCOMP algorithm #1

Open jtcoolen opened 4 hours ago

jtcoolen commented 4 hours ago

To do so, we need to implement an efficient truncated extended Euclidean division such as Lehmer's (https://en.wikipedia.org/wiki/Lehmer%27s_GCD_algorithm).

Also see Shanks NUCOMP https://www.ams.org/journals/mcom/2003-72-244/S0025-5718-03-01518-7/S0025-5718-03-01518-7.pdf.