<glob pattern="*.m4"/>
    <glob pattern="*.mf"/>
    <glob pattern="*.MF"/>
    <glob pattern="*.meta"/>
    <glob pattern="*.mdo"/>
    <glob pattern="*.n3"/>
    <glob pattern="*.pen"/>
    <glob pattern="*.pod"/>
    <glob pattern="*.pom"/>
    <glob pattern="*.project"/>
    <glob pattern="*.rng"/>
    <glob pattern="*.rnx"/>
    <glob pattern="*.roles"/>

"Efficient Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit...

"Efficient Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit...