fiat-crypto - fast, formally verified cryptography

	Commit message (Collapse)	Author	Age
*	Compatibility after Coq PR#262.	Hugo Herbelin	2018-05-14
\| \| \| \| \| \| \| \| \|	Coq PR#262 makes the inference of return clauses more uniform and general but unification is sometimes not strong enough to deal with this generality. See #5107 for details. One reduces the search space for a return clause by forbidding it to be obtained by small inversion.
*	move Loops from Experiments to Util	Andres Erbsen	2018-03-27
\|
*	Montgomery.XZ, Loops: montladder proof scaffolding	Andres Erbsen	2017-12-22
\|
*	Curves.Montgomery.XZ: add+check boringssl ladderstep (#278)	Andres Erbsen	2017-12-05
\|
*	use ladderstep from donna (2% faster?)	Andres Erbsen	2017-05-15
\|
*	Respond to code review comments	Jason Gross	2017-04-17
\|
*	Use the for-loop notation in Montgomery.XZ	Jason Gross	2017-04-17
\| \| \| \| \|	We also need to stuff the local notations in a scope so that we can still access the notations in core_scope
*	rename-everything	Andres Erbsen	2017-04-06