U Š¾úg²#ã@shddlmZddlmZddlmZmZddlmZ dd„Z dd„Z Gd d „d e ƒZ Gd d „d e ƒZd S)é)Ú is_native_int)Únumber)Ú long_to_bytesÚ bytes_to_long)Úget_random_bytescCs@||kr||}}d}|r<|d@r*||N}|dK}|dL}q|S)z!Multiply two polynomials in GF(2)ré©)Úf1Úf2ÚzrrúE/tmp/pip-unpacked-wheel-_q8s9isk/Cryptodome/Protocol/SecretSharing.pyÚ _mult_gf2(s  r cCsb||krd|fStj}d}|}||ƒ}||ƒ|krZd||ƒ|>}||N}|t||ƒN}q&||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')ÚuserÚcoeffsÚssssÚidxZshareZcoeffrrr Ú make_shareÖsz Shamir.split..make_sharecsg|]}|ˆ|ˆˆƒf‘qSrrr=©rBrErCrr r@çs)r2Úappendr)ÚkÚnÚsecretrCrrFr Úsplit©s'z Shamir.splitcsît|ƒ}g}|D]X}t|dƒ‰t|dƒ}t‡fdd„|DƒƒrJtdƒ‚|rZ|ˆ|7}| ˆ|f¡qtdƒ}t|ƒD]j}||\}} tdƒ} tdƒ} t|ƒD],} || d} | |kr¢| | 9} | || 9} q¢|| | |  ¡7}qz| ¡S)a’Recombine 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|]}|dˆkVqdS)rNr)r>Úy©rDrr Ú sz!Shamir.combine..zDuplicate share)rrÚanyrrGr2r1r')ZsharesrCrHZ gf_sharesÚxÚvaluer4ÚjZx_jZy_jÚ numeratorÚ denominatorÚmZx_mrrMr Úcombineés,&       zShamir.combineN)F)F)r7r8r9r:Ú staticmethodrKrVrrrr r;¢s  ?r;N)ZCryptodome.Util.py3compatrZCryptodome.UtilrZCryptodome.Util.numberrrZCryptodome.Randomrr<r rÚobjectrr;rrrr Ú"s   U