o n~bZ"@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)f1f2zrrL/usr/local/lib/python3.10/dist-packages/Cryptodome/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)sz Shamir.split..rcSsFt|}td}|D]}|||}q |r|t|t|7}|S)Nr)rrr')usercoeffsssssidxshareZcoeffrrr make_sharesz Shamir.split..make_sharecsg|] }||fqSrrr@rErIrFrr rCs)r5appendr)knsecretrFrrJr 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 containin the index (an integer) and the share (a byte string, 16 bytes long) that were assigned to a participant. ssss (bool): If ``True``, the shares were produced by the ``ssss`` utility. Default: ``False``. Return: The original secret, as a byte string (16 bytes long). rrc3s|] }|dkVqdS)rNr)rAyrGrr sz!Shamir.combine..zDuplicate share)rranyrrKr5r4r')ZsharesrFrLZ gf_sharesxvaluer7jZx_jZy_j numerator denominatormZx_mrrQr combines.        zShamir.combineN)F)r:r;r<r= staticmethodrOrZrrrr r>s  5r>N)ZCryptodome.Util.py3compatrZCryptodome.UtilrZCryptodome.Util.numberrrZCryptodome.Randomrr?r robjectrr>rrrr s !  T