| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Finish absolutizing imports |  Jason Gross | 2016-03-10 |
| | | | | | | | | | | | | | The file coqprime/Coqprime/ListAux.v was importing List, which was confusing machines on which mathclasses was also installed. Using https://github.com/JasonGross/coq-tools ```bash make -kj10 cd src git ls-files "*.v" | xargs python ~/Documents/repos/coq-tools/absolutize-imports.py -i -R . Crypto ``` | ||
| * | tweak to NumTheoryUtil so it builds on older Coq versions |  Jade Philipoom | 2016-03-03 |
| | | |||
| * | ModularArithmetic: reasonable-time FieldToZ inv implementation |  Andres Erbsen | 2016-02-26 |
| | | |||
| * | tweaks to util files, including automation for proving ↵ | Jade Philipoom | 2016-02-15 |
| | | | | | positivity/nonnegativity in Z | ||
| * | GaloisTheory: added lemmas useful for proving Euler's Criterion with GF. ↵ | Jade Philipoom | 2016-02-02 |
| | | | | | NumTheoryUtil: cleanup. | ||
| * | NumTheoryUtil: proved Fermat's Little Theorem. | Jade Philipoom | 2016-01-23 |
| | | |||
| * | NumTheoryUtil : code cleanup; moved some lemmas to ZUtil. | Jade Philipoom | 2016-01-23 |
| | | |||
| * | Import coqprime; use it to prove Euler's criterion. | Jade Philipoom | 2016-01-20 |
| | | |||
| * | euler's criterion reduced to fermat's little theorem and two lemmas about ↵ | Jade Philipoom | 2016-01-13 |
| | | | | | primitive roots. | ||
| * | Util: added util lemmas needed to instantiate EdDSA25519. | Jade Philipoom | 2016-01-05 |
 |
index : fiat-crypto | |
| fast, formally verified cryptography |
| aboutsummaryrefslogtreecommitdiff |