| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/pkcs/ |
| RSAPrivateKeyStructure.java | 21 private BigInteger modulus; field in class:RSAPrivateKeyStructure
54 BigInteger modulus,
64 this.modulus = modulus;
86 modulus = ((ASN1Integer)e.nextElement()).getValue();
108 return modulus;
151 * modulus INTEGER, -- n
|
| /external/pdfium/xfa/src/fxbarcode/pdf417/ |
| BC_PDF417ECModulusGF.cpp | 35 CBC_PDF417ECModulusGF::CBC_PDF417ECModulusGF(int32_t modulus,
38 m_modulus = modulus;
39 m_expTable.SetSize(modulus);
40 m_logTable.SetSize(modulus);
42 for (int32_t i = 0; i < modulus; i++) {
44 x = (x * generator) % modulus;
46 for (int32_t j = 0; j < modulus - 1; j++) {
|
| BC_PDF417ECModulusGF.h | 13 CBC_PDF417ECModulusGF(int32_t modulus, int32_t generator, int32_t& e);
|
| /libcore/ojluni/src/main/java/javax/crypto/spec/ |
| DHParameterSpec.java | 57 // The prime modulus
67 * Constructs a parameter set for Diffie-Hellman, using a prime modulus
70 * @param p the prime modulus
80 * Constructs a parameter set for Diffie-Hellman, using a prime modulus
85 * @param p the prime modulus
96 * Returns the prime modulus <code>p</code>.
98 * @return the prime modulus <code>p</code>
|
| DHGenParameterSpec.java | 47 // The size in bits of the prime modulus
60 * @param primeSize the size (in bits) of the prime modulus.
69 * Returns the size in bits of the prime modulus.
71 * @return the size in bits of the prime modulus
|
| /external/conscrypt/src/main/java/org/conscrypt/ |
| OpenSSLRSAPrivateCrtKey.java | 58 BigInteger modulus = rsaKeySpec.getModulus(); local
61 if (modulus == null) {
62 throw new InvalidKeySpecException("modulus == null");
69 * OpenSSL uses the public modulus to do RSA blinding. If
70 * the public modulus is not available, the call to
82 modulus.toByteArray(),
104 BigInteger modulus = rsaPrivateKey.getModulus(); local
107 if (modulus == null) {
108 throw new InvalidKeyException("modulus == null");
115 * OpenSSL uses the public modulus to do RSA blinding. I
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| modulus_test.cpp | 35 transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, modulus<int>());
|
| /ndk/tests/device/test-stlport/unit/ |
| modulus_test.cpp | 35 transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, modulus<int>());
|
| /prebuilts/go/darwin-x86/src/math/cmplx/ |
| pow.go | 65 modulus := Abs(x)
66 if modulus == 0 {
69 r := math.Pow(modulus, real(y))
74 theta += imag(y) * math.Log(modulus)
|
| /prebuilts/go/linux-x86/src/math/cmplx/ |
| pow.go | 65 modulus := Abs(x)
66 if modulus == 0 {
69 r := math.Pow(modulus, real(y))
74 theta += imag(y) * math.Log(modulus)
|
| /external/vboot_reference/host/lib/include/ |
| util_misc.h | 25 * uint32_t modulus[nwords]; // modulus as a little endian array
|
| /external/vboot_reference/utility/ |
| dumpRSAPublicKey.c | 24 int modulus = BN_num_bits(key->n); local
31 if (modulus != 1024 && modulus != 2048 && modulus != 4096
32 && modulus != 8192) {
33 fprintf(stderr, "ERROR: Unknown modulus length = %d.\n", modulus);
97 /* Write out modulus as little endian array of integers. */
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_internal-modexp.c | 18 const u8 *modulus, size_t modulus_len,
35 bignum_set_unsigned_bin(bn_modulus, modulus, modulus_len) < 0)
|
| /frameworks/base/keystore/java/android/security/keystore/ |
| AndroidKeyStoreRSAPrivateKey.java | 32 public AndroidKeyStoreRSAPrivateKey(String alias, int uid, BigInteger modulus) {
34 mModulus = modulus;
|
| AndroidKeyStoreRSAPublicKey.java | 31 public AndroidKeyStoreRSAPublicKey(String alias, int uid, byte[] x509EncodedForm, BigInteger modulus,
34 mModulus = modulus;
|
| /libcore/ojluni/src/main/java/java/security/interfaces/ |
| RSAKey.java | 44 * Returns the modulus.
46 * @return the modulus
|
| DSAKeyPairGenerator.java | 87 * Initializes the key pair generator for a given modulus length
94 * parameters for the modulus length requested. If there are no
95 * precomputed parameters for that modulus length, an exception will be
97 * default parameters for modulus lengths of 512 and 1024 bits.
99 * @param modlen the modulus length in bits. Valid values are any
106 * the modulus length requested.
110 * there are no precomputed parameters for the requested modulus
|
| /libcore/ojluni/src/main/java/java/security/spec/ |
| RSAMultiPrimePrivateCrtKeySpec.java | 61 * given the modulus, publicExponent, privateExponent,
69 * @param modulus the modulus n.
81 * <code>modulus</code>,
89 public RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
98 super(modulus, privateExponent);
99 if (modulus == null) {
100 throw new NullPointerException("the modulus parameter must be " +
|
| RSAPrivateCrtKeySpec.java | 59 * given the modulus, publicExponent, privateExponent,
63 * @param modulus the modulus n
73 public RSAPrivateCrtKeySpec(BigInteger modulus,
81 super(modulus, privateExponent);
|
| /external/compiler-rt/lib/builtins/arm/ |
| divmodsi4.S | 1 /*===-- divmodsi4.S - 32-bit signed integer divide and modulus ------------===//
11 * modulus) function for the ARM architecture. A naive digit-by-digit
53 // Set aside the sign of the quotient and modulus, and the address for the
54 // modulus.
65 // Apply the sign of quotient and modulus
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerModPowTest.java | 32 * modPow: non-positive modulus
43 BigInteger modulus = new BigInteger(mSign, mBytes); local
45 aNumber.modPow(exp, modulus);
71 BigInteger modulus = new BigInteger(mSign, mBytes); local
72 BigInteger result = aNumber.modPow(exp, modulus);
94 BigInteger modulus = new BigInteger(mSign, mBytes); local
95 BigInteger result = aNumber.modPow(exp, modulus);
128 * modInverse: non-positive modulus
136 BigInteger modulus = new BigInteger(mSign, mBytes); local
138 aNumber.modInverse(modulus);
153 BigInteger modulus = new BigInteger(mSign, mBytes); local
171 BigInteger modulus = new BigInteger(mSign, mBytes); local
191 BigInteger modulus = new BigInteger(mSign, mBytes); local
211 BigInteger modulus = new BigInteger(mSign, mBytes); local
229 BigInteger modulus = new BigInteger(mBytes); local
[all...] |
| /external/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
| transparent.pass.cpp | 48 static_assert ( !is_transparent<std::modulus<int>>::value, "" );
49 static_assert ( !is_transparent<std::modulus<std::string>>::value, "" );
50 static_assert ( is_transparent<std::modulus<void>>::value, "" );
51 static_assert ( is_transparent<std::modulus<>>::value, "" );
|
| /external/ppp/pppd/ |
| srp-entry.8 | 32 subfield is the index of the modulus and generator from SRP's
34 well-known modulus and generator specified in the EAP SRP\-SHA1 draft.
40 Specifies the modulus/generator index in /etc/tpasswd.conf. In order
62 Indexed copies of tested modulus/generator combinations; part of the
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/arithmetic.operations/ |
| transparent.pass.cpp | 48 static_assert ( !is_transparent<std::modulus<int>>::value, "" );
49 static_assert ( !is_transparent<std::modulus<std::string>>::value, "" );
50 static_assert ( is_transparent<std::modulus<void>>::value, "" );
51 static_assert ( is_transparent<std::modulus<>>::value, "" );
|
| /libcore/luni/src/test/java/tests/security/interfaces/ |
| RSAKeyTest.java | 44 assertEquals("invalid modulus", n, key.getModulus());
48 assertEquals("invalid modulus", n, key.getModulus());
|
