| /external/apache-commons-math/src/main/java/org/apache/commons/math/complex/ |
| ComplexUtils.java | 58 * @param r the modulus of the complex number to create
|
| /external/conscrypt/src/main/java/org/conscrypt/ |
| ChainStrengthAnalyzer.java | 74 "RSA modulus is < " + MIN_RSA_MODULUS_LEN_BITS + " bits");
|
| /external/google-tv-pairing-protocol/cpp/src/polo/pairing/ |
| polochallengeresponse.cc | 54 // modulus and exponent are concatenated along with the random nonce then a
|
| /external/libchrome/crypto/ |
| nss_key_util.cc | 57 return ScopedSECItem(PK11_MakeIDFromPubKey(&result->u.rsa.modulus));
|
| rsa_private_key_nss.cc | 119 if (!ReadAttribute(key_, CKA_MODULUS, private_key_info.modulus()) ||
|
| signature_verifier.h | 76 // (of the same length as the RSA modulus) in big-endian byte order. It
|
| /external/tpm2/ |
| CpriRSA_fp.h | 34 UINT16 keySizeInBits, // IN: Size of the public modulus in bit
|
| RSAKeySieve.c | 212 return 4; // for 3K public modulus and greater
777 TPM2B *n, // OUT: The public modulus
779 UINT16 keySizeInBits, // IN: Size of the public modulus in bits
832 // to Q and a new P is found. When both P and Q are non-zero, the modulus and
886 //Form the public modulus
890 // Save the public modulus
921 // Make sure that the number is smaller than the public modulus
|
| /external/vboot_reference/firmware/lib/cryptolib/include/ |
| rsa.h | 28 uint32_t* n; /* modulus as little endian array */
|
| /external/vboot_reference/host/lib/ |
| util_misc.c | 103 /* Write out modulus as little endian array of integers. */
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_libtomcrypt.c | 500 * k = length of modulus in octets (modlen)
634 * k = length of modulus in octets
698 const u8 *modulus, size_t modulus_len,
708 mp_read_unsigned_bin(m, (u8 *) modulus, modulus_len) != CRYPT_OK)
|
| crypto.h | 441 * @modulus: Modulus integer (big endian byte array)
442 * @modulus_len: Length of modulus integer in bytes
447 * This function calculates result = base ^ power mod modulus. modules_len is
448 * used as the maximum size of modulus buffer. It is set to the used size on
457 const u8 *modulus, size_t modulus_len,
554 * @c: Bignum; modulus
|
| /frameworks/data-binding/compiler/src/main/java/android/databinding/tool/expr/ |
| MathExpr.java | 75 return "The modulus operator (%) is not supported in two-way binding.";
|
| /libcore/ojluni/src/main/java/java/security/ |
| AlgorithmParameterGeneratorSpi.java | 42 * For example, the Sun provider uses a default modulus prime size of 1024
|
| /external/sl4a/Common/src/org/apache/commons/codec/binary/ |
| Base64Codec.java | 200 private int modulus; field in class:Base64Codec
463 switch (modulus) {
493 modulus = (++modulus) % 3;
499 if (0 == modulus) {
558 modulus = (++modulus) % 4;
560 if (modulus == 0) {
573 if (eof && modulus != 0) {
575 switch (modulus) {
[all...] |
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| int.go | 210 // Rem implements truncated modulus (like Go); see QuoRem for more details.
221 // QuoRem implements T-division and modulus (like Go):
226 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
227 // See DivMod for Euclidean division and modulus (unlike Go).
252 // Mod sets z to the modulus x%y for y != 0 and returns z.
254 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
272 // DivMod sets z to the quotient x div y and m to the modulus x mod y
276 // DivMod implements Euclidean division and modulus (unlike Go):
285 // See QuoRem for T-division and modulus (like Go).
426 // make modulus result positiv
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/ |
| int.go | 207 // Rem implements truncated modulus (like Go); see QuoRem for more details.
218 // QuoRem implements T-division and modulus (like Go):
223 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
224 // See DivMod for Euclidean division and modulus (unlike Go).
249 // Mod sets z to the modulus x%y for y != 0 and returns z.
251 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
269 // DivMod sets z to the quotient x div y and m to the modulus x mod y
273 // DivMod implements Euclidean division and modulus (unlike Go):
282 // See QuoRem for T-division and modulus (like Go).
423 // make modulus result positiv
[all...] |
| /prebuilts/go/darwin-x86/src/math/big/ |
| int.go | 207 // Rem implements truncated modulus (like Go); see QuoRem for more details.
218 // QuoRem implements T-division and modulus (like Go):
223 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
224 // See DivMod for Euclidean division and modulus (unlike Go).
249 // Mod sets z to the modulus x%y for y != 0 and returns z.
251 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
269 // DivMod sets z to the quotient x div y and m to the modulus x mod y
273 // DivMod implements Euclidean division and modulus (unlike Go):
282 // See QuoRem for T-division and modulus (like Go).
423 // make modulus result positiv
[all...] |
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| int.go | 210 // Rem implements truncated modulus (like Go); see QuoRem for more details.
221 // QuoRem implements T-division and modulus (like Go):
226 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
227 // See DivMod for Euclidean division and modulus (unlike Go).
252 // Mod sets z to the modulus x%y for y != 0 and returns z.
254 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
272 // DivMod sets z to the quotient x div y and m to the modulus x mod y
276 // DivMod implements Euclidean division and modulus (unlike Go):
285 // See QuoRem for T-division and modulus (like Go).
426 // make modulus result positiv
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/big/ |
| int.go | 207 // Rem implements truncated modulus (like Go); see QuoRem for more details.
218 // QuoRem implements T-division and modulus (like Go):
223 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
224 // See DivMod for Euclidean division and modulus (unlike Go).
249 // Mod sets z to the modulus x%y for y != 0 and returns z.
251 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
269 // DivMod sets z to the quotient x div y and m to the modulus x mod y
273 // DivMod implements Euclidean division and modulus (unlike Go):
282 // See QuoRem for T-division and modulus (like Go).
423 // make modulus result positiv
[all...] |
| /prebuilts/go/linux-x86/src/math/big/ |
| int.go | 207 // Rem implements truncated modulus (like Go); see QuoRem for more details.
218 // QuoRem implements T-division and modulus (like Go):
223 // (See Daan Leijen, ``Division and Modulus for Computer Scientists''.)
224 // See DivMod for Euclidean division and modulus (unlike Go).
249 // Mod sets z to the modulus x%y for y != 0 and returns z.
251 // Mod implements Euclidean modulus (unlike Go); see DivMod for more details.
269 // DivMod sets z to the quotient x div y and m to the modulus x mod y
273 // DivMod implements Euclidean division and modulus (unlike Go):
282 // See QuoRem for T-division and modulus (like Go).
423 // make modulus result positiv
[all...] |
| /external/wpa_supplicant_8/src/tls/ |
| pkcs1.c | 32 * k = length of modulus in octets (modlen)
151 * k = length of modulus in octets
|
| /libcore/ojluni/src/main/java/sun/util/calendar/ |
| CalendarUtils.java | 91 * the modulus remainder. For example,
114 * the modulus remainder. For example,
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/ |
| mock_object.hpp | 292 MO_BINARY_OP( %, "Modulus" )
293 MO_BINARY_OP( %=, "Modulus/assignment" )
|
| /system/tpm/trunks/ |
| tpm_utility_test.cc | 1334 std::string modulus; local
1350 std::string modulus; local
[all...] |
