fiat-crypto - fast, formally verified cryptography

	Commit message (Collapse)	Author	Age
*	Remove [Admitted]; [Qed] is now under a second	Jason Gross	2016-03-08
\|
*	Use [rewrite] rather than [change] to speed up Qed	Jason Gross	2016-03-08
\| \| \| \| \| \| \| \| \| \| \| \| \|	[Opaque] tells kernel unification to defer unfolding a constant as long as possible. This is not a problem for [change], when the functions are small and directly convertible. It's disastrous for [Qed]/[Defined], which (if I understand correctly) try to unify [Opaquemul x' y'] with [mul x y] by fully unfolding [mul] and [x] and [y] before trying to unfold [Opaquemul]; when [x] and [y] are large, this takes a very long time. Rewrite avoids this by telling Coq how to unify [Opaquemul x' y'] with [mul x y] (namely, by unifying [Opaquemul] with [mul], and then [x] with [x'] and [y] with [y']).
*	IterAssocOp : proved iter_op with function exponential	Jade Philipoom	2016-03-03
\|
*	tweak to NumTheoryUtil so it builds on older Coq versions	Jade Philipoom	2016-03-03
\|
*	CompleteEdwardsCurveTheorems: associativity proof that times out on Qed	Andres Erbsen	2016-03-03
\|
*	Instance Fq_Integral_domain : @Integral_domain (F q) ...	Andres Erbsen	2016-02-28
\|
*	ModularArithmetic: [field] tactic that respects opacity, prettify ↵	Andres Erbsen	2016-02-28
\| \| \| \|	ExtendedCoordinates, outline Edwards curve associativity
*	Makefile: single-quotes for shell globbing	Andres Erbsen	2016-02-28
\|
*	generic binary exponentiation correctness proof in 3 one-liners	Andres Erbsen	2016-02-26
\|
*	ModularArithmetic: reasonable-time FieldToZ inv implementation	Andres Erbsen	2016-02-26
\|
*	Factor out some bedrock dependencies into WordUtil	Jason Gross	2016-02-25
\| \| \| \|	Also move a definition about words, with a TODO about location, into WordUtil.
*	cleanup of bounded iter_op	Jade Philipoom	2016-02-25
\|
*	efficient powmod	Andres Erbsen	2016-02-17
\|
*	update ModularArithmetic tutorial	Andres Erbsen	2016-02-17
\|
*	removed Print Assumptions	Jade Philipoom	2016-02-16
\|
*	proved sqrt_solutions, the last remaining admit for point encodings	Jade Philipoom	2016-02-16
\|
*	moved some theorems requiring q mod 8 = 5 precondition to PointEncoding from ↵	Jade Philipoom	2016-02-16
\| \| \| \|	CompleteEdwardsCurve, where the precondition is not in scope.
*	proved most of point encoding admits, fixed some build system issues (dead ↵	Jade Philipoom	2016-02-16
\| \| \| \|	imports of PointFormats and Galois things)
*	added point encodings; some admits remain	Jade Philipoom	2016-02-16
\|
*	cleaned up and ported definition to solve for x ^ 2 in the curve equation	Jade Philipoom	2016-02-16
\|
*	EdDSA: tweaked l_bound	Jade Philipoom	2016-02-15
\|
*	fixed renamed files and added imports for encodings	Jade Philipoom	2016-02-15
\|
*	merge	Jade Philipoom	2016-02-15
\|\
* \|	instantiated FqEncoding and FlEncoding (also fixed indentation, which is why ↵	Jade Philipoom	2016-02-15
\| \| \| \| \| \| \| \|	the commit looks huge)
* \|	added generic encoding spec	Jade Philipoom	2016-02-15
\| \|
* \|	moved two non-primality-dependent lemmas to ModularArithmeticTheorems from ↵	Jade Philipoom	2016-02-15
\| \| \| \| \| \| \| \|	PrimeFieldTheorems
* \|	a few lemmas in util about powers of 2 in Bedrock's various rewritten forms	Jade Philipoom	2016-02-15
\| \|
\| *	Finish seperating our specs: remove old non-specified code	Andres Erbsen	2016-02-15
\| \|
\| *	remove Check	Andres Erbsen	2016-02-15
\|/
*	Merge branch 'spec' of github.mit.edu:plv/fiat-crypto into spec	Jade Philipoom	2016-02-15
\|\
* \|	ported some of EdDSA25519 to new field framework	Jade Philipoom	2016-02-15
\| \|
* \|	added square roots and an assortment of lemmas about prime fields/rings	Jade Philipoom	2016-02-15
\| \|
* \|	changed the name of the ring to ring, not field	Jade Philipoom	2016-02-15
\| \|
* \|	tweaks to util files, including automation for proving ↵	Jade Philipoom	2016-02-15
\| \| \| \| \| \| \| \|	positivity/nonnegativity in Z
\| *	port bounded iter_op and Edwards doubleAndAdd	Andres Erbsen	2016-02-15
\| \|
\| *	CompleteEdwardsCurve: unifiedAddM1: Closed Under Global Context	Andres Erbsen	2016-02-15
\|/
*	update F Coercions and tutorial	Andres Erbsen	2016-02-14
\|
*	port ModularBaseSystem.v and GF25519.v to F m	Andres Erbsen	2016-02-14
\|
*	Spec/EdDSA: comments, remove prehashing	Andres Erbsen	2016-02-13
\|
*	Spec/EdDSA: cleanup; refactor lemmas to src/EdDSAProofs.v	Andres Erbsen	2016-02-13
\|
*	prove existance of F inv, implement pow -- CompleteEdwardsCurve.unifiedAdd ↵	Andres Erbsen	2016-02-13
\| \| \| \|	Closed Under Global Context
*	Merge branch 'master' into spec	Jade Philipoom	2016-02-13
\|\
\| *	EdDSA spec ported over to new field implementation	Jade Philipoom	2016-02-13
\| \|
* \|	implement F_opp	Andres Erbsen	2016-02-12
\| \|
\| *	Merge branch 'spec' of github.mit.edu:plv/fiat-crypto	Jade Philipoom	2016-02-12
\| \|\ \| \|/ \|/\|
\| *	EdDSA25519: progress on proving PointEncoding admits; code still unorganized	Jade Philipoom	2016-02-12
\| \|
* \|	workaround field with typeclass modulus	Andres Erbsen	2016-02-12
\| \|
* \|	fix imports	Andres Erbsen	2016-02-12
\| \|
* \|	document field issue re-appearing	Andres Erbsen	2016-02-12
\| \|
* \|	port some edwards curve theorems	Andres Erbsen	2016-02-12
\| \|