Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Aggregate all level specifications not in Spec/* | 2016-06-22 | |
| | | | | | This prevents notation conflicts (see comment in Notations.v for more explanation). | ||
* | remove obsolete rep mechanism | 2016-06-20 | |
| | |||
* | GF25519: quiet | 2016-06-20 | |
| | |||
* | Merge branch 'field-experiment' | 2016-06-20 | |
|\ | | | | | | | includes broken files to be removed in next commit | ||
* | | Canonicalization is now automated in GF25519 and added to GF1305. | 2016-06-17 | |
| | | |||
* | | Specific version of freeze for GF25519 (automation still needs a little work) | 2016-06-17 | |
| | | |||
* | | PseudoMersenneBaseRep.mul now carries by default (made possible by strictly ↵ | 2016-06-15 | |
| | | | | | | | | base-length digit vectors) | ||
* | | Another fix for an anomaly in 8.4pl2 | 2016-06-11 | |
| | | |||
* | | Work around bug #4811 (slow f_equal) | 2016-06-11 | |
| | | | | | | | | | | This is https://coq.inria.fr/bugs/show_bug.cgi?id=4811, [f_equal] loops(?) in 8.5pl1 (fixed already in 8.5.dev) | ||
| * | ed25519: refactor some Proper | 2016-06-06 | |
| | | |||
| * | rewrite in Let_In binder by tactic | 2016-06-04 | |
| | | |||
| * | Let_In rewriting | 2016-06-03 | |
| | | |||
| * | leibniz equal version of topdown rewriting of sigma types: nicer | 2016-06-01 | |
| | | |||
| * | leibniz equal version of topdown rewriting of sigma types | 2016-06-01 | |
| | | |||
| * | E impl: proper morphisms are hard to dow without setoids | 2016-05-30 | |
| | | |||
| * | ERep add | 2016-05-29 | |
| | | |||
| * | --amend | 2016-05-28 | |
| | | |||
| * | verify derivation, EdDSA layer: allow arbitrary equivalence relation for ↵ | 2016-05-28 | |
| | | | | | | | | ERep and SRep | ||
| * | verify derivation, EdDSA layer: remove unused context variables | 2016-05-28 | |
| | | |||
| * | verify derivation: EdDSA layer | 2016-05-28 | |
| | | |||
| * | right after scalars to F l | 2016-05-27 | |
| | | |||
| * | before changing SRep from N to F l | 2016-05-27 | |
|/ | |||
* | ed25519: indentation fix | 2016-05-24 | |
| | |||
* | ed25519: integrate FRepPow and FRepInv | 2016-05-24 | |
| | |||
* | ed25519: continue refactor | 2016-05-24 | |
| | |||
* | Factor some rewrites into a single [autorewrite] | 2016-05-24 | |
| | | | | Slightly less [apply f_equal] beforehand, more automation. | ||
* | Remove unfolding, rewrite -> setoid_rewrite | 2016-05-24 | |
| | | | | | | | | | | Moving the [scalar] argument to the beginning of [iter_op] makes inference of the [Proper] lemmas a bit easier. Making [Reflexive eq] come before [Reflexive Equivalence.equiv] allows [setoid_rewrite] to work; since [setoid_rewrite] does more unfolding than [rewrite], we no longer need to unfold things to make the [rewrite] work. | ||
* | Fix some issues in Ed25519 tactics | 2016-05-24 | |
| | | | | | | | | | | | | | | | | | | | | - Use replace rather than refine to speed up [Defined] and make the tactics easier to read - Use [apply f_equal] in place of [reflexivity] for unknown presumably arcane reasons to satisfy Coq's unifier - Factor out some tactics into tactic scripts - Write a lemma to pull functions out of [Let_In] - Fix autoindentation in emacs by wrapping [Let_In_unRep] in parentheses (probably a ProofGeneral regexp gone wrong) - Write a kludgy tactic to unfold [proj1_sig] only when applied to [exist] (Pair programming with Andres) | ||
* | F,Ed25519: integrate F representation for mul,add,sub. Ed25519 even more ↵ | 2016-05-24 | |
| | | | | broken... | ||
* | unifiedAddM1Rep_sig: almost there | 2016-05-18 | |
| | |||
* | Implemented subtraction mod q as as (sub a b = sub (add a (2*q)) b) to avoid ↵ | 2016-05-09 | |
| | | | | unsigned integer underflow. Also changed rep in Specific proofs so that it is PseudoMersenneBaseRep.rep rather than ModularBaseSystem.rep; these are equivalent but the first is the abstraction level we want. | ||
* | Moved sign_bit definition to Spec. | 2016-04-29 | |
| | |||
* | Proved decode_point_eq in Ed25519 (comparing encodings is equivalent to | 2016-04-29 | |
| | | | | comparing points). | ||
* | Completed encoding reorganization; factored sign_bit out of PointEncodings ↵ | 2016-04-28 | |
| | | | | and finished encoding admits. | ||
* | ed25519: solve elliptic curve math admits | 2016-04-25 | |
| | |||
* | consolidate and rename Edwards curve lemmas | 2016-04-25 | |
| | |||
* | Merge branch 'master' of github.mit.edu:plv/fiat-crypto | 2016-04-25 | |
|\ | |||
* | | Reorganization and revision of Encoding code and redefinition of sign_bit ↵ | 2016-04-25 | |
| | | | | | | | | function. | ||
| * | refactor field lemmas out of ed25519 | 2016-04-25 | |
| | | |||
| * | reduce admits related to point negation | 2016-04-25 | |
|/ | |||
* | point_eq_dec | 2016-04-22 | |
| | |||
* | added GF1305 (modulus is 2^130 - 5, base has length 5 with all digits having ↵ | 2016-04-21 | |
| | | | | weight 2^26) | ||
* | automated most of the code in GF25519 | 2016-04-21 | |
| | |||
* | Cleanup of GF25519 | 2016-04-20 | |
| | |||
* | Pulled generalized code out of GF25519 so that it can be used for other moduli | 2016-04-20 | |
| | |||
* | GF25519 addition | 2016-04-20 | |
| | |||
* | GF25519: boring stuff -- fixed indentation and removed commented-out code | 2016-04-20 | |
| | |||
* | ed25519 derivation: down to final encoding | 2016-04-17 | |
| | |||
* | ed25519 derivation: use representation of F | 2016-04-17 | |
| | |||
* | ed25519 derivation: wrangle non-unique representations | 2016-04-16 | |
| |