+ '(j#r^RIHt^RIHt^RIHtHt^RIHt Rt Rt !RR] 4t !R R ] 4tR #) ) is_native_int)number) long_to_bytes bytes_to_long)get_random_bytescW8dYr^pV'd,V^,'d W ,pV^,pV^,pK3V#)z!Multiply two polynomials in GF(2))f1f2zs&& R/home/ubuntu/cf-venv/lib/python3.14/site-packages/Crypto/Protocol/SecretSharing.py _mult_gf2r(s= wB A 66 GA q q HcW8d^V3#\Pp^pTpV!V4pV!V4V8d3^V!V4V, ,pW6,pV\W4,pK?W43#)z Compute division of polynomials over GF(2). Given a and b, it finds two polynomials q and r such that: a = b*q + r with deg(r)Edmm+,%-!2Cq1HIA 1HB{rcN\VPVP, 4#r%)rr)r terms&&r __add___Element.__add__s dkk122rc VP^8Xd \R4hVPVPr!^^rCV^8d9\W4^,pY!\ WR4, r!YC\ WT4, rCK?\ V4#)z0Return the inverse of this element in GF(2^128).zInversion of zero)rrr4rrr)r r0r1s0s1rs& r inverse_Element.inversesp ;;! 01 1dmmBAB1f #Ai..i..|rcr\VP4p\V^, 4F pW ,pK V#))rrrange)r exponentresult_s&& r __pow___Element.__pow__s/$++&x!|$A]F% rr&N)__name__ __module__ __qualname____firstlineno____doc__r4r"r(r,r/r<r@rGrO__static_attributes____classdictcell__ __classdict__s@r rrMsF$c)H Y+.23"rrcLa]tRt^toRt]RRl4t]RRl4tRtVt R#)ShamirzShamir's secret sharing scheme. A secret is split into ``n`` shares, and it is sufficient to collect ``k`` of them to reconstruct the secret. c  \V^, 4Uu.uFp\\^44NK ppVP\V44Rp\^V^,4Uu.uF qDV!WEV43NK up#uupiuupi)a Split a secret into ``n`` shares. The secret can be reconstructed later using just ``k`` shares out of the original ``n``. Each share must be kept confidential to the person it was assigned to. Each share is associated to an index (starting from 1). Args: k (integer): The number of shares needed to reconstruct the secret. n (integer): The number of shares to create (at least ``k``). secret (byte string): A byte string of 16 bytes (e.g. an AES 128 key). ssss (bool): If ``True``, the shares can be used with the ``ssss`` utility (without using the "diffusion layer"). Default: ``False``. Return (tuples): ``n`` tuples, one per participant. A tuple contains two items: 1. the unique index (an integer) 2. the share (16 bytes) c\V4p\^4pVFpW4,V,pK V'd#V\V4\V4,, pVP4#)r)rrr/)usercoeffsssssidxsharecoeffs&&& r make_share Shamir.split..make_sharesT4.CQKE e+ $3v;66<<> !r)rKrrngappend)knsecretr`ir_rds&&&& r split Shamir.splitswN.31q5\:\(3r7#\: hv&'  "";@1q5/J/QJq$/0/JJ/;.Ks A<&Bc a\V4p.pVFp\V^,4o\V^,4p\;QJdV3RlV4F 'gK RM RM!V3RlV44'd \R4hV'dVSV,, pVP SV34K \^4p\ V4FpW7,wr\^4p \^4p \ V4F1p W<,^,p W8wgKW,p WV ,,p K3 WiV ,V P 4,, pK VP4#)aRecombine a secret, if enough shares are presented. Args: shares (tuples): The *k* tuples, each containing the index (an integer) and the share (a byte string, 16 bytes long) that were assigned to a participant. .. note:: Pass exactly as many share as they are required, and no more. ssss (bool): If ``True``, the shares were produced by the ``ssss`` utility (without using the "diffusion layer"). Default: ``False``. Return: The original secret, as a byte string (16 bytes long). c3:<"TFq^,S8HxK R#5i)rNr ).0yras& r !Shamir.combine..s2 1Q43; sTFzDuplicate share)rranyrrgrKrGr/)sharesr`rh gf_sharesxvaluerMjx_jy_j numerator denominatormx_mras&& @r combineShamir.combinesL K A1Q4.CQqTNEs2 2sss2 222 !233!   c5\ *!qA |HC  I"1+K1Xl1o6$I9,K  Io (;(;(== =F}}rr N)F) rQrRrSrTrU staticmethodrlrrVrWrXs@r r[r[s5 =K=K~??rr[N)Crypto.Util.py3compatr Crypto.UtilrCrypto.Util.numberrr Crypto.Randomrrfrrobjectrr[r rr rs;D0;1  ,RvRjGVGr