i#pSSKJr SSKJr SSKJrJr SSKJr Sr Sr "SS\ 5r "S S \ 5rg ) ) is_native_int)number) long_to_bytes bytes_to_long)get_random_byteschX:aXpSnU(a!US-(aX -nUS-nUS-nU(aM!U$)z!Multiply two polynomials in GF(2)r)f1f2zs X/var/www/html/trading/venv/lib/python3.13/site-packages/Crypto/Protocol/SecretSharing.py _mult_gf2r(sD wB A 6 GA q q " HcX:aSU4$[RnSnUnU"U5nU"U5U:a.SU"U5U- -nX6-nU[X5-nU"U5U:aM.X44$)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 1HBb{rcF[URUR- 5$r+)rr#)r&terms r__add___Element.__add__s dkk122rcURS:Xa [S5eURURp!Sup4US:a2[X5SnX![ XR5- p!XC[ XT5- pCUS:aM2[ U5$)z0Return the inverse of this element in GF(2^128).rzInversion of zero)r r)r#r%r9rrr)r&r0r1s0s1rs rinverse_Element.inverses{ ;;! 01 1dmmB1f #Ai..i..1f|rcb[UR5n[US- 5HnX -nM U$)Nr )rr#range)r&exponentresult_s r__pow___Element.__pow__s/$++&x!|$A]F% rr,N)__name__ __module__ __qualname____firstlineno____doc__r9r(r.r2r5rArErLrS__static_attributes__r rrrrMs>$c)H Y+.23"rrc@\rSrSrSr\SSj5r\SSj5rSrg)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 [US- 5Vs/sHn[[S55PM nnUR[U55 Sn[SUS-5Vs/sH oDU"XEU54PM sn$s snfs snf)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) r r"c[U5n[S5nUH nX4-U-nM U(aU[U5[U5-- nUR5$)Nr)rr$r5)usercoeffsssssidxsharecoeffs r make_share Shamir.split..make_sharesT4.CQKE e+ $3v;66<<> !r)rOrrngappend)knsecretrbirarfs rsplit Shamir.splitswN.31q5\:\(3r7#\: hv&'  "";@1q5/J/QJq$/0/JJ/;.Ks A6A;c^[U5n/nUHfn[US5m[US5n[U4SjU55(a [S5eU(aUTU-- nUR TU45 Mh [S5n[ U5HbnX7up[S5n [S5n [ U5Hn X<Sn X:wdMX-n XU --n M XiU -U R 5-- nMd UR5$)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). rr c32># UH oST:Hv M g7f)rNr ).0yrcs r !Shamir.combine..s2 1Q43; szDuplicate share)r$ranyr%rirOrLr5)sharesrbrj gf_sharesxvaluerQjx_jy_j numerator denominatormx_mrcs @rcombineShamir.combinesL K A1Q4.CQqTNE2 222 !233!   c5\ *!qA |HC  I"1+K1Xl1o6$I9,K  Io (;(;(== =F}}rr N)F) rUrVrWrXrY staticmethodrnrrZr rrr\r\s2 =K=K~??rr\N)Crypto.Util.py3compatr Crypto.UtilrCrypto.Util.numberrr Crypto.Randomrrhrrobjectrr\r rrrs;D0;1  ,RvRjGVGr