Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Work around broken lia in 8.4 | 2016-08-09 | |
| | |||
* | Add alternate form of Montgomery, which does better about bounds | 2016-08-09 | |
| | | | | | | | | | After | File Name | Before || Change ----------------------------------------------------------------------- 0m06.96s | Total | 0m04.29s || +0m02.67s ----------------------------------------------------------------------- 0m06.56s | ModularArithmetic/Montgomery/ZProofs | 0m03.82s || +0m02.73s 0m00.40s | ModularArithmetic/Montgomery/Z | 0m00.47s || -0m00.06s | ||
* | Montgomery: Add a variant that does reduction through partial_reduce | 2016-08-08 | |
| | |||
* | Define Montgomery reduction / multiplication on Z (#42) | 2016-08-05 | |
This is partly done for my own benefit, to internalize how Montgomery multiplication works, and partly done as a template for word-based Montgomery multiplication when the carrying does not take advantage of the fact that we are using a pseudomersenne prime. |