Searched refs:modulus (Results 1 - 18 of 18) sorted by relevance

/osnet-11/usr/src/lib/gss_mechs/mech_dh/dh_common/
H A Dgeneric_key.c95 * the supplied modulus and root. To calculate the pair we generate
96 * a random key of the appropriate key length modulo the modulus.
98 * the public key as PublicKey = root^PrivateKey % modulus. This routine
103 char *xmodulus, /* The modulus */
115 /* Convert the modulus from a hex string to a MINT */
116 MINT *modulus = mp_xtom(xmodulus); local
152 /* We get the private keys as private key modulo the modulus */
153 mp_mdiv(sk, modulus, tmp, sk);
156 /* The public key is root^sk % modulus */
157 mp_pow(root, sk, modulus, p
250 MINT *modulus = mp_xtom(xmodulus); local
[all...]
/osnet-11/usr/src/lib/pkcs11/pkcs11_softtoken/common/
H A DsoftRSA.c51 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
53 uint32_t modulus_len = sizeof (modulus);
70 rv = soft_get_public_value(key, CKA_MODULUS, modulus, &modulus_len);
75 k.modulus = modulus;
100 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
106 uint32_t modulus_len = sizeof (modulus);
114 rv = soft_get_private_value(key, CKA_MODULUS, modulus, &modulus_len);
169 k.modulus = modulus;
245 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
334 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
531 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
649 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
829 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
987 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
1198 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
[all...]
H A DsoftFipsPostUtil.c82 uchar_t modulus[MAX_KEY_ATTR_BUFLEN]; local
83 uint32_t modulus_len = sizeof (modulus);
94 /* Get modulus length of private key. */
96 modulus, &modulus_len);
H A DsoftObject.h70 biginteger_t modulus; member in struct:rsa_pub_key
134 biginteger_t modulus; member in struct:rsa_pri_key
404 &((o)->object_class_u.public_key->key_type_u.rsa_pub_key.modulus)
406 &((k)->key_type_u.rsa_pub_key.modulus)
497 &((o)->object_class_u.private_key->key_type_u.rsa_pri_key.modulus)
499 &((k)->key_type_u.rsa_pri_key.modulus)
H A DsoftAttributeUtil.c1342 biginteger_t modulus; local
1361 (void) memset(&modulus, 0x0, sizeof (biginteger_t));
1464 rv = get_bigint_attr_from_template(&modulus,
1473 if ((modulus.big_value_len <
1475 (modulus.big_value_len >
1616 * Derive modulus_bits attribute from modulus.
1623 modulus.big_value_len)) != BIG_OK) {
1626 modulus.big_value_len)) != BIG_OK) {
1632 bytestring2bignum(&n, modulus.big_value,
1633 modulus
1918 biginteger_t modulus; local
[all...]
H A DsoftKeystore.c583 * modulus_bits + modulus_len + modulus +
648 * modulus_len + modulus + pubexpo_len + pubexpo +
786 /* modulus_len + modulus */
975 /* modulus_len + modulus */
1342 biginteger_t modulus; local
1360 (void) memset(&modulus, 0x0, sizeof (biginteger_t));
1392 /* modulus */
1393 if ((rv = soft_unpack_obj_attribute(buf, &modulus,
1397 copy_bigint_attr(&modulus, KEY_PUB_RSA_MOD(pbk));
1537 /* modulus */
[all...]
/osnet-11/usr/src/lib/libnsl/key/
H A Dgen_dhkeys.c127 MINT *modulus = mp_xtom(HEXMODULUS); local
146 mp_mdiv(sk, modulus, tmp, sk);
148 mp_pow(root, sk, modulus, pk);
157 mp_mfree(modulus);
231 * Set the modulus for all our 192bit (algtype=0) Diffie-Hellman operations
/osnet-11/usr/src/lib/pkcs11/pkcs11_kernel/common/
H A DkernelObject.h81 biginteger_t modulus; member in struct:rsa_pub_key
131 biginteger_t modulus; member in struct:rsa_pri_key
271 &((o)->object_class_u.public_key->key_type_u.rsa_pub_key.modulus)
273 &((k)->key_type_u.rsa_pub_key.modulus)
343 &((o)->object_class_u.private_key->key_type_u.rsa_pri_key.modulus)
345 &((k)->key_type_u.rsa_pri_key.modulus)
H A DkernelAttributeUtil.c1050 biginteger_t modulus; local
1063 (void) memset(&modulus, 0x0, sizeof (biginteger_t));
1158 rv = get_bigint_attr_from_template(&modulus,
1275 copy_bigint_attr(&modulus,
1289 /* set the modulus bits derived from modulus for create op */
1368 bigint_attr_cleanup(&modulus);
1434 biginteger_t modulus; local
1453 (void) memset(&modulus, 0x0, sizeof (biginteger_t));
1570 rv = get_bigint_attr_from_template(&modulus,
[all...]
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dasn1.c868 * modulus INTEGER
882 CK_ATTRIBUTE * modulus,
904 modulus->ulValueLen);
960 (CK_BYTE *)modulus + sizeof (CK_ATTRIBUTE), modulus->ulValueLen);
1051 CK_ATTRIBUTE ** modulus,
1243 *modulus = n_attr;
879 ber_encode_RSAPrivateKey(CK_BBOOL length_only, CK_BYTE ** data, CK_ULONG * data_len, CK_ATTRIBUTE * modulus, CK_ATTRIBUTE * publ_exp, CK_ATTRIBUTE * priv_exp, CK_ATTRIBUTE * prime1, CK_ATTRIBUTE * prime2, CK_ATTRIBUTE * exponent1, CK_ATTRIBUTE * exponent2, CK_ATTRIBUTE * coeff) argument
1049 ber_decode_RSAPrivateKey(CK_BYTE * data, CK_ULONG data_len, CK_ATTRIBUTE ** modulus, CK_ATTRIBUTE ** publ_exp, CK_ATTRIBUTE ** priv_exp, CK_ATTRIBUTE ** prime1, CK_ATTRIBUTE ** prime2, CK_ATTRIBUTE ** exponent1, CK_ATTRIBUTE ** exponent2, CK_ATTRIBUTE ** coeff) argument
H A Dkey.c1419 * modulus INTEGER
1435 CK_ATTRIBUTE *modulus = NULL; local
1442 if (template_attribute_find(tmpl, CKA_MODULUS, &modulus) == FALSE) {
1474 modulus, publ_exp, priv_exp, prime1, prime2,
1485 CK_ATTRIBUTE *modulus = NULL; local
1496 &modulus, &publ_exp, &priv_exp, &prime1, &prime2,
1502 (void) remove_leading_zeros(modulus);
1511 (void) template_update_attribute(tmpl, modulus);
H A Dtpm_specific.c677 * Given a modulus and prime from an RSA key, create a TSS_HKEY object by
808 * modulus and the private exponent and we need the public
829 /* get the modulus */
855 /* grab the modulus to put into the TSS key object */
2477 BYTE *buf = NULL, *modulus = NULL; local
2489 * Figure out the modulus size so we can break the data
2493 TSS_TSPATTRIB_KEYINFO_RSA_MODULUS, &modLen, &modulus))) {
2498 /* we don't need the actual modulus */
2499 Tspi_Context_FreeMemory(hContext, modulus);
2681 BYTE *dataBlob, *modulus; local
2824 BYTE *modulus; local
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A Dinteger.pm71 modulus of negative numbers, which Perl does one way, but your hardware
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Math/
H A DComplex.pm1563 axes. Mathematicians call I<rho> the I<norm> or I<modulus> and I<theta>
1594 Indeed, a negative real number can be noted C<[x,pi]> (the modulus
1751 instead. The first argument is the modulus, the second is the angle
1760 modulus must be non-negative (it represents the distance to the origin
H A DBigInt.pm1522 # modulus functions
1526 # modulus (or remainder)
1570 # prime to the modulus, calculate its inverse using Euclid's
1571 # alogrithm. If the number is not relatively prime to the modulus
1605 # large modulus, quickly, thanks to binary exponentation. supports
1611 # check modulus for valid values
2632 $x->bmod($y); # modulus (x % y)
2634 $x->bmodinv($mod); # the inverse of $x in the given modulus $mod
3071 $x->bmod($y); # modulus (x % y)
3077 Returns the inverse of C<$num> in the given modulus
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Safe/t/
H A Dopcode.pl706 modulo modulus (%) ck_null IifsT2 S S
707 i_modulo integer modulus (%) ck_null ifsT2 S S
/osnet-11/usr/src/lib/libkmf/plugins/kmf_pkcs11/common/
H A Dpkcs11_spi.c1708 CK_BYTE *modulus = NULL; local
1750 modulus = malloc(modulusLength);
1751 if (modulus == NULL)
1754 modattr[0].pValue = modulus;
1759 free(modulus);
1763 IDInput.Data = modulus;
2388 /* Get the modulus length */
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Math/BigInt/
H A DCalc.pm1877 # special modulus functions
1912 # modulus of power ($x ** $y) % $z
2067 _modinv return inverse modulus
2068 _modpow return modulus of power ($x ** $y) % $z

Completed in 76 milliseconds