diff options
author | Jade Philipoom <jadep@mit.edu> | 2015-11-24 18:03:55 -0500 |
---|---|---|
committer | Jade Philipoom <jadep@mit.edu> | 2015-11-24 18:03:55 -0500 |
commit | b0d22421499ebb90ca80b436b67fbee9892e18d6 (patch) | |
tree | 95498d14aa881a03681242e95cfdaa87ddb91ff1 /src/Specific/GF25519.v | |
parent | dc562d8bf9596fde07e3e3242f345c93c460982a (diff) |
Specific/GF25519: Updated to match new PseudoMersenneBaseParams spec.
Diffstat (limited to 'src/Specific/GF25519.v')
-rw-r--r-- | src/Specific/GF25519.v | 12 |
1 files changed, 10 insertions, 2 deletions
diff --git a/src/Specific/GF25519.v b/src/Specific/GF25519.v index 650990252..68d259881 100644 --- a/src/Specific/GF25519.v +++ b/src/Specific/GF25519.v @@ -74,11 +74,19 @@ Module GF25519Base25Point5Params <: PseudoMersenneBaseParams Base25Point5_10limb Lemma base_succ : forall i, ((S i) < length base)%nat -> let b := nth_default 0 base in b (S i) mod b i = 0. - Admitted. + Proof. + intros. + assert (In i (seq 0 (length base))) by nth_tac. + assert (In (S i) (seq 0 (length base))) by nth_tac. + subst b; simpl in *. + repeat break_or_hyp; try omega; vm_compute; reflexivity. + Qed. Lemma base_tail_matches_modulus: 2^k mod nth_default 0 base (pred (length base)) = 0. - Admitted. + Proof. + nth_tac. + Qed. Lemma b0_1 : forall x, nth_default x base 0 = 1. Proof. |