Home
last modified time | relevance | path

Searched refs:polymod (Results 1 – 25 of 88) sorted by relevance

1234

/dports/net-p2p/c-lightning/lightning-0.10.2/common/
H A Ddescriptor_checksum.c21 static u64 polymod(u64 c, int val) in polymod() function
53 c = polymod(c, pos & 31); in descriptor_checksum()
59 c = polymod(c, cls); in descriptor_checksum()
66 c = polymod(c, cls); in descriptor_checksum()
70 c = polymod(c, 0); in descriptor_checksum()
/dports/www/firefox/firefox-99.0/third_party/python/ecdsa/ecdsa/
H A Dnumbertheory.py60 def polynomial_reduce_mod(poly, polymod, p): argument
70 assert polymod[-1] == 1
72 assert len(polymod) > 1
74 while len(poly) >= len(polymod):
76 for i in xrange(2, len(polymod) + 1):
77 poly[-i] = (poly[-i] - poly[-1] * polymod[-i]) % p
83 def polynomial_multiply_mod(m1, m2, polymod, p): argument
104 return polynomial_reduce_mod(prod, polymod, p)
107 def polynomial_exp_mod(base, exponent, polymod, p): argument
132 G = polynomial_multiply_mod(G, G, polymod, p)
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/python/ecdsa/ecdsa/
H A Dnumbertheory.py60 def polynomial_reduce_mod(poly, polymod, p): argument
70 assert polymod[-1] == 1
72 assert len(polymod) > 1
74 while len(poly) >= len(polymod):
76 for i in xrange(2, len(polymod) + 1):
77 poly[-i] = (poly[-i] - poly[-1] * polymod[-i]) % p
83 def polynomial_multiply_mod(m1, m2, polymod, p): argument
104 return polynomial_reduce_mod(prod, polymod, p)
107 def polynomial_exp_mod(base, exponent, polymod, p): argument
132 G = polynomial_multiply_mod(G, G, polymod, p)
[all …]
/dports/security/py-ecdsa/ecdsa-0.16.0/src/ecdsa/
H A Dnumbertheory.py68 def polynomial_reduce_mod(poly, polymod, p): argument
78 assert polymod[-1] == 1
80 assert len(polymod) > 1
82 while len(poly) >= len(polymod):
84 for i in xrange(2, len(polymod) + 1):
85 poly[-i] = (poly[-i] - poly[-1] * polymod[-i]) % p
91 def polynomial_multiply_mod(m1, m2, polymod, p): argument
112 return polynomial_reduce_mod(prod, polymod, p)
115 def polynomial_exp_mod(base, exponent, polymod, p): argument
140 G = polynomial_multiply_mod(G, G, polymod, p)
[all …]
/dports/www/firefox-esr/firefox-91.8.0/third_party/python/ecdsa/ecdsa/
H A Dnumbertheory.py60 def polynomial_reduce_mod(poly, polymod, p): argument
70 assert polymod[-1] == 1
72 assert len(polymod) > 1
74 while len(poly) >= len(polymod):
76 for i in xrange(2, len(polymod) + 1):
77 poly[-i] = (poly[-i] - poly[-1] * polymod[-i]) % p
83 def polynomial_multiply_mod(m1, m2, polymod, p): argument
104 return polynomial_reduce_mod(prod, polymod, p)
107 def polynomial_exp_mod(base, exponent, polymod, p): argument
132 G = polynomial_multiply_mod(G, G, polymod, p)
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/python/ecdsa/src/ecdsa/
H A Dnumbertheory.py60 def polynomial_reduce_mod(poly, polymod, p): argument
70 assert polymod[-1] == 1
72 assert len(polymod) > 1
74 while len(poly) >= len(polymod):
76 for i in xrange(2, len(polymod) + 1):
77 poly[-i] = (poly[-i] - poly[-1] * polymod[-i]) % p
83 def polynomial_multiply_mod(m1, m2, polymod, p): argument
104 return polynomial_reduce_mod(prod, polymod, p)
107 def polynomial_exp_mod(base, exponent, polymod, p): argument
132 G = polynomial_multiply_mod(G, G, polymod, p)
[all …]
/dports/math/p5-Math-Pari/pari-2.3.5/src/functions/number_fields/
H A Dmodreverse5 Help: modreverse(x): reverse polymod of the polymod x, if it exists
/dports/net/rclone/rclone-1.57.0/vendor/github.com/btcsuite/btcutil/bech32/
H A Dbech32.go127 polymod := bech32Polymod(hrp, data, nil) ^ 1
129 b := byte((polymod >> uint(5*(5-i))) & 31)
148 polymod := bech32Polymod(hrp, values, checksum)
149 return polymod == 1
/dports/net/storj/storj-1.45.3/vendor/github.com/btcsuite/btcutil/bech32/
H A Dbech32.go127 polymod := bech32Polymod(hrp, data, nil) ^ 1
129 b := byte((polymod >> uint(5*(5-i))) & 31)
148 polymod := bech32Polymod(hrp, values, checksum)
149 return polymod == 1
/dports/net-mgmt/seafile-client/seafile-7.0.9/common/cdc/
H A Drabin-checksum.c82 u_int64_t polymod (u_int64_t nh, u_int64_t nl, u_int64_t d) in polymod() function
128 return polymod (h, l, d); in polymmult()
141 u_int64_t T1 = polymod (0, INT64 (1) << xshift, poly); in calcT()
/dports/net-mgmt/seafile-server/seafile-server-8.0.7-server/common/cdc/
H A Drabin-checksum.c82 u_int64_t polymod (u_int64_t nh, u_int64_t nl, u_int64_t d) in polymod() function
128 return polymod (h, l, d); in polymmult()
141 u_int64_t T1 = polymod (0, INT64 (1) << xshift, poly); in calcT()
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/filippo.io/age/internal/bech32/
H A Dbech32.go34 func polymod(values []byte) uint32 { func
64 return polymod(append(hrpExpand(hrp), data...)) == 1
70 mod := polymod(values) ^ 1
/dports/security/gopass/gopass-1.13.0/vendor/filippo.io/age/internal/bech32/
H A Dbech32.go34 func polymod(values []byte) uint32 { func
64 return polymod(append(hrpExpand(hrp), data...)) == 1
70 mod := polymod(values) ^ 1
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/filippo.io/age/internal/bech32/
H A Dbech32.go34 func polymod(values []byte) uint32 { func
64 return polymod(append(hrpExpand(hrp), data...)) == 1
70 mod := polymod(values) ^ 1
/dports/net-p2p/litecoin-daemon/litecoin-0.18.1/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/litecoin/litecoin-0.18.1/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/litecoin-utils/litecoin-0.18.1/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/finance/py-pycoin/pycoin-0.91.20210515/pycoin/contrib/
H A Dsegwit_addr.py52 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
53 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/namecoin-utils/namecoin-core-nc0.21.0.1/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/namecoin-daemon/namecoin-core-nc0.21.0.1/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/namecoin/namecoin-core-nc0.21.0.1/test/functional/test_framework/
H A Dsegwit_addr.py36 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
37 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/finance/py-python-bitcoinlib/python-bitcoinlib-0.11.0/bitcoin/
H A Dsegwit_addr.py59 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ 1
60 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]
/dports/net-p2p/c-lightning/lightning-0.10.2/contrib/pyln-proto/pyln/proto/
H A Dbech32.py53 polymod = bech32_polymod(values + bytes([0, 0, 0, 0, 0, 0])) ^ 1
54 return bytes([(polymod >> 5 * (5 - i)) & 31 for i in range(6)])
/dports/net-p2p/bitcoin/bitcoin-22.0/test/functional/test_framework/
H A Dsegwit_addr.py50 polymod = bech32_polymod(values + [0, 0, 0, 0, 0, 0]) ^ const
51 return [(polymod >> 5 * (5 - i)) & 31 for i in range(6)]

1234