k } ~ d dl mZ d dlmZ d dlmZmZ d dlmZ d Z
d Z G d de Z
G d d
e Zd S ) )
is_native_int)number)
long_to_bytes
bytes_to_long)get_random_bytesc N || k r|| }} d}|r|dz r|| z }| dz } |dz }||S )z!Multiply two polynomials in GF(2)r )f1f2zs /builddir/build/BUILD/imunify360-venv-2.6.2/opt/imunify360/venv/lib64/python3.11/site-packages/Crypto/Protocol/SecretSharing.py _mult_gf2r ( s[
BwwRB A
6
GA
q
q
H c | |k rd| fS t j }d}| } || } || |k r8d || |z
z }||z }|t || z } || |k 8||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!dm+,%%-!2Cq1HIA 1HB {{r c : t | j |j z S r) )r r" )r% terms r __add__z_Element.__add__ s dk1222r c | j dk rt d | j | j }}d\ }}|dk rFt || d }||t || z }}||t || z }}|dk Ft | S )z0Return the inverse of this element in GF(2^128).r zInversion of zero)r r )r" r$ r4 r r r )r% r0r1s0s1r s r inversez_Element.inverse s ;! 011 1dmBB1ffR #Ai2 . ..Bi2 . ..B 1ff ||r c b t | j }t |dz
D ]}|| z }|S )Nr )r r" range)r% exponentresult_s r __pow__z_Element.__pow__ s< $+&&x!|$$ # #Ad]FF
r N)
__name__
__module__ __qualname____doc__r4 r' r, r/ r1 r< r? rE rK r
r r r r M s $$ c)H
Y
Y
Y + + + . . . 23 3 3 " r r c B e Zd ZdZedd Zedd ZdS )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.
Fc d t | dz
D t | d fdt d|dz D S )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 sufficient number of shares to reconstruct the secret (``k < n``).
n (integer):
The number of shares that this method will create.
secret (byte string):
A byte string of 16 bytes (e.g. the AES 128 key).
ssss (bool):
If ``True``, the shares can be used with the ``ssss`` utility.
Default: ``False``.
Return (tuples):
``n`` tuples. A tuple is meant for each participant and it contains two items:
1. the unique index (an integer)
2. the share (a byte string, 16 bytes)
c F g | ] }t t d S )r! )r rng).0is r
z Shamir.split.. s& :::(3r77##:::r r c t | }t d }|D ]
}||z |z } |r"|t | t | z z
}| S )Nr )r r# r1 )usercoeffsssssidxsharecoeffs r
make_sharez Shamir.split..make_share sh 4..C QKKE
,
,e e+
7$ 3v;;66<<>> !r c . g | ]}| | fS r
r
)rU rV rZ r_ r[ s r rW z Shamir.split.. s, JJJQJJq&$//0JJJr )rG appendr )knsecretr[ rZ r_ s `@@r splitz Shamir.split s} J ;:U1q5\\:::
hv&&'''
" " " KJJJJJ%1q5//JJJJr c v t | }g }| D ]w}t |d t |d }t fd|D rt d |r||z z
}| |f xt d }t | D ]{}|| \ }} t d }
t d } t | D ]#} || d }
| |k r
|
|
z }
| ||
z z } $|| |
z | z z
}|| S )a Recombine 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).
r r c 3 0 K | ]}|d k V dS )r Nr
)rU yr\ s r z!Shamir.combine.. s+ 2211Q43;222222r zDuplicate share)r# r anyr$ ra rG rE r1 )sharesr[ rb gf_sharesxvaluerI jx_jy_j numerator denominatormx_mr\ s @r combinezShamir.combine s] >
KK + +A1Q4..C QqTNNE2222 22222
4 !2333
"! c5\ * * * *!q > >A |HC I"1++K1XX
-
- l1o66 $I 39,K cIo (;(;(=(== =FF}} r N)F)rL rM rN rO staticmethodre rv r
r r rQ rQ sc 3K 3K 3K \3Kj 7 7 7 \7 7 7 r rQ N)Crypto.Util.py3compatr Crypto.Utilr Crypto.Util.numberr r
Crypto.Randomr rT r r objectr rQ r
r r r} s D 0 / / / / / ; ; ; ; ; ; ; ; 1 1 1 1 1 1
,Q Q Q Q Qv Q Q Qhu u u u u V u u u u u r