aboutsummaryrefslogtreecommitdiff
path: root/sand-leek.c
diff options
context:
space:
mode:
authorDavid Phillips <david@sighup.nz>2017-05-28 21:13:54 +1200
committerDavid Phillips <david@sighup.nz>2017-05-28 21:15:06 +1200
commitcd1702d70f5e5a38cfb215d0952dbfb45eb7b2a1 (patch)
treed9c040cb2c7afd05a04fe11965af929cb2a7d2e3 /sand-leek.c
parent89512e156e8eeb1637727591666e332baa7233bc (diff)
downloadsand-leek-cd1702d70f5e5a38cfb215d0952dbfb45eb7b2a1.tar.xz
Openssl-1.0 compat
Diffstat (limited to 'sand-leek.c')
-rw-r--r--sand-leek.c64
1 files changed, 1 insertions, 63 deletions
diff --git a/sand-leek.c b/sand-leek.c
index 94018a1..8de21fc 100644
--- a/sand-leek.c
+++ b/sand-leek.c
@@ -7,13 +7,13 @@
#include <errno.h>
#include <string.h>
#include <endian.h>
-#include <openssl/bn.h>
#include <openssl/rsa.h>
#include <openssl/sha.h>
#include <openssl/pem.h>
#include <openssl/err.h>
#include "onion_base32.h"
+#include "key_update.h"
#define VERSION "0.5"
@@ -40,68 +40,6 @@ static unsigned char search_raw[10];
static size_t search_len;
sem_t working;
-/* re-calculate the decryption key `d` for the given key
- * the product of e and d must be congruent to 1, and since we are messing
- * with e to generate our keys, we must re-calculate d */
-int
-key_update_d(RSA *rsa_key) {
- const BIGNUM *p = NULL;
- const BIGNUM *q = NULL;
- const BIGNUM *d = NULL;
- const BIGNUM *e = NULL;
- BIGNUM *gcd = BN_secure_new();
- BIGNUM *p1 = BN_secure_new();
- BIGNUM *q1 = BN_secure_new();
- BIGNUM *p1q1 = BN_secure_new();
- BIGNUM *lambda_n = BN_secure_new();
- BIGNUM *true_d = BN_secure_new();
- BIGNUM *true_dmp1 = BN_secure_new();
- BIGNUM *true_dmq1 = BN_secure_new();
- BIGNUM *true_iqmp = BN_secure_new();
- BN_CTX *bn_ctx = BN_CTX_secure_new();
-
- if (!(bn_ctx && gcd && p1 && q1 && p1q1 && lambda_n && true_d &&
- true_dmp1 && true_dmq1 && true_iqmp)) {
- perror("bignum or bignum context allocation");
- return 1;
- }
-
- RSA_get0_key(rsa_key, NULL, &e, &d);
- RSA_get0_factors(rsa_key, &p, &q);
-
- /* calculate p-1 and q-1 and their product */
- BN_sub(p1, p, BN_value_one());
- BN_sub(q1, q, BN_value_one());
- BN_mul(p1q1, p1, q1, bn_ctx);
-
- /* calculate LCM of p1,q1 with p1*q1/gcd(p1,q1) */
- BN_gcd(gcd, p1, q1, bn_ctx);
- BN_div(lambda_n, NULL, p1q1, gcd, bn_ctx);
-
- BN_mod_inverse(true_d, e, lambda_n, bn_ctx);
- BN_mod_inverse(true_iqmp, q, p, bn_ctx);
- BN_mod(true_dmp1, true_d, p1, bn_ctx);
- BN_mod(true_dmq1, true_d, q1, bn_ctx);
-
- /* cleanup BN structs not managed by RSA internal functions */
- BN_clear_free(gcd);
- BN_clear_free(p1);
- BN_clear_free(q1);
- BN_clear_free(p1q1);
- BN_clear_free(lambda_n);
- BN_CTX_free(bn_ctx);
-
- if (!RSA_set0_key(rsa_key, NULL, NULL, true_d)) {
- fprintf(stderr, "setting d failed\n");
- return 1;
- }
- if (!RSA_set0_crt_params(rsa_key, true_dmp1, true_dmq1, true_iqmp)) {
- fprintf(stderr, "setting crt params failed\n");
- return 1;
- }
- return 0;
-}
-
void*
work(void *arg) {
char onion[17];