about summary refs log tree commit diff
path: root/src/crypt/encrypt.c
diff options
context:
space:
mode:
authorTimo Teräs <timo.teras@iki.fi>2014-01-13 13:05:14 +0200
committerRich Felker <dalias@aerifal.cx>2014-02-05 11:09:53 -0500
commit16a3580ef3a27d7f1fb0f76441a973b71a35b527 (patch)
treefc156afeb849a600d2ca27bfc71ff545752c27eb /src/crypt/encrypt.c
parent73871ee3f21b13b88f2f20a39a1d9bc751bcc1df (diff)
downloadmusl-16a3580ef3a27d7f1fb0f76441a973b71a35b527.tar.gz
musl-16a3580ef3a27d7f1fb0f76441a973b71a35b527.tar.xz
musl-16a3580ef3a27d7f1fb0f76441a973b71a35b527.zip
add legacy functions setkey() and encrypt()
Diffstat (limited to 'src/crypt/encrypt.c')
-rw-r--r--src/crypt/encrypt.c60
1 files changed, 60 insertions, 0 deletions
diff --git a/src/crypt/encrypt.c b/src/crypt/encrypt.c
new file mode 100644
index 00000000..9332a6de
--- /dev/null
+++ b/src/crypt/encrypt.c
@@ -0,0 +1,60 @@
+#include <stdint.h>
+#include <stdlib.h>
+#include <unistd.h>
+
+struct expanded_key {
+        uint32_t l[16], r[16];
+};
+
+void __des_setkey(const unsigned char *key, struct expanded_key *ekey);
+void __do_des(uint32_t l_in, uint32_t r_in,
+    uint32_t *l_out, uint32_t *r_out,
+    uint32_t count, uint32_t saltbits, const struct expanded_key *ekey);
+
+
+static struct expanded_key __encrypt_key;
+
+void setkey(const char *key)
+{
+	unsigned char bkey[8];
+	int i, j;
+
+	for (i = 0; i < 8; i++) {
+		bkey[i] = 0;
+		for (j = 7; j >= 0; j--, key++)
+			bkey[i] |= (uint32_t)(*key & 1) << j;
+	}
+
+	__des_setkey(bkey, &__encrypt_key);
+}
+
+void encrypt(char *block, int edflag)
+{
+	struct expanded_key decrypt_key, *key;
+	uint32_t b[2];
+	int i, j;
+	char *p;
+
+	p = block;
+	for (i = 0; i < 2; i++) {
+		b[i] = 0;
+		for (j = 31; j >= 0; j--, p++)
+			b[i] |= (uint32_t)(*p & 1) << j;
+	}
+
+	key = &__encrypt_key;
+	if (edflag) {
+		key = &decrypt_key;
+		for (i = 0; i < 16; i++) {
+			decrypt_key.l[i] = __encrypt_key.l[15-i];
+			decrypt_key.r[i] = __encrypt_key.r[15-i];
+		}
+	}
+
+	__do_des(b[0], b[1], b, b + 1, 1, 0, key);
+
+	p = block;
+	for (i = 0; i < 2; i++)
+		for (j = 31; j >= 0; j--)
+			*p++ = b[i]>>j & 1;
+}