/dports/security/pidgin-encryption/pidgin-encryption-3.1/ |
H A D | nss_pss.c | 52 unsigned char* m_prime; in pss_generate_sig() local 74 m_prime = PORT_Alloc(8 + hlen + salt_len); in pss_generate_sig() 75 g_assert(m_prime != 0); in pss_generate_sig() 78 PORT_Memset(m_prime, 0, 8); in pss_generate_sig() 91 PORT_Free(m_prime); in pss_generate_sig() 114 unsigned char* m_prime; in pss_check_sig() local 151 m_prime = PORT_Alloc(8 + hlen + salt_len); in pss_check_sig() 152 g_assert(m_prime != 0); in pss_check_sig() 155 PORT_Memset(m_prime, 0, 8); in pss_check_sig() 166 g_assert(m_prime != 0); in pss_check_sig() [all …]
|
/dports/science/cdk/cdk-cdk-2.3/base/isomorphism/src/main/java/org/openscience/cdk/isomorphism/ |
H A D | VFState.java | 115 int m_prime = m1[n_prime]; in feasible() local 118 if (m_prime != UNMAPPED) { in feasible() 119 IBond bond2 = bonds2.get(m, m_prime); in feasible() 134 for (int m_prime : g2[m]) { in feasible() 135 int n_prime = m2[m_prime]; in feasible() 142 if (!bondMatcher.matches(bond1, bonds2.get(m, m_prime))) return false; in feasible() 144 if (t2[m_prime] > 0) in feasible()
|
H A D | VFSubState.java | 125 int m_prime = m1[n_prime]; in feasible() local 128 if (m_prime != UNMAPPED) { in feasible() 129 IBond bond2 = bonds2.get(m, m_prime); in feasible() 144 for (int m_prime : g2[m]) { in feasible() 145 if (m2[m_prime] == UNMAPPED) { in feasible() 146 if (t2[m_prime] > 0) in feasible()
|
H A D | UllmannState.java | 208 for (int m_prime : g2[m]) { in verify() 209 …if (matrix.get(n_prime, m_prime) && bondMatcher.matches(bond1.get(n, n_prime), bonds2.get(m, m_pri… in verify()
|
/dports/math/e-antic/flint2-ae7ec89/ |
H A D | fq_embed.h | 32 FQ_EMBED_INLINE void fq_modulus_derivative_inv(fq_t m_prime, in fq_modulus_derivative_inv() argument 40 fmpz_poly_fit_length(m_prime, tmp->length); in fq_modulus_derivative_inv() 41 _fmpz_vec_set(m_prime->coeffs, tmp->coeffs, tmp->length); in fq_modulus_derivative_inv() 42 _fmpz_poly_set_length(m_prime, tmp->length); in fq_modulus_derivative_inv() 44 fq_inv(m_prime_inv, m_prime, ctx); in fq_modulus_derivative_inv()
|
H A D | fq_nmod_embed.h | 31 FQ_NMOD_EMBED_INLINE void fq_nmod_modulus_derivative_inv(fq_nmod_t m_prime, in fq_nmod_modulus_derivative_inv() argument 35 nmod_poly_derivative(m_prime, fq_nmod_ctx_modulus(ctx)); in fq_nmod_modulus_derivative_inv() 36 fq_nmod_inv(m_prime_inv, m_prime, ctx); in fq_nmod_modulus_derivative_inv()
|
H A D | fq_zech_embed.h | 32 FQ_ZECH_EMBED_INLINE void fq_zech_modulus_derivative_inv(fq_zech_t m_prime, in fq_zech_modulus_derivative_inv() argument 42 fq_zech_set_fq_nmod(m_prime, m_nmod, ctx); in fq_zech_modulus_derivative_inv()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ |
H A D | fq_embed.h | 32 FQ_EMBED_INLINE void fq_modulus_derivative_inv(fq_t m_prime, in fq_modulus_derivative_inv() argument 40 fmpz_poly_fit_length(m_prime, tmp->length); in fq_modulus_derivative_inv() 41 _fmpz_vec_set(m_prime->coeffs, tmp->coeffs, tmp->length); in fq_modulus_derivative_inv() 42 _fmpz_poly_set_length(m_prime, tmp->length); in fq_modulus_derivative_inv() 44 fq_inv(m_prime_inv, m_prime, ctx); in fq_modulus_derivative_inv()
|
H A D | fq_nmod_embed.h | 31 FQ_NMOD_EMBED_INLINE void fq_nmod_modulus_derivative_inv(fq_nmod_t m_prime, in fq_nmod_modulus_derivative_inv() argument 35 nmod_poly_derivative(m_prime, fq_nmod_ctx_modulus(ctx)); in fq_nmod_modulus_derivative_inv() 36 fq_nmod_inv(m_prime_inv, m_prime, ctx); in fq_nmod_modulus_derivative_inv()
|
H A D | fq_zech_embed.h | 32 FQ_ZECH_EMBED_INLINE void fq_zech_modulus_derivative_inv(fq_zech_t m_prime, in fq_zech_modulus_derivative_inv() argument 42 fq_zech_set_fq_nmod(m_prime, m_nmod, ctx); in fq_zech_modulus_derivative_inv()
|
/dports/math/flint2/flint-2.8.4/ |
H A D | fq_embed.h | 41 FQ_EMBED_INLINE void fq_modulus_derivative_inv(fq_t m_prime, in fq_modulus_derivative_inv() argument 49 fmpz_poly_fit_length(m_prime, tmp->length); in fq_modulus_derivative_inv() 50 _fmpz_vec_set(m_prime->coeffs, tmp->coeffs, tmp->length); in fq_modulus_derivative_inv() 51 _fmpz_poly_set_length(m_prime, tmp->length); in fq_modulus_derivative_inv() 53 fq_inv(m_prime_inv, m_prime, ctx); in fq_modulus_derivative_inv()
|
H A D | fq_nmod_embed.h | 43 FQ_NMOD_EMBED_INLINE void fq_nmod_modulus_derivative_inv(fq_nmod_t m_prime, in fq_nmod_modulus_derivative_inv() argument 47 nmod_poly_derivative(m_prime, fq_nmod_ctx_modulus(ctx)); in fq_nmod_modulus_derivative_inv() 48 fq_nmod_inv(m_prime_inv, m_prime, ctx); in fq_nmod_modulus_derivative_inv()
|
H A D | fq_zech_embed.h | 44 FQ_ZECH_EMBED_INLINE void fq_zech_modulus_derivative_inv(fq_zech_t m_prime, in fq_zech_modulus_derivative_inv() argument 54 fq_zech_set_fq_nmod(m_prime, m_nmod, ctx); in fq_zech_modulus_derivative_inv()
|
/dports/cad/openroad/OpenROAD-2.0/src/OpenDB/include/opendb/ |
H A D | util.h | 379 unsigned int m_prime; variable 384 m_prime = l_find_largest_prime_below_number(size); 385 m_data = new AthList<t_elem>[m_prime]; 393 for (i = 0; i < m_prime; i++) { in ~AthHash() 406 unsigned int hash_val = hashFunction(key, strlen(key), m_prime); in add() 420 unsigned int hash_val = hashFunction(key, strlen(key), m_prime); in get() 446 assert(m_first_level_idx < m_ptr_to_hash->m_prime); in next() 454 if (m_first_level_idx >= m_ptr_to_hash->m_prime) in end() 456 if (m_first_level_idx < m_ptr_to_hash->m_prime - 1) in end() 470 for (i = 0; i < m_prime; i++) { in start()
|
/dports/math/lcalc/lcalc-1.23/src/ |
H A D | Lcommandline_twist.cc | 577 Long m_prime, v_prime; in all_twists() local 770 for(m_prime=0;m_prime<loop1;m_prime++) in all_twists() 787 if(factors[0][1]>2) if(m_prime%2==0) is_primitive=false; in all_twists() 804 else if(m_prime>(loop1)/2) is_fresh=false; in all_twists() 878 if(m_prime%2==0){ in all_twists() 880 if(m[0]==0&&m_prime==0)q_1=q_1/(4*loop1); //strip powers of 2 in all_twists() 881 else q_1=q_1/gcd(m_prime,loop1); in all_twists() 886 z=exp(2*Double(m_prime)*I*Pi/Double(loop1)); in all_twists() 899 if(m[0]!=0||m_prime!=0)chi_1[a]=chi_1[a]*u; in all_twists() 1117 if(twist_type==-1){M=PHI;m[0]=loop2;m_prime=loop1;} in all_twists() [all …]
|
H A D | Lcommandline_numbertheory.cc | 731 int m_prime, v_prime; in characters() local 789 for(m_prime=0;m_prime<loop1;m_prime++) in characters() 857 if(m_prime%2==0){ in characters() 859 if(m[0]==0&&m_prime==0)q_1=q_1/(4*loop1); //strip powers of 2 in characters() 860 else q_1=q_1/gcd(m_prime,loop1); in characters() 865 z=exp(2.*m_prime*I*Pi/(1.*loop1)); in characters() 878 if(m[0]!=0||m_prime!=0)chi_1[a]=chi_1[a]*u; in characters() 893 cout << m_prime << " "; in characters()
|
/dports/security/s2n/s2n-tls-1.1.2/pq-crypto/bike_r3/ |
H A D | bike_r3_kem.c | 237 DEFER_CLEANUP(m_t m_prime, m_cleanup); in BIKE_L1_R3_crypto_kem_dec() 266 POSIX_GUARD(reencrypt(&m_prime, &e_prime, &l_ct)); in BIKE_L1_R3_crypto_kem_dec() 270 POSIX_GUARD(function_h(&e_tmp, &m_prime)); in BIKE_L1_R3_crypto_kem_dec() 277 m_prime.raw[i] &= u8_barrier(~mask); in BIKE_L1_R3_crypto_kem_dec() 278 m_prime.raw[i] |= (u8_barrier(mask) & l_sk.sigma.raw[i]); in BIKE_L1_R3_crypto_kem_dec() 282 POSIX_GUARD(function_k(&l_ss, &m_prime, &l_ct)); in BIKE_L1_R3_crypto_kem_dec()
|
/dports/security/liboqs/liboqs-0.7.0/src/kem/bike/additional_r3/ |
H A D | kem.c | 235 DEFER_CLEANUP(m_t m_prime, m_cleanup); in decaps() 264 GUARD(reencrypt(&m_prime, &e_prime, &l_ct)); in decaps() 268 GUARD(function_h(&e_tmp, &m_prime)); in decaps() 275 m_prime.raw[i] &= u8_barrier(~mask); in decaps() 276 m_prime.raw[i] |= (u8_barrier(mask) & l_sk.sigma.raw[i]); in decaps() 280 GUARD(function_k(&l_ss, &m_prime, &l_ct)); in decaps()
|
/dports/security/py-pycryptodomex/pycryptodome-3.10.1/lib/Crypto/Signature/ |
H A D | pss.py | 237 m_prime = bchr(0)*8 + mhash.digest() + salt 240 h.update(m_prime) 319 m_prime = bchr(0)*8 + mhash.digest() + salt 322 hobj.update(m_prime)
|
/dports/security/py-pycryptodome/pycryptodome-3.10.1/lib/Crypto/Signature/ |
H A D | pss.py | 237 m_prime = bchr(0)*8 + mhash.digest() + salt 240 h.update(m_prime) 319 m_prime = bchr(0)*8 + mhash.digest() + salt 322 hobj.update(m_prime)
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/features/include/pcl/features/ |
H A D | normal_based_signature.h | 128 setMPrime (std::size_t m_prime) { M_prime_ = m_prime; } in setMPrime() argument
|
/dports/math/e-antic/flint2-ae7ec89/doc/source/ |
H A D | fq_embed.rst | 110 .. function:: void fq_modulus_derivative_inv(fq_t m_prime, fq_t m_prime_inv, const fq_ctx_t ctx) 112 Compute the derivative ``m_prime`` of the modulus of ``ctx``
|
H A D | fq_nmod_embed.rst | 110 .. function:: void fq_nmod_modulus_derivative_inv(fq_nmod_t m_prime, fq_nmod_t m_prime_inv, const f… 112 Compute the derivative ``m_prime`` of the modulus of ``ctx``
|
H A D | fq_zech_embed.rst | 110 .. function:: void fq_zech_modulus_derivative_inv(fq_zech_t m_prime, fq_zech_t m_prime_inv, const f… 112 Compute the derivative ``m_prime`` of the modulus of ``ctx``
|
/dports/math/flint2/flint-2.8.4/doc/source/ |
H A D | fq_embed.rst | 110 .. function:: void fq_modulus_derivative_inv(fq_t m_prime, fq_t m_prime_inv, const fq_ctx_t ctx) 112 Compute the derivative ``m_prime`` of the modulus of ``ctx``
|