o 5 h#@shddlmZddlmZddlmZmZddlmZ ddZ ddZ Gd d d e Z Gd d d e Zd S)) is_native_int)number) long_to_bytes bytes_to_long)get_random_bytescCsB||kr ||}}d}|r|d@r||N}|dK}|dL}|s |S)z!Multiply two polynomials in GF(2)r)f1f2zrrq/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/Crypto/Protocol/SecretSharing.py _mult_gf2(s r cCsl||krd|fStj}d}|}||}|||kr2d|||>}||N}|t||N}|||ks||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)rrrr rMs  rc@s,eZdZdZedddZedddZdS) 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. FcsLddt|dDt|ddfddtd|dDS)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) cSsg|]}ttdqS)r)rrng.0irrr sz Shamir.split..rcSsFt|}td}|D]}|||}q |r|t|t|7}|S)Nr)rrr()usercoeffsssssidxsharecoeffrrr make_sharesz Shamir.split..make_sharecsg|] }||fqSrrrErJrOrKrr rHs)r:appendr)knsecretrKrrPr splits' z Shamir.splitcst|}g}|D],}t|dt|d}tfdd|Dr%td|r-||7}||fqtd}t|D]5}||\}} td} td} t|D]} || d} | |krg| | 9} | || 9} qQ|| | | 7}q=|S)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). rrc3s|] }|dkVqdS)rNr)rFyrLrr sz!Shamir.combine..zDuplicate share)rranyrrQr:r9r()sharesrKrR gf_sharesxvaluer<jx_jy_j numerator denominatormx_mrrWr combines.&        zShamir.combineN)F)r?r@rArB staticmethodrUrerrrr rCs  ?rCN)Crypto.Util.py3compatr Crypto.UtilrCrypto.Util.numberrr Crypto.RandomrrDr robjectrrCrrrr s !  U