[Ah^SrSSKrSSKJr SSKrSSKJr SSKJrJ r SSKJ r J r SSKJ r SS KJ r SS KJrJrJrJr SS KJr SS KJrJrJr SS KJrJrJr SSKJrJrJrJrJr SSK J!r! SSK"J#r# SSK J$r$J%r% /SQr&"SS\'5r("SS\'5r)Sr*"SS\+5r,"SS\+5r-g)zE Primary classes for performing signing and verification operations. N)sha1)PY2)ecdsaeddsa)derssh)rfc6979) ellipticcurve)NIST192pCurveEd25519Ed448) RSZeroError)string_to_numbernumber_to_string randrange)sigencode_stringsigdecode_string bit_length)oid_ecPublicKeyencoded_oid_ecPublicKeyoid_ecDH oid_ecMQVMalformedSignature)normalise_bytes)MalformedPointError) PointJacobi CurveEdTw)BadSignatureErrorBadDigestError VerifyingKey SigningKeyrc\rSrSrSrSrg)r &aP Raised when verification of signature failed. Will be raised irrespective of reason of the failure: * the calculated or provided hash does not match the signature * the signature does not match the curve/public key * the encoding of the signature is malformed * the size of the signature does not match the curve of the VerifyingKey N__name__ __module__ __qualname____firstlineno____doc____static_attributes__r&QC:\Users\julio\Documents\inmobiliaria_backend\env\Lib\site-packages\ecdsa/keys.pyr r &s   r.r c\rSrSrSrSrg)r!5zUnsupported, please use one of the classmethods to initialise.z2Please use VerifyingKey.generate() to construct meN) TypeErrorr;default_hashfuncpubkeyself_error__please_use_generates r/__init__VerifyingKey.__init__hs-*D  $ r.cURS5nUR(aUR5RnOSnSRXRU5$)N compressedNonez+VerifyingKey.from_string({0!r}, {1!r}, {2})) to_stringrFr7r6r;)rIpub_key hash_names r/__repr__VerifyingKey.__repr__rsN...  --/44II<CC ZZ  r.c[U[5(a9URUR:H=(a URUR:H$[$z9Return True if the points are identical, False otherwise.) isinstancer"r;rGNotImplementedrIothers r/__eq__VerifyingKey.__eq__|s: e\ * *::,L 1L Lr.c X:X+$z9Return False if the points are identical, True otherwise.r&rYs r/__ne__VerifyingKey.__ne__   r.TcU"SS9n[UR[5(a [S5e[U[R 5(d[R R U5nX%lX5l[R"URX5Ul URURlU$![Ra [S5ef=f)a6 Initialise the object from a Point object. This is a low-level method, generally you will not want to use it. :param point: The point to wrap around, the actual public key :type point: ~ecdsa.ellipticcurve.AbstractPoint :param curve: The curve on which the point needs to reside, defaults to NIST192p :type curve: ~ecdsa.curves.Curve :param hashfunc: The default hash function that will be used for verification, needs to implement the same interface as :py:class:`hashlib.sha1` :type hashfunc: callable :type bool validate_point: whether to check if the point lays on curve should always be used if the public point is not a result of our own calculation :raises MalformedPointError: if the public point does not lay on the curve :return: Initialised VerifyingKey object :rtype: VerifyingKey TrJz'Method incompatible with Edwards curveszPoint does not lay on the curve)rWr;r ValueErrorr r from_affinerFr Public_key generatorrGInvalidPointErrorrr8)clspointr;hashfuncvalidate_pointrIs r/from_public_pointVerifyingKey.from_public_points8t4 ekk9 - -FG G%!:!:;;!--99%@E ( I**DK "KK  && I%&GH H Is <&B?? CFc X[URR[5(aURRn[ R "UR5UR5UR5SUR5UR5-URRSS9URlOC[ RRURRS5URlU(dURRS- gg)a Precompute multiplication tables for faster signature verification. Calling this method will cause the library to precompute the scalar multiplication tables, used in signature verification. While it's an expensive operation (comparable to performing as many signatures as the bit size of the curve, i.e. 256 for NIST256p) it speeds up verification 2 times. You should call this method if you expect to verify hundreds of signatures (or more) using the same VerifyingKey object. Note: You should call this method only once, this method generates a new precomputation table every time it's called. :param bool lazy: whether to calculate the precomputation table now (if set to False) or if it should be delayed to the time of first use (when set to True) rT)rgN) rWr;rrGrjr PointEdwardsxyr8rre)rIlazypts r/ precomputeVerifyingKey.precomputes& djj&& 2 2""B - : :    !DKK !. 9 9 E E !!4!DKK   KK   !r.cP[UR[5(a<U"SS9nX&lSUl[R "UR U5UlU$[R"URUUUS9nURXrX45$![a [S5ef=f)a^ Initialise the object from byte encoding of public key. The method does accept and automatically detect the type of point encoding used. It supports the :term:`raw encoding`, :term:`uncompressed`, :term:`compressed`, and :term:`hybrid` encodings. It also works with the native encoding of Ed25519 and Ed448 public keys (technically those are compressed, but encoded differently than in other signature systems). Note, while the method is named "from_string" it's a misnomer from Python 2 days when there were no binary strings. In Python 3 the input needs to be a bytes-like object. :param string: single point encoding of the public key :type string: :term:`bytes-like object` :param curve: the curve on which the public key is expected to lay :type curve: ~ecdsa.curves.Curve :param hashfunc: The default hash function that will be used for verification, needs to implement the same interface as hashlib.sha1. Ignored for EdDSA. :type hashfunc: callable :param validate_point: whether to verify that the point lays on the provided curve or not, defaults to True. Ignored for EdDSA. :type validate_point: bool :param valid_encodings: list of acceptable point encoding formats, supported ones are: :term:`uncompressed`, :term:`compressed`, :term:`hybrid`, and :term:`raw encoding` (specified with ``raw`` name). All formats by default (specified with ``None``). Ignored for EdDSA. :type valid_encodings: :term:`set-like object` :raises MalformedPointError: if the public point does not lay on the curve or the encoding is invalid :return: Initialised VerifyingKey object :rtype: VerifyingKey TrcNzMalformed point for the curve)validate_encodingvalid_encodings) rWr;rrFr PublicKeyrgrGrdrr from_bytesrm)ristringr;rkrlrzrIrjs r/ from_stringVerifyingKey.from_strings^ ekk9 - -48DJ$(D ! K#ooeoovF K&& KK ,+   $$U8LL K)*IJJ Ks &BB%cNUR[R"U5UUUS9$)a Initialise from public key stored in :term:`PEM` format. The PEM header of the key should be ``BEGIN PUBLIC KEY``. See the :func:`~VerifyingKey.from_der()` method for details of the format supported. Note: only a single PEM object decoding is supported in provided string. :param string: text with PEM-encoded public ECDSA key :type string: str :param valid_encodings: list of allowed point encodings. By default :term:`uncompressed`, :term:`compressed`, and :term:`hybrid`. To read malformed files, include :term:`raw encoding` with ``raw`` in the list. :type valid_encodings: :term:`set-like object` :param valid_curve_encodings: list of allowed encoding formats for curve parameters. By default (``None``) all are supported: ``named_curve`` and ``explicit``. :type valid_curve_encodings: :term:`set-like object` :return: Initialised VerifyingKey object :rtype: VerifyingKey )rkrzvalid_curve_encodings)from_derrunpem)rir}rkrzrs r/from_pemVerifyingKey.from_pems0F|| IIf +"7   r.cUc [/SQ5n[U5n[R"U5upVUS:wa-[R"S[ R "U5-5e[R"U5upx[R"U5upU [R[R4;aU [R:Xa[n OU [R:Xde[n [R"US5upU(a[R"S5eURXS5$U [:Xd%[R"SRU 55e[R "X5n [R"US5upUS:wa-[R"S[ R "U5-5e[#U 5U R$:Xa[R"S 5eURU U UUS 9$) a  Initialise the key stored in :term:`DER` format. The expected format of the key is the SubjectPublicKeyInfo structure from RFC5912 (for RSA keys, it's known as the PKCS#1 format):: SubjectPublicKeyInfo {PUBLIC-KEY: IOSet} ::= SEQUENCE { algorithm AlgorithmIdentifier {PUBLIC-KEY, {IOSet}}, subjectPublicKey BIT STRING } Note: only public EC keys are supported by this method. The SubjectPublicKeyInfo.algorithm.algorithm field must specify id-ecPublicKey (see RFC3279). Only the named curve encoding is supported, thus the SubjectPublicKeyInfo.algorithm.parameters field needs to be an object identifier. A sequence in that field indicates an explicit parameter curve encoding, this format is not supported. A NULL object in that field indicates an "implicitlyCA" encoding, where the curve parameters come from CA certificate, those, again, are not supported. :param string: binary string with the DER encoding of public ECDSA key :type string: bytes-like object :param valid_encodings: list of allowed point encodings. By default :term:`uncompressed`, :term:`compressed`, and :term:`hybrid`. To read malformed files, include :term:`raw encoding` with ``raw`` in the list. :type valid_encodings: :term:`set-like object` :param valid_curve_encodings: list of allowed encoding formats for curve parameters. By default (``None``) all are supported: ``named_curve`` and ``explicit``. :type valid_curve_encodings: :term:`set-like object` :return: Initialised VerifyingKey object :rtype: VerifyingKey N) uncompressedrNhybridr.z"trailing junk after DER pubkey: %srztrailing junk after public keyz3Unexpected object identifier in DER encoding: {0!r}z*trailing junk after pubkey pointstring: %sz"Malformed encoding of public point)rkrz)setrrremove_sequence UnexpectedDERbinasciihexlify remove_objectroidrremove_bitstringr~rr6r rr4verifying_key_length) rir}rkrzrs1emptys2point_str_bitstringoid_pkrestr; point_strs r/rVerifyingKey.from_derEsZ  "!"JKO (''/  C<##4x7G7G7NN #&"5"5b"9((,  gkk599- -$***"334GK I''(HII??9T: :(##""(&. t;//0CQG C<##<""5)*  y>U77 7##$HI I  +   r.c [UR[5(a [S5e[ U5nU"U5R 5nUR UUUUUUS9$)a Return keys that can be used as verifiers of the provided signature. Tries to recover the public key that can be used to verify the signature, usually returns two keys like that. :param signature: the byte string with the encoded signature :type signature: bytes-like object :param data: the data to be hashed for signature verification :type data: bytes-like object :param curve: the curve over which the signature was performed :type curve: ~ecdsa.curves.Curve :param hashfunc: The default hash function that will be used for verification, needs to implement the same interface as hashlib.sha1 :type hashfunc: callable :param sigdecode: Callable to define the way the signature needs to be decoded to an object, needs to handle `signature` as the first parameter, the curve order (an int) as the second and return a tuple with two integers, "r" as the first one and "s" as the second one. See :func:`ecdsa.util.sigdecode_string` and :func:`ecdsa.util.sigdecode_der` for examples. :param bool allow_truncate: if True, the provided hashfunc can generate values larger than the bit size of the order of the curve, the extra bits (at the end of the digest) will be truncated. :type sigdecode: callable :return: Initialised VerifyingKey objects :rtype: list of VerifyingKey %Method unsupported for Edwards curves)rk sigdecoder<)rWr;rrdrr:$from_public_key_recovery_with_digest)ri signaturedatar;rkrr<r:s r/from_public_key_recovery%VerifyingKey.from_public_key_recoveryshN ekk9 - -DE Et$$&&(77   ) 8  r.c~[UR[5(a [S5eURnU"XR 55up[ R"X5n [U5n[X#U5n U RX5n U V s/sHoRU RX45PM nn U$s sn f)aE Return keys that can be used as verifiers of the provided signature. Tries to recover the public key that can be used to verify the signature, usually returns two keys like that. :param signature: the byte string with the encoded signature :type signature: bytes-like object :param digest: the hash value of the message signed by the signature :type digest: bytes-like object :param curve: the curve over which the signature was performed :type curve: ~ecdsa.curves.Curve :param hashfunc: The default hash function that will be used for verification, needs to implement the same interface as hashlib.sha1 :type hashfunc: callable :param sigdecode: Callable to define the way the signature needs to be decoded to an object, needs to handle `signature` as the first parameter, the curve order (an int) as the second and return a tuple with two integers, "r" as the first one and "s" as the second one. See :func:`ecdsa.util.sigdecode_string` and :func:`ecdsa.util.sigdecode_der` for examples. :type sigdecode: callable :param bool allow_truncate: if True, the provided hashfunc can generate values larger than the bit size of the order of the curve (and the length of provided `digest`), the extra bits (at the end of the digest) will be truncated. :return: Initialised VerifyingKey object :rtype: VerifyingKey r) rWr;rrdrgr8r Signaturerr@recover_public_keysrmrj)rirr:r;rkrr<rgrssigdigest_as_numberpkspkverifying_keyss r/r1VerifyingKey.from_public_key_recovery_with_digestsP ekk9 - -DE EOO OO$56ooa# (7 > %%&6BHK GJ ! !"((E 2 djj&& 2 2&&##CNNDJJNN$CD$$U9%5q9 ""   ' !!";L   A .  r.ct[R"URRUR 55$)zb Convert the public key to the SSH format. :return: SSH encoding of the public key :rtype: bytes )r serialize_publicr;r7rPrIs r/to_sshVerifyingKey.to_sshis,## JJOO NN   r.cz[U5n[URR[5(a'[U5nURR X!5$U=(d URnU"U5R5nURXXE5$![ [4an[SU5eSnAff=f)a Verify a signature made over provided data. Will hash `data` to verify the signature. By default expects signature in :term:`raw encoding`. Can also be used to verify signatures in ASN.1 DER encoding by using :func:`ecdsa.util.sigdecode_der` as the `sigdecode` parameter. :param signature: encoding of the signature :type signature: sigdecode method dependent :param data: data signed by the `signature`, will be hashed using `hashfunc`, if specified, or default hash function :type data: :term:`bytes-like object` :param hashfunc: The default hash function that will be used for verification, needs to implement the same interface as hashlib.sha1 :type hashfunc: callable :param sigdecode: Callable to define the way the signature needs to be decoded to an object, needs to handle `signature` as the first parameter, the curve order (an int) as the second and return a tuple with two integers, "r" as the first one and "s" as the second one. See :func:`ecdsa.util.sigdecode_string` and :func:`ecdsa.util.sigdecode_der` for examples. :type sigdecode: callable :param bool allow_truncate: if True, the provided digest can have bigger bit-size than the order of the curve, the extra bits (at the end of the digest) will be truncated. Use it when verifying SHA-384 output using NIST256p or in similar situations. Defaults to True. :raises BadSignatureError: if the signature is invalid or malformed :return: True if the verification was successful :rtype: bool Signature verification failedN) rrWr;rrGverifyrdrr rFr: verify_digest)rIrrrkrr<er:s r/rVerifyingKey.verifyus\t$ djj&& 2 2' 2I L{{))$::4t44$&&(!!)YOO  34 L'(GKK LsBB:) B55B:cd[U5n[UURU5nU"XRR5upg[R"Xg5n URRXY5(ag[S5e![ R [4an[SU5eSnAff=f)a] Verify a signature made over provided hash value. By default expects signature in :term:`raw encoding`. Can also be used to verify signatures in ASN.1 DER encoding by using :func:`ecdsa.util.sigdecode_der` as the `sigdecode` parameter. :param signature: encoding of the signature :type signature: sigdecode method dependent :param digest: raw hash value that the signature authenticates. :type digest: :term:`bytes-like object` :param sigdecode: Callable to define the way the signature needs to be decoded to an object, needs to handle `signature` as the first parameter, the curve order (an int) as the second and return a tuple with two integers, "r" as the first one and "s" as the second one. See :func:`ecdsa.util.sigdecode_string` and :func:`ecdsa.util.sigdecode_der` for examples. :type sigdecode: callable :param bool allow_truncate: if True, the provided digest can have bigger bit-size than the order of the curve, the extra bits (at the end of the digest) will be truncated. Use it when verifying SHA-384 output using NIST256p or in similar situations. :raises BadSignatureError: if the signature is invalid or malformed :raises BadDigestError: if the provided digest is too big for the curve associated with this VerifyingKey and allow_truncate was not set :return: True if the verification was successful :rtype: bool z!Malformed formatting of signatureNTr) rr@r;rGr8rrrr rrverifies) rIrr:rr<r=rrrrs r/rVerifyingKey.verify_digestsP!(-  JJ    LY (9(9:DAooa# ;;   , , ?@@ !!#56 L#$GK K LsBB/ B**B/)r;rFrGN)F)r)rN)r(r)r*r+r,rKrSr[r_ classmethodr rrmrvr~rrrrrrPrrrrrr-r&r.r/r"r"[s(   !"T$))V&"P >M>M@" ' ' R" V V p "1 1 f "77r40HL @HL% N  " 8P|# 6Ar.r"cR\rSrSrSrSSjrSrSr\S5r \S5r \\ S\ 4S j5r \\ \ 4S j5r\\ \ 4S j5r\\ S4S j5r\\ S4S j5rSrSSjrSrSSjrSrSrS\S4SjrS\SS4SjrSS\SS4SjrS\SS4SjrSSjrSrg) r#ia) Class for handling keys that can create signatures (private keys). :ivar `~ecdsa.curves.Curve` curve: The Curve over which all the cryptographic operations will take place :ivar default_hashfunc: the function that will be used for hashing the data. Should implement the same API as :py:class:`hashlib.sha1` :ivar int baselen: the length of a :term:`raw encoding` of private key :ivar `~ecdsa.keys.VerifyingKey` verifying_key: the public key associated with this private key :ivar `~ecdsa.ecdsa.Private_key` privkey: the actual private key NcnU(d [S5eSUlSUlSUlSUlSUlg)rDz0Please use SigningKey.generate() to construct meN)rEr;rFr5 verifying_keyprivkeyrHs r/rKSigningKey.__init__s6*NO O $ ! r.c[U[5(aYURUR:H=(a9 URUR:H=(a URUR:H$[ $rV)rWr#r;rrrXrYs r/r[SigningKey.__eq__sZ eZ ( ( ekk)2&&%*=*==2LLEMM1  r.c X:X+$r^r&rYs r/r_SigningKey.__ne__ rar.cbU(d[RnU"UR5n[R"UR U5nUR 5n[RUR 5U5nU"SS9nXl SUl URUlXGl Xgl U$)z2Generate a private key on a Twisted Edwards curve.TrcN) osurandomr5r PrivateKeyrg public_keyr"r~r;rFrr)rir;entropyrandom private_keyrrrIs r/_twisted_edwards_keygen"SigningKey._twisted_edwards_keygensjjG'&&u?  ++- $00  ! ! #U t4 $}} " * r.cR[URU5nURXAU5$)z.Generate a private key on a Weierstrass curve.)rr8from_secret_exponent)rir;rrksecexps r/_weierstrass_keygenSigningKey._weierstrass_keygen#s'5;;0''x@@r.c[UR[5(aURX5$UR XU5$)aM Generate a random private key. :param curve: The curve on which the point needs to reside, defaults to NIST192p :type curve: ~ecdsa.curves.Curve :param entropy: Source of randomness for generating the private keys, should provide cryptographically secure random numbers if the keys need to be secure. Uses os.urandom() by default. :type entropy: callable :param hashfunc: The default hash function that will be used for signing, needs to implement the same interface as hashlib.sha1 :type hashfunc: callable :return: Initialised SigningKey object :rtype: SigningKey )rWr;rrr)rir;rrks r/generateSigningKey.generate)s9( ekk9 - -..u> >&&ux@@r.c$[UR[5(a [S5eU"SS9nX$lX4lUR UlUR nSUs=::aU:dO [SRU55eURU-n[US5(aUR5n[RXbUS5UlURRn[ R""Xq5UlXTR$lU$)a Create a private key from a random integer. Note: it's a low level method, it's recommended to use the :func:`~SigningKey.generate` method to create private keys. :param int secexp: secret multiplier (the actual private key in ECDSA). Needs to be an integer between 1 and the curve order. :param curve: The curve on which the point needs to reside :type curve: ~ecdsa.curves.Curve :param hashfunc: The default hash function that will be used for signing, needs to implement the same interface as hashlib.sha1 :type hashfunc: callable :raises MalformedPointError: when the provided secexp is too large or too small for the curve selected :raises RuntimeError: if the generation of public key from private key failed :return: Initialised SigningKey object :rtype: SigningKey zHEdwards keys don't support setting the secret scalar (exponent) directlyTrcrzKMNN#7OE**1-DA**1-HA|''9&&u-. ++A.JG a<##F  003 $'$:$:1$= !Cax'';cANN=2GHE { emm +5==3{+;;<{J {8<? ?,,,, djj&& 2 2  !NOO%%' '++-77G   q !  # #DNN$4 5  X   ! !&&tzz(()BC    " "1c&:&::q&I J ,,n= X ! !&&""1%##NNO4JJ%%&?@''7  r.c[R"URRURR 5UR 55$)z\ Convert the private key to the SSH format. :return: SSH encoded private key :rtype: bytes )r serialize_privater;r7rrPrs r/rSigningKey.to_ssh s>$$ JJOO    ( ( * NN   r.cUR$)z Return the VerifyingKey associated with this private key. Equivalent to reading the `verifying_key` field of an instance. :return: a public key that can be used to verify the signatures made with this SigningKey :rtype: VerifyingKey )rrs r/rSigningKey.get_verifying_keys!!!r.r.c2U=(d URn[U5n[URR[5(aUR R U5$[U5nU"U5R5nURUUUUSS9$)a= Create signature over data. For Weierstrass curves it uses the deterministic RFC6979 algorithm. For Edwards curves it uses the standard EdDSA algorithm. For ECDSA the data will be hashed using the `hashfunc` function before signing. For EdDSA the data will be hashed with the hash associated with the curve (SHA-512 for Ed25519 and SHAKE-256 for Ed448). This is the recommended method for performing signatures when hashing of data is necessary. :param data: data to be hashed and computed signature over :type data: :term:`bytes-like object` :param hashfunc: hash function to use for computing the signature, if unspecified, the default hash function selected during object initialisation will be used (see `VerifyingKey.default_hashfunc`). The object needs to implement the same interface as hashlib.sha1. Ignored with EdDSA. :type hashfunc: callable :param sigencode: function used to encode the signature. The function needs to accept three parameters: the two integers that are the signature and the order of the curve over which the signature was computed. It needs to return an encoded signature. See `ecdsa.util.sigencode_string` and `ecdsa.util.sigencode_der` as examples of such functions. Ignored with EdDSA. :type sigencode: callable :param extra_entropy: additional data that will be fed into the random number generator used in the RFC6979 process. Entirely optional. Ignored with EdDSA. :type extra_entropy: :term:`bytes-like object` :return: encoded signature over `data` :rtype: bytes or sigencode function dependent type T)rk sigencode extra_entropyr<) rFrrWr;rrsignr:sign_digest_deterministic)rIrrkr*r+r:s r/sign_deterministicSigningKey.sign_deterministic#s\4t44t$ djj&& 2 2<<$$T* *' 6 $&&(-- ' .  r.Fc [URR[5(a [S5eURR nU=(d UR n[U5n[U5nSnSn[R"URRR5UUUUUS9n URUUU US9upn U"XU 5$![a US- nOf=fMr)a Create signature for digest using the deterministic RFC6979 algorithm. `digest` should be the output of cryptographically secure hash function like SHA256 or SHA-3-256. This is the recommended method for performing signatures when no hashing of data is necessary. :param digest: hash of data that will be signed :type digest: :term:`bytes-like object` :param hashfunc: hash function to use for computing the random "k" value from RFC6979 process, if unspecified, the default hash function selected during object initialisation will be used (see :attr:`.VerifyingKey.default_hashfunc`). The object needs to implement the same interface as :func:`~hashlib.sha1` from :py:mod:`hashlib`. :type hashfunc: callable :param sigencode: function used to encode the signature. The function needs to accept three parameters: the two integers that are the signature and the order of the curve over which the signature was computed. It needs to return an encoded signature. See :func:`~ecdsa.util.sigencode_string` and :func:`~ecdsa.util.sigencode_der` as examples of such functions. :type sigencode: callable :param extra_entropy: additional data that will be fed into the random number generator used in the RFC6979 process. Entirely optional. :type extra_entropy: :term:`bytes-like object` :param bool allow_truncate: if True, the provided digest can have bigger bit-size than the order of the curve, the extra bits (at the end of the digest) will be truncated. Use it when signing SHA-384 output using NIST256p or in similar situations. :return: encoded signature for the `digest` hash :rtype: bytes or sigencode function dependent type rc XU4$rr&)rrr8s r/ simple_r_s8SigningKey.sign_digest_deterministic..simple_r_ss ; r.r) retry_genr+)r*kr<r)rWr;rrdrrrFrr generate_krgr8 sign_digestr) rIr:rkr*r+r<rr2r4r5rrr8s r/r-$SigningKey.sign_digest_deterministicbs\ djj&& 2 2DE E//4t44 (' 6   "" $$**,#+ A "..(#1 / e u%% Q  #s8CC)(C)TcU=(d URn[U5n[URR[5(aUR U5$U"U5R 5nURXrXEU5$)aX Create signature over data. Uses the probabilistic ECDSA algorithm for Weierstrass curves (NIST256p, etc.) and the deterministic EdDSA algorithm for the Edwards curves (Ed25519, Ed448). This method uses the standard ECDSA algorithm that requires a cryptographically secure random number generator. It's recommended to use the :func:`~SigningKey.sign_deterministic` method instead of this one. :param data: data that will be hashed for signing :type data: :term:`bytes-like object` :param callable entropy: randomness source, :func:`os.urandom` by default. Ignored with EdDSA. :param hashfunc: hash function to use for hashing the provided ``data``. If unspecified the default hash function selected during object initialisation will be used (see :attr:`.VerifyingKey.default_hashfunc`). Should behave like :func:`~hashlib.sha1` from :py:mod:`hashlib`. The output length of the hash (in bytes) must not be longer than the length of the curve order (rounded up to the nearest byte), so using SHA256 with NIST256p is ok, but SHA256 with NIST192p is not. (In the 2**-96ish unlikely event of a hash output larger than the curve order, the hash will effectively be wrapped mod n). If you want to explicitly allow use of large hashes with small curves set the ``allow_truncate`` to ``True``. Use ``hashfunc=hashlib.sha1`` to match openssl's ``-ecdsa-with-SHA1`` mode, or ``hashfunc=hashlib.sha256`` for openssl-1.0.0's ``-ecdsa-with-SHA256``. Ignored for EdDSA :type hashfunc: callable :param sigencode: function used to encode the signature. The function needs to accept three parameters: the two integers that are the signature and the order of the curve over which the signature was computed. It needs to return an encoded signature. See :func:`~ecdsa.util.sigencode_string` and :func:`~ecdsa.util.sigencode_der` as examples of such functions. Ignored for EdDSA :type sigencode: callable :param int k: a pre-selected nonce for calculating the signature. In typical use cases, it should be set to None (the default) to allow its generation from an entropy source. Ignored for EdDSA. :param bool allow_truncate: if ``True``, the provided digest can have bigger bit-size than the order of the curve, the extra bits (at the end of the digest) will be truncated. Use it when signing SHA-384 output using NIST256p or in similar situations. True by default. Ignored for EdDSA. :raises RSZeroError: in the unlikely event when *r* parameter or *s* parameter of the created signature is equal 0, as that would leak the key. Caller should try a better entropy source, retry with different ``k``, or use the :func:`~SigningKey.sign_deterministic` in such case. :return: encoded signature of the hash of `data` :rtype: bytes or sigencode function dependent type )rFrrWr;rr.r:r7)rIrrrkr*r5r<hs r/r,SigningKey.signsnV4t44t$ djj&& 2 2**40 0 TN ! ! #I.IIr.c[URR[5(a [S5e[ U5n[ UURU5nUR XbU5upxU"XxURR5$)a Create signature over digest using the probabilistic ECDSA algorithm. This method uses the standard ECDSA algorithm that requires a cryptographically secure random number generator. This method does not hash the input. It's recommended to use the :func:`~SigningKey.sign_digest_deterministic` method instead of this one. :param digest: hash value that will be signed :type digest: :term:`bytes-like object` :param callable entropy: randomness source, os.urandom by default :param sigencode: function used to encode the signature. The function needs to accept three parameters: the two integers that are the signature and the order of the curve over which the signature was computed. It needs to return an encoded signature. See `ecdsa.util.sigencode_string` and `ecdsa.util.sigencode_der` as examples of such functions. :type sigencode: callable :param int k: a pre-selected nonce for calculating the signature. In typical use cases, it should be set to None (the default) to allow its generation from an entropy source. :param bool allow_truncate: if True, the provided digest can have bigger bit-size than the order of the curve, the extra bits (at the end of the digest) will be truncated. Use it when signing SHA-384 output using NIST256p or in similar situations. :raises RSZeroError: in the unlikely event when "r" parameter or "s" parameter of the created signature is equal 0, as that would leak the key. Caller should try a better entropy source, retry with different 'k', or use the :func:`~SigningKey.sign_digest_deterministic` in such case. :return: encoded signature for the `digest` hash :rtype: bytes or sigencode function dependent type r) rWr;rrdrr@ sign_numberrr8) rIr:rr*r5r<r=rrs r/r7SigningKey.sign_digestsv^ djj&& 2 2DE E (-  JJ   3t||1122r.cB[URR[5(a [S5eURR nUbUnO [ XB5nSUs=::aU:de eURRX5nURUR4$)a; Sign an integer directly. Note, this is a low level method, usually you will want to use :func:`~SigningKey.sign_deterministic` or :func:`~SigningKey.sign_digest_deterministic`. :param int number: number to sign using the probabilistic ECDSA algorithm. :param callable entropy: entropy source, os.urandom by default :param int k: pre-selected nonce for signature operation. If unset it will be selected at random using the entropy source. :raises RSZeroError: in the unlikely event when "r" parameter or "s" parameter of the created signature is equal 0, as that would leak the key. Caller should try a better entropy source, retry with different 'k', or use the :func:`~SigningKey.sign_digest_deterministic` in such case. :return: the "r" and "s" parameters of the signature :rtype: tuple of ints rr) rWr;rrdrr8rr,rr)rIr=rr5r8_krs r/r=SigningKey.sign_number=s. djj&& 2 2DE E "" =B5*BBll+uucee|r.)r5r;rFrrr)rrN)NN)r(r)r*r+r,rKr[r_rrrr rrrr~rrrPrrrrrrr.r-r,r7r=r-r&r.r/r#r#sX !(AA $dTAA.08400d'/$+A+AZ'+41 1 f'+4k=k=Z&&"& % N &"& CJ   "" = D" M&d" PJj"  83t"r.r#).r,rhashlibrrsixrrrrr r r curvesr r rrrutilrrrrrrrrrrr_compatrerrorsrrr__all__ Exceptionr r!r@objectr"r#r&r.r/rLs 33??@@%'1     Y @J A6J AZw w r.