I am taking a look at libsecp256k1’s codebase, for studying causes (doubt I can contribute with something helpful there). Whereas wanting on the subject implementation, the implementation of secp256k1_fe_mul_inner in each 10×26 and 5×52 is somewhat unusual to me. I do know some multiplication algorithms, like Karatsuba and Toom’s algorithms, however this one does not appear to be considered one of then, at the very least I could not relate to any of them.
Wanting on the supply and git historical past, I solely see a reference to Peter Dettman, however I used to be unable to search out any paper authored by him. Is that this algorithm impressed by one public paper? Any reference could be useful, as I am unable to observe motive in regards to the code itself. I perceive what it’s doing, however I do not know precisely how.
