tZhVFdZddlmZddlZddlZddlZddlZddlmZddl m Z m Z m Z ddl mZddlmZd Zej$eZd Zd Zej,d k\rd ZndZej,dkrdZndZdZd,dZGddZdZdZdZefdZefdZ dZ!dZ"dZ#dZ$dZ%d Z&d!Z'd"Z(d#Z)d$Z*d%Z+d&Z,Gd'd(e-Z.d)Z/d*Z0d+Z1y)-a This module includes some utility functions. The methods most typically used are the sigencode and sigdecode functions to be used with :func:`~ecdsa.keys.SigningKey.sign` and :func:`~ecdsa.keys.VerifyingKey.verify` respectively. See the :func:`sigencode_strings`, :func:`sigdecode_string`, :func:`sigencode_der`, :func:`sigencode_strings_canonize`, :func:`sigencode_string_canonize`, :func:`sigencode_der_canonize`, :func:`sigdecode_strings`, :func:`sigdecode_string`, and :func:`sigdecode_der` functions. )divisionN)sha256)PY2int2bytenext)der)normalise_bytes)riHi='r r)rr )rr r r )r c|ttj|dddjt |dzS)-Convert a bytestring to string of 0's and 1'sbigr N)binint from_byteszfilllenent_256s f/var/www/html/wine-match-dev/backend/winematch-backend/venv/lib/python3.12/site-packages/ecdsa/util.pyentropy_to_bitsr4s33>>'512126<z"entropy_to_bits..<s)AAs3q6{12,,Q/As02)joinrs rrr:swwAAAAr)r c0tt|dz S)Nr )rrr#s r bit_lengthr)As3q6{Qrc*|jxsdSNr)r)r(s rr)r)Fs||~""rc*dtd|zzdzS)Nrz%xr )r)orders rorderlenr.Js D5L! !a ''rc|dkDsJ|tj}t|dz }|dzdz} ||}t|}t |d|ddz}d|cxkr|kr|S5)aReturn a random integer k such that 1 <= k < order, uniformly distributed across that range. Worst case should be a mean of 2 loops at (2**k)+2. Note that this function is not declared to be forwards-compatible: we may change the behavior in future releases. The entropy= argument (which should get a callable that behaves like os.urandom) can be used to achieve stability within a given release (for repeatable unit tests), but should not be used as a long-term-compatible key generation algorithm. rNr r)baser)osurandomr)rr)r-entropyupper_2 upper_256rent_2rand_nums r randranger8Ns 199**#G1 q I )$(uXgQ/!3 x % O rceZdZdZdZdZy)PRNGc0|j||_yN)block_generator generator)selfseeds r__init__z PRNG.__init__ls--d3rct|Dcgc]}t|j}}trdj |St |Scc}w)Nr)rangerr>rr%bytes)r?numbytesias r__call__z PRNG.__call__osA+0? ;aT$.. ! ; ; 771: 8O rc,t|||\}}||zS)a Encode the signature to raw format (:term:`raw encoding`) It's expected that this function will be used as a ``sigencode=`` parameter in :func:`ecdsa.keys.SigningKey.sign` method. :param int r: first parameter of the signature :param int s: second parameter of the signature :param int order: the order of the curve over which the signature was computed :return: raw encoding of ECDSA signature :rtype: bytes )rrs rsigencode_stringrs "%Q51LE5 5=rcztjtj|tj|S)a Encode the signature into the ECDSA-Sig-Value structure using :term:`DER`. Encodes the signature to the following :term:`ASN.1` structure:: Ecdsa-Sig-Value ::= SEQUENCE { r INTEGER, s INTEGER } It's expected that this function will be used as a ``sigencode=`` parameter in :func:`ecdsa.keys.SigningKey.sign` method. :param int r: first parameter of the signature :param int s: second parameter of the signature :param int order: the order of the curve over which the signature was computed :return: DER encoding of ECDSA signature :rtype: bytes )r encode_sequenceencode_integerrrr-s r sigencode_derrs-,   s11!4c6H6H6K LLrc ||dzkDr||z }|S)a8 Internal function for ensuring that the ``s`` value of a signature is in the "canonical" format. :param int s: the second parameter of ECDSA signature :param int order: the order of the curve over which the signatures was computed :return: canonical value of s :rtype: int r rQ)rr-s r _canonizer3s 5A:~ AI Hrc4t||}t|||S)a Encode the signature to a pair of strings in a tuple Encodes signature into raw encoding (:term:`raw encoding`) with the ``r`` and ``s`` parts of the signature encoded separately. Makes sure that the signature is encoded in the canonical format, where the ``s`` parameter is always smaller than ``order / 2``. Most commonly used in bitcoin. It's expected that this function will be used as a ``sigencode=`` parameter in :func:`ecdsa.keys.SigningKey.sign` method. :param int r: first parameter of the signature :param int s: second parameter of the signature :param int order: the order of the curve over which the signature was computed :return: raw encoding of ECDSA signature :rtype: tuple(bytes, bytes) )rrrs rsigencode_strings_canonizerDs, !UA Q5 ))rc4t||}t|||S)aw Encode the signature to raw format (:term:`raw encoding`) Makes sure that the signature is encoded in the canonical format, where the ``s`` parameter is always smaller than ``order / 2``. Most commonly used in bitcoin. It's expected that this function will be used as a ``sigencode=`` parameter in :func:`ecdsa.keys.SigningKey.sign` method. :param int r: first parameter of the signature :param int s: second parameter of the signature :param int order: the order of the curve over which the signature was computed :return: raw encoding of ECDSA signature :rtype: bytes )rrrs rsigencode_string_canonizer^s& !UA Aq% ((rc4t||}t|||S)a9 Encode the signature into the ECDSA-Sig-Value structure using :term:`DER`. Makes sure that the signature is encoded in the canonical format, where the ``s`` parameter is always smaller than ``order / 2``. Most commonly used in bitcoin. Encodes the signature to the following :term:`ASN.1` structure:: Ecdsa-Sig-Value ::= SEQUENCE { r INTEGER, s INTEGER } It's expected that this function will be used as a ``sigencode=`` parameter in :func:`ecdsa.keys.SigningKey.sign` method. :param int r: first parameter of the signature :param int s: second parameter of the signature :param int order: the order of the curve over which the signature was computed :return: DER encoding of ECDSA signature :rtype: bytes )rrrs rsigencode_der_canonizerus4 !UA Au %%rceZdZdZy)MalformedSignatureaB Raised by decoding functions when the signature is malformed. Malformed in this context means that the relevant strings or integers do not match what a signature over provided curve would create. Either because the byte strings have incorrect lengths or because the encoded values are too large. N)rNrOrP__doc__rQrrrrs  rrct|}t|}t|d|zk(s'tdj d|zt|t |d||}t ||d|}||fS)a Decoder for :term:`raw encoding` of ECDSA signatures. raw encoding is a simple concatenation of the two integers that comprise the signature, with each encoded using the same amount of bytes depending on curve size/order. It's expected that this function will be used as the ``sigdecode=`` parameter to the :func:`ecdsa.keys.VerifyingKey.verify` method. :param signature: encoded signature :type signature: bytes like object :param order: order of the curve over which the signature was computed :type order: int :raises MalformedSignature: when the encoding of the signature is invalid :return: tuple with decoded ``r`` and ``s`` values of signature :rtype: tuple of ints r zWInvalid length of signature, expected {0} bytes long, provided string is {1} bytes longN)r r.rrformatr) signaturer-rvrrs rsigdecode_stringrs|* *IA y>QU "  006q1uc)n0M   ")BQ-7A!)AB-7A a4Krct|dk(s#tdjt||\}}t|}t|}t |}t||k(s$tdj|t|t||k(s$tdj|t|t ||}t ||}||fS)a Decode the signature from two strings. First string needs to be a big endian encoding of ``r``, second needs to be a big endian encoding of the ``s`` parameter of an ECDSA signature. It's expected that this function will be used as the ``sigdecode=`` parameter to the :func:`ecdsa.keys.VerifyingKey.verify` method. :param list rs_strings: list of two bytes-like objects, each encoding one parameter of signature :param int order: order of the curve over which the signature was computed :raises MalformedSignature: when the encoding of the signature is invalid :return: tuple with decoded ``r`` and ``s`` values of signature :rtype: tuple of ints r z3Invalid number of strings provided: {0}, expected 2zjInvalid length of first string ('r' parameter), expected {0} bytes long, provided string is {1} bytes longzkInvalid length of second string ('s' parameter), expected {0} bytes long, provided string is {1} bytes long)rrrr r.r) rs_stringsr-rrrvrrs rsigdecode_stringsrs& z?a  A H HJ    NUE E "E E "EA u:?  3u:.  u:?  3u:.  "%/A!%/A a4Krcpt|}tj|\}}|dk7r+tjdt j |ztj |\}}tj |\}}|dk7r+tjdt j |z||fS)a Decoder for DER format of ECDSA signatures. DER format of signature is one that uses the :term:`ASN.1` :term:`DER` rules to encode it as a sequence of two integers:: Ecdsa-Sig-Value ::= SEQUENCE { r INTEGER, s INTEGER } It's expected that this function will be used as as the ``sigdecode=`` parameter to the :func:`ecdsa.keys.VerifyingKey.verify` method. :param sig_der: encoded signature :type sig_der: bytes like object :param order: order of the curve over which the signature was computed :type order: int :raises UnexpectedDER: when the encoding of signature is invalid :return: tuple with decoded ``r`` and ``s`` values of signature :rtype: tuple of ints rztrailing junk after DER sig: %sz#trailing junk after DER numbers: %s)r r remove_sequence UnexpectedDERrTrUremove_integer)sig_derr-remptyrrestrs r sigdecode_derrs2g&G++G4J | -0@0@0G G    ,GAt!!$'HAu | 1H4D4DU4K K   a4Krr<)2r __future__rr1r\rTsyshashlibrsixrrrrr _compatr oid_ecPublicKey encode_oidencoded_oid_ecPublicKeyoid_ecDH oid_ecMQV version_inforr)r.r8r:rWrZr`reriroryr{rkrrrrrrrr ExceptionrrrrrQrrrs   ##$+(#../:   tO B f #(06 "&>D =C &-- .*M2 "*4).&<    B+\&r