| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2019-10-01 | Further work on the Montgomery modular multiplier. Added the third | Pavel V. Shatov (Meister) | |
| "rectangular" stage of the multiplication process, i.e. computation of how many copies of the modulus N to add to the intermediate product AB to zeroize the lower half: M = Q * N. | |||
| 2019-10-01 | Further work on the Montgomery modular multiplier. Can now to the "triangular" | Pavel V. Shatov (Meister) | |
| part of multiplication, i.e. compute the "magic" reduction coefficient Q = LSB(AB) * N_COEFF. | |||
| 2019-10-01 | Started working on the pipelined Montgomery modular multiplier. Currently can | Pavel V. Shatov (Meister) | |
| do the "square" part of the multiplication, i.e. compute the twice larger intermediate product AB = A * B. | |||
 |
index : core/math/modexpng | |
| "Next-generation" modular exponentiation using specialized DSP slices present in Artix-7 FPGA | git repositories |
| aboutsummaryrefslogtreecommitdiff |