fact: Definition compute_key' (m : chMap pid (chProd public choiceTranscript1)) (i j : pid) (x : Secret) := if (j < i)%ord then let low := \prod_(k <- domm m | (k < i)%ord) (get_value m k) in let high := \prod_(k <- domm m | (i < k)%ord) (get_value m k) in (g ^+ x) * low * invg high else let low := \prod_(k <- domm m | (k < i)%ord) (get_value m k) in let high := \prod_(k <- domm m | (i < k)%ord) (get_value m k) in low * invg (high * (g ^+ x)).
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum fingroup.fingroup solvable.cyclic prime ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb UniformStateProb pkg_composition Package Prelude SigmaProtocol Schnorr DDH) Coq(Utf8 Lia) extructures(ord fset fmap) Equations(Equations)