Commit message (Collapse) | Author | Age | ||
---|---|---|---|---|
... | ||||
* | Reorganization and revision of Encoding code and redefinition of sign_bit ↵ | 2016-04-25 | ||
| | | | | function. | |||
* | point_eq_dec | 2016-04-22 | ||
| | ||||
* | ed25519: continue derivation | 2016-04-08 | ||
| | ||||
* | Drop second projections in Ed25519 | 2016-03-29 | ||
| | ||||
* | ed25519 derivation: pair programming with jgross... slow progress | 2016-03-24 | ||
| | ||||
* | nicer verify() derivation starter | 2016-03-21 | ||
| | ||||
* | instantiate ed25519 sign in spec | 2016-03-20 | ||
| | ||||
* | Ed25519: d is nonsquare | 2016-03-20 | ||
| | ||||
* | Finish absolutizing imports | 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 ``` | |||
* | Factor out some bedrock dependencies into WordUtil | 2016-02-25 | ||
| | | | | Also move a definition about words, with a TODO about location, into WordUtil. | |||
* | efficient powmod | 2016-02-17 | ||
| | ||||
* | removed Print Assumptions | 2016-02-16 | ||
| | ||||
* | moved some theorems requiring q mod 8 = 5 precondition to PointEncoding from ↵ | 2016-02-16 | ||
| | | | | CompleteEdwardsCurve, where the precondition is not in scope. | |||
* | proved most of point encoding admits, fixed some build system issues (dead ↵ | 2016-02-16 | ||
| | | | | imports of PointFormats and Galois things) | |||
* | added point encodings; some admits remain | 2016-02-16 | ||
| | ||||
* | EdDSA: tweaked l_bound | 2016-02-15 | ||
| | ||||
* | merge | 2016-02-15 | ||
|\ | ||||
* | | instantiated FqEncoding and FlEncoding (also fixed indentation, which is why ↵ | 2016-02-15 | ||
| | | | | | | | | the commit looks huge) | |||
* | | added generic encoding spec | 2016-02-15 | ||
| | | ||||
| * | Finish seperating our specs: remove old non-specified code | 2016-02-15 | ||
|/ | ||||
* | ported some of EdDSA25519 to new field framework | 2016-02-15 | ||
| | ||||
* | update F Coercions and tutorial | 2016-02-14 | ||
| | ||||
* | Spec/EdDSA: comments, remove prehashing | 2016-02-13 | ||
| | ||||
* | Spec/EdDSA: cleanup; refactor lemmas to src/EdDSAProofs.v | 2016-02-13 | ||
| | ||||
* | prove existance of F inv, implement pow -- CompleteEdwardsCurve.unifiedAdd ↵ | 2016-02-13 | ||
| | | | | Closed Under Global Context | |||
* | Merge branch 'master' into spec | 2016-02-13 | ||
|\ | ||||
| * | EdDSA spec ported over to new field implementation | 2016-02-13 | ||
| | | ||||
* | | implement F_opp | 2016-02-12 | ||
|/ | ||||
* | document field issue re-appearing | 2016-02-12 | ||
| | ||||
* | port some edwards curve theorems | 2016-02-12 | ||
| | ||||
* | Define F m, a replacement for GF with several benefits. | 2016-02-11 | ||
| | | | | | | | | | | | | | - F has a human readable complete specification - F is a parametric type, not a parametric module - Different F instances can be disambiguated by type inference, which is more conventient that notation scopes. - F has significant support for non-prime moduli - It should be relatively easy to port existing GF code to F. Since the repository currently contains code referencing both F and GF, it makes sense to keep the names different for now. Later, F may or may not be renamed to GF. | |||
* | fresh take at specifications using implicit arguments instead of module ↵ | 2016-02-07 | ||
parameters |