Searched refs:modulus (Results 1 - 10 of 10) sorted by relevance
/u-boot/drivers/crypto/fsl/ |
H A D | fsl_rsa.c | 33 pkin.n = prop->modulus; 41 flush_dcache_range((ulong)prop->modulus, (ulong)(prop->modulus) + keylen);
|
/u-boot/lib/rsa/ |
H A D | rsa-mod-exp.c | 39 * subtract_modulus() - subtract modulus from the given value 41 * @key: Key containing modulus to subtract 42 * @num: Number to subtract modulus from, as little endian word array 50 acc += (uint64_t)num[i] - key->modulus[i]; 57 * greater_equal_modulus() - check if a value is >= modulus 59 * @key: Key containing modulus to check 60 * @num: Number to check against modulus, as little endian word array 61 * Return: 0 if num < modulus, 1 if num >= modulus 69 if (num[i] < key->modulus[ [all...] |
H A D | rsa-sign.c | 627 BIGNUM *modulus, *r_squared; local 649 ret = rsa_get_params(rsa, &exponent, &n0_inv, &modulus, &r_squared); 652 bits = BN_num_bits(modulus); 697 ret = fdt_add_bignum(keydest, node, "rsa,modulus", modulus, 713 BN_free(modulus);
|
H A D | rsa-keyprop.c | 157 * on modular integers are "constant-time" (only the modulus length may 470 * We can test on the modulus bit length since we accept to 535 * result is greater than or equal to the modulus (not counting 558 * extra bit, but the result is not lower than the modulus). In 610 * The source length is at least equal to that of the modulus. 632 free((void *)prop->modulus); 668 /* modulus */ 673 (*prop)->modulus = malloc(rsa_key.n_sz - i); 674 if (!(*prop)->modulus) { 678 memcpy((void *)(*prop)->modulus, [all...] |
H A D | rsa-verify.c | 384 * only modulus and exponent as RSA key properties. 423 * information in node with prperties of RSA Key like modulus, exponent etc. 468 prop.modulus = fdt_getprop(blob, node, "rsa,modulus", NULL); 472 if (!prop.num_bits || !prop.modulus || !prop.rr) {
|
/u-boot/include/u-boot/ |
H A D | rsa-mod-exp.h | 17 * The struct has pointers to modulus (Typically called N), 24 const void *modulus; /* modulus as byte array */ member in struct:key_prop 26 uint32_t n0inv; /* -1 / modulus[0] mod 2^32 */ 57 * Operation: out[] = sig ^ exponent % modulus 61 * @node: Node with RSA key elements like modulus, exponent, R^2, n0inv 85 * Operation: out[] = sig ^ exponent % modulus 90 * @node: Node with RSA key elements like modulus, exponent,
|
H A D | rsa.h | 20 * An RSA public key consists of a modulus (typically called N), the inverse 25 uint len; /* len of modulus[] in number of uint32_t */ 26 uint32_t n0inv; /* -1 / modulus[0] mod 2^32 */ 27 uint32_t *modulus; /* modulus as little endian array */ member in struct:rsa_public_key
|
/u-boot/board/xilinx/zynq/ |
H A D | cmds.c | 50 uint len; /* Length of modulus[] in number of u32 */ 51 u32 n0inv; /* -1 / modulus[0] mod 2^32 */ 52 u32 *modulus; /* modulus as little endian array */ member in struct:zynq_rsa_public_key 89 * Calculate the inverse(-1 / modulus[0] mod 2^32 ) for the PPK 93 u32 modulus = public_key.modulus[0]; local 97 inverse = modulus & BIT(0); 100 inverse *= 2 - modulus * inverse; 227 public_key.modulus [all...] |
/u-boot/drivers/crypto/aspeed/ |
H A D | aspeed_acry.c | 74 ptr = (u8 *)prop->modulus;
|
/u-boot/board/freescale/common/ |
H A D | fsl_validate.c | 747 /* modulus most significant bit should be set */ 753 /* modulus value should be odd */ 757 /* Check signature value < modulus value */ 806 prop.modulus = img->img_key;
|
Completed in 130 milliseconds