MCPcopy Create free account

hub / github.com/Godspower-Eze/learn-cryptography-and-zk / functions

Functions275 in github.com/Godspower-Eze/learn-cryptography-and-zk

⨍ Functions 275◇ Types & classes 37
↓ 1 callersMethodequal
(self, b: 'Field')
with_python/utils/fields.py:84
↓ 1 callersMethodequal
(p: BandersnatchExtendedPoint, q: BandersnatchExtendedPoint)
with_python/utils/ecc/bandersnatch/curve.py:310
↓ 1 callersMethodevaluate
(self, encrypted_terms: list[int], encrypted_terms_with_a: list[int],
with_python/commitments/polynomials/basic_polynomial_comm_using_mod.py:219
↓ 1 callersMethodevaluate
(self, encrypted_terms: list[int], encrypted_terms_with_a: list[int],
with_python/commitments/polynomials/basic_polynomial_comm_using_ecc.py:91
↓ 1 callersMethodexpand_block
(self, block: bytes)
with_python/commitments/hashing/sha1.py:111
↓ 1 callersMethodexpand_block
(self, block: bytes)
with_python/commitments/hashing/sha2/sha512.py:56
↓ 1 callersMethodexpand_block
(self, block: bytes)
with_python/commitments/hashing/sha2/sha256.py:104
↓ 1 callersMethodf1
(self, b: int, c: int, d: int)
with_python/commitments/hashing/sha1.py:80
↓ 1 callersMethodf3
(self, b: int, c: int, d: int)
with_python/commitments/hashing/sha1.py:88
↓ 1 callersMethodf4
(self, b: int, c: int, d: int)
with_python/commitments/hashing/sha1.py:92
↓ 1 callersMethodfrom_bytes
(bytes)
with_python/utils/ecc/bandersnatch/fields.py:39
↓ 1 callersMethodfrom_bytes_reduce
(bytes)
with_python/utils/ecc/bandersnatch/fields.py:42
↓ 1 callersMethodgenerate_private_key
The goal of this function to find the multiplicative inverse `d` of (e congruent to 1 mod ɸ(n)). We will use the Extended Euclidean
with_python/rsa.py:93
↓ 1 callersMethodgenerate_public_key
The goal of this function to find `e` such that gcd(e, ɸ(n)) congruent to 1. `e` is the encryption key/public key We use br
with_python/rsa.py:72
↓ 1 callersMethodgenerate_random_number
(self)
with_python/signatures/ecdsa.py:65
↓ 1 callersFunctionhash
(message: bytes)
with_python/commitments/hashing/sha3/sha512.py:6
↓ 1 callersFunctionhash
(message: bytes)
with_python/commitments/hashing/sha3/sha256.py:6
↓ 1 callersFunctionhash
(message: bytes)
with_python/commitments/hashing/sha3/sha224.py:6
↓ 1 callersFunctionhash
(message: bytes)
with_python/commitments/hashing/sha3/sha384.py:6
↓ 1 callersMethodinverse
(&self)
with_rust/ff/src/lib.rs:168
↓ 1 callersMethodis_on_curve
To check if a point is on the curve, we check that the lhs of the equation below is equal to it's rhs: A(x ** 2) + y ** 2 = 1 +
with_python/utils/ecc/bandersnatch/curve.py:138
↓ 1 callersMethodis_one
(self)
with_python/utils/fields.py:32
↓ 1 callersMethodis_zero
(self)
with_python/utils/fields.py:29
↓ 1 callersFunctionkeccak1600
the goal of this function is to convert a message to a 5 x 5 array with 64-bit words. we achieve this by taking the message in groups of 8 b
with_python/commitments/hashing/sha3/utils.py:84
↓ 1 callersFunctionkeccak_f_1600
(state_array)
with_python/commitments/hashing/sha3/utils.py:218
↓ 1 callersMethodletter_to_number
(self, word: str)
with_python/ciphers/xor_and_one_time_pad.py:62
↓ 1 callersFunctionmodular_sqrt
Find a quadratic residue (mod p) of 'a'. p must be an odd prime. Solve the congruence of the form: x^2 = a (mod p)
with_python/utils/fields.py:178
↓ 1 callersMethodmul_comm
(self, *c)
with_python/commitments/pedcomm_mod.py:84
↓ 1 callersMethodmulti_inv
(values: list['Field'])
with_python/utils/fields.py:97
↓ 1 callersMethodmulti_inv
(values)
with_python/utils/ecc/bandersnatch/fields.py:51
↓ 1 callersFunctionnormalize
(transposed_state_array: List[List[int]], l: int)
with_python/commitments/hashing/sha3/utils.py:234
↓ 1 callersMethodone
(modulus)
with_python/utils/fields.py:20
↓ 1 callersMethodpad
(self, message: bytes)
with_python/commitments/hashing/sha1.py:100
↓ 1 callersFunctionrho_and_pi
(state_array: np.ndarray)
with_python/commitments/hashing/sha3/utils.py:193
↓ 1 callersMethodsetup
(self, x: int, a: int, t_of_x: list[int])
with_python/commitments/polynomials/basic_polynomial_comm_using_mod.py:173
↓ 1 callersMethodsetup
(self, x: int, a: int, t_of_x: list[int])
with_python/commitments/polynomials/basic_polynomial_comm_using_ecc.py:45
↓ 1 callersMethodslope_for_point_addition
To get the slope when solving for point addition: s = ((y2 - y1)/(x2 - x1)) mod p But, to avoid getting decimal values,
with_python/utils/ecc.py:75
↓ 1 callersMethodslope_for_point_doubling
To get the slope when solving for point doubling: s = ((3 * (x1 ** 2) + a)/2y1) mod p But, to avoid getting decimal valu
with_python/utils/ecc.py:93
↓ 1 callersMethodsub
(self, a: 'Field', b: 'Field')
with_python/utils/fields.py:69
↓ 1 callersFunctiontheta
implemented according to the spec(FIPS PUB 202), section 3.2.1
with_python/commitments/hashing/sha3/utils.py:172
↓ 1 callersMethodto_affine
(self)
with_python/utils/ecc/bandersnatch/curve.py:389
↓ 1 callersMethodto_bytes
(self, byte_length: int)
with_python/utils/fields.py:35
↓ 1 callersMethodto_bytes
(self)
with_python/utils/ecc/bandersnatch/fields.py:45
↓ 1 callersMethodto_bytes
(self)
with_python/utils/ecc/bandersnatch/curve.py:159
↓ 1 callersFunctiontranspose
(state_array: List[List[int]])
with_python/commitments/hashing/sha3/utils.py:225
↓ 1 callersMethodverify
(self, m: int, r: int, s: int, q: tuple[int, int])
with_python/signatures/ecdsa.py:91
Method__add__
(self, other)
with_python/utils/fields.py:143
Method__add__
(self, other)
with_python/utils/ecc/bandersnatch/fields.py:117
Method__add__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:240
Method__add__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:412
Method__eq__
(self, obj)
with_python/utils/fields.py:168
Method__eq__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:263
Method__eq__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:435
Method__init__
(self, p: int, q: int)
with_python/rsa.py:28
Method__init__
(self, value, modulus)
with_python/utils/fields.py:13
Method__init__
(self, curve)
with_python/utils/ecc.py:58
Method__init__
(self, value=None, generic_field=None)
with_python/utils/ecc/bandersnatch/fields.py:82
Method__init__
(self, gx: Fp, gy: Fp)
with_python/utils/ecc/bandersnatch/curve.py:32
Method__init__
(self, affine_point: BandersnatchAffinePoint)
with_python/utils/ecc/bandersnatch/curve.py:276
Method__init__
(self, generator: int, modulus: int)
with_python/key_exchange/diffie_hellman.py:38
Method__init__
(self, p)
with_python/commitments/pedcomm_mod.py:61
Method__init__
(self, curve)
with_python/commitments/pedcomm_ecc.py:38
Method__init__
(self, d: int, g: int, n: int)
with_python/commitments/polynomials/basic_polynomial_comm_using_mod.py:148
Method__init__
(self, curve, d: int)
with_python/commitments/polynomials/basic_polynomial_comm_using_ecc.py:20
Method__init__
(self, g: int, d: int, n: int, x: int, a: int)
with_python/commitments/polynomials/basic_trusted_setup_mod.py:72
Method__init__
(self, curve, d: int, x: int, a: int)
with_python/commitments/polynomials/basic_trusted_setup_ecc.py:21
Method__init__
(self, _secret_word: str)
with_python/ciphers/polyaphabetic_cipher.py:49
Method__init__
(self, _secret_number: int)
with_python/ciphers/caesar_cipher.py:53
Method__init__
(self, _hash_algorithms)
with_python/mac/hmac.py:52
Method__mul__
(self, other)
with_python/utils/fields.py:153
Method__mul__
(self, other)
with_python/utils/ecc/bandersnatch/fields.py:123
Method__mul__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:255
Method__mul__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:427
Method__neg__
(self)
with_python/utils/fields.py:158
Method__neg__
(self)
with_python/utils/ecc/bandersnatch/fields.py:126
Method__neg__
(self)
with_python/utils/ecc/bandersnatch/curve.py:250
Method__neg__
(self)
with_python/utils/ecc/bandersnatch/curve.py:422
Method__sub__
(self, other)
with_python/utils/fields.py:148
Method__sub__
(self, other)
with_python/utils/ecc/bandersnatch/fields.py:120
Method__sub__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:245
Method__sub__
(self, other)
with_python/utils/ecc/bandersnatch/curve.py:417
Method__truediv__
(self, other)
with_python/utils/fields.py:163
Method__truediv__
(self, other)
with_python/utils/ecc/bandersnatch/fields.py:129
Functionadd
()
with_rust/poly/src/lib.rs:235
Functionadd
()
with_rust/ff/src/lib.rs:291
Methodadd
(self, rhs: Self)
with_rust/poly/src/lib.rs:156
Methodadd
(self, rhs: Self)
with_rust/ff/src/lib.rs:181
Functionadd_assign
()
with_rust/ff/src/lib.rs:299
Methodadd_assign
(&mut self, rhs: Self)
with_rust/ff/src/lib.rs:189
Functionand_bytes
(a: bytes, b: bytes)
with_python/utils/operations.py:5
Methodassign
(self, random_letters: list[str])
with_python/ciphers/simple_substitution.py:55
Functionassignment
()
with_rust/ff/src/lib.rs:276
Functionbit_padding
According to the spec(FIPS PUB 202), section 5.1, j = (- m - 2) mod x padding = 1 concat 0 ^ j concat 1 where:
with_python/commitments/hashing/sha3/utils.py:13
Methoddecrypt
(self, word: str, letter_mapping: Dict[str, str])
with_python/ciphers/simple_substitution.py:67
Methoddecrypt
(self, _encrypted_word: str)
with_python/ciphers/polyaphabetic_cipher.py:104
Methoddecrypt
( self, random_numbers: list[int], original_xor_numbers: list[int])
with_python/ciphers/xor_and_one_time_pad.py:104
Methoddecrypt
(self, encrypted_word: str, random_numbers: list)
with_python/ciphers/one_time_pad.py:95
Methoddecrypt_sentence
(self, _encrypted_sentence: str)
with_python/ciphers/caesar_cipher.py:96
Functiondiv
()
with_rust/ff/src/lib.rs:364
Methoddiv
(self, rhs: Self)
with_rust/ff/src/lib.rs:236
← previousnext →101–200 of 275, ranked by callers