#define CIPHER_CHECK_WORD
Definition crypto_security.h:111
td_s32 rsa_inv_mod(const drv_pke_data *a, const drv_pke_data *p, const drv_pke_data *c CIPHER_CHECK_WORD)
c = ~a mod p. where a * c mod p = 1 mod p.
Definition rsa.c:507
td_s32 rsa_rrn(const td_u8 *n, const td_u32 key_size, const td_u32 aligned_len, td_u8 *rrn)
rrn = 2^(2*n_bit_len) mod n.
Definition rsa.c:92
td_s32 rsa_add_mod(const drv_pke_data *a, const drv_pke_data *b, const drv_pke_data *p, const drv_pke_data *c CIPHER_CHECK_WORD)
c = (a + b) mod p
Definition rsa.c:356
td_s32 update_rsa_modulus(const td_u8 *n, const td_u32 n_len, const td_u32 aligned_len CIPHER_CHECK_WORD)
Definition rsa.c:128
td_s32 rsa_regular_mul(const drv_pke_data *a, const drv_pke_data *b, const drv_pke_data *c)
regular multiplication. c = a * b.
td_s32 rsa_sub_mod(const drv_pke_data *a, const drv_pke_data *b, const drv_pke_data *p, const drv_pke_data *c CIPHER_CHECK_WORD)
c = (a - b) mod p. a could be smaller than b.
Definition rsa.c:399
td_s32 rsa_mod(const drv_pke_data *a, const drv_pke_data *p, const drv_pke_data *c CIPHER_CHECK_WORD)
c = a mod p.
Definition rsa.c:214
td_s32 rsa_exp_mod(const drv_pke_data *n, const drv_pke_data *k, const drv_pke_data *in, const drv_pke_data *out CIPHER_CHECK_WORD)
out = in ^ k mod n.
Definition rsa.c:558
td_s32 rsa_mul_mod(const drv_pke_data *a, const drv_pke_data *b, const drv_pke_data *p, const drv_pke_data *c CIPHER_CHECK_WORD)
c = (a * b) mod p use montgomery modular multiplication. before call this API, you should have call r...
Definition rsa.c:423
Definition crypto_pke_struct.h:74
unsigned char td_u8
Definition td_type.h:36
unsigned int td_u32
Definition td_type.h:38
int td_s32
Definition td_type.h:44