,h#pddlmZddlmZddlmZmZddlmZ dZ dZ Gdde Z Gd d e Zy ) ) is_native_int)number) long_to_bytes bytes_to_long)get_random_bytescN||kDr||}}d}|r|dzr||z}|dz}|dz}|r|S)z!Multiply two polynomials in GF(2)r)f1f2zs _/var/www/html/Resume-Scraper/venv/lib/python3.12/site-packages/Crypto/Protocol/SecretSharing.py _mult_gf2r(sJ BwRB A 6 GA q q Hc||krd|fStj}d}|}||}|||k\r.d|||z z}||z}|t||z}|||k\r.||fS)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)E!dmm+,%%-!2Cq1HIA 1HB{rcFt|j|jz Sr))rr")r%terms r__add__z_Element.__add__s dkk122rc|jdk(r td|j|j}}d\}}|dkDr7t||d}||t ||z }}||t ||z }}|dkDr7t |S)z0Return the inverse of this element in GF(2^128).rzInversion of zero)r r)r"r$r4rrr)r%r0r1s0s1rs rinversez_Element.inverses ;;! 01 1dmmBB1fR #Ai2..Bi2..B1f|rc`t|j}t|dz D]}||z} |S)Nr )rr"range)r%exponentresult_s r__pow__z_Element.__pow__s6$++&x!|$ #Ad]F # rN) __name__ __module__ __qualname____doc__r4r'r,r/r1r<r?rErKr rrrrMs>$c)H Y+.23"rrc4eZdZdZeddZeddZy)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 t|dz Dcgc]}ttd}}|jt|d}td|dzDcgc]}|||||fc}Scc}wcc}w)aSplit 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!ct|}td}|D] }||z|z} |r|t|t|zz }|jS)Nr)rr#r1)usercoeffsssssidxsharecoeffs r make_sharez Shamir.split..make_shares[4.CQKE ,e e+ ,$3v;66<<> !r)rGrrngappend)knsecretrVirUrZs rsplitz Shamir.splitsvN.31q5\:(3r7#:: hv&'  "";@1q5/JQJq&$/0JJ/;.Ks A2A7ct|}g}|D]Z}t|dt|d}tfd|Dr td|r||zz }|j |f\td}t |D]d}||\}} td} td} t |D]} || d} | |k7s| | z} | || zz} || | z| j zz }f|jS)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 c3.K|] }|dk(yw)rNr ).0yrWs r z!Shamir.combine..s211Q43;2szDuplicate share)r#ranyr$r\rGrEr1)sharesrVr] gf_sharesxvaluerIjx_jy_j numerator denominatormx_mrWs @rcombinezShamir.combines"L K  +A1Q4.CQqTNE2 22 !233!   c5\ * +!q >A |HC  I"1+K1X -l1o6$I39,K  - cIo (;(;(== =F >}}rN)F)rLrMrNrO staticmethodrarsr rrrQrQs2 =K=K~??rrQN)Crypto.Util.py3compatr Crypto.UtilrCrypto.Util.numberrr Crypto.Randomrr[rrobjectrrQr rrrzs;D0;1  ,RvRjGVGr