| Age | Commit message (Expand) | Author |
|---|---|---|
| 2019-10-21 | Entire CRT signature algorithm works by now. | Pavel V. Shatov (Meister) |
| 2019-10-21 | Added the regular (not modular) addition operation required during the final | Pavel V. Shatov (Meister) |
| 2019-10-21 | Added "MERGE_LH" micro-operation. To be able to do Garner's formula we need | Pavel V. Shatov (Meister) |
| 2019-10-21 | Refactored general worker module | Pavel V. Shatov (Meister) |
| 2019-10-03 | Added more micro-operations, entire Montgomery exponentiation ladder works now. | Pavel V. Shatov (Meister) |
| 2019-10-03 | Added more micro-operations, also added "general worker" module. The worker i... | Pavel V. Shatov (Meister) |
| 2019-10-03 | Expanded micro-operation parameters (added dedicated control bit to force the... | Pavel V. Shatov (Meister) |
| 2019-10-03 | Reworked storage architecture (moved I/O memory to a separate module, since t... | Pavel V. Shatov (Meister) |
| 2019-10-03 | Redesigned storage modules, added top-level module, added I/O storage space. | Pavel V. Shatov (Meister) |
 |
index : core/math/modexpng | |
| "Next-generation" modular exponentiation using specialized DSP slices present in Artix-7 FPGA | git repositories |
| aboutsummaryrefslogtreecommitdiff |