| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Simplify proof of proj1_fe25519_encode |  Jason Gross | 2016-10-27 |
| | | |||
| * | Add lemmas about GF25519BoundedCommon.{encode,decode} | Jason Gross | 2016-10-27 |
| | | |||
| * | Switch to bounded Z | Jason Gross | 2016-10-25 |
| | | | | | | We don't have working word code yet, because the reification code currently does spurious word->N->Z->N->word conversions everywhere. So we use Z instead. | ||
| * | Adjust bound on final word in wire_digits to 31 | Jason Gross | 2016-10-24 |
| | | |||
| * | Fix bounds on wire_digits | Jason Gross | 2016-10-24 |
| | | | | | | As per https://github.com/mit-plv/fiat-crypto/pull/86#issuecomment-255839706 | ||
| * | Add pack, unpack, ge_modulus to axioms to be reified | Jason Gross | 2016-10-24 |
| | | |||
| * | Add decode to GF25519BoundedCommon | Jason Gross | 2016-10-22 |
| | | |||
| * | Make [vm_compute] on Bounded word reasonable | Jason Gross | 2016-10-22 |
| | | | | | We no longer store the type of proofs of [<=] in the term itself; this makes it amenable to vm_compute | ||
| * | Add word64eqb_Zeqb | Jason Gross | 2016-10-21 |
| | | |||
| * | A bit of initial setup on correct_and_bounded proofs in ↵ | Jason Gross | 2016-10-20 |
| | | | | | GF25519BoundedInstantiation | ||
| * | Plug bounded into assembly stuff | Jason Gross | 2016-10-20 |
| | | |||
| * | Split up GF25519Bounded to avoid circular dependencies | Jason Gross | 2016-10-20 |
 |
index : fiat-crypto | |
| fast, formally verified cryptography |
| aboutsummaryrefslogtreecommitdiff |