Mercurial > dropbear
comparison libtomcrypt/src/encauth/ocb/ocb_init.c @ 297:79bf1023cf11 agent-client
propagate from branch 'au.asn.ucc.matt.dropbear' (head 0501e6f661b5415eb76f3b312d183c3adfbfb712)
to branch 'au.asn.ucc.matt.dropbear.cli-agent' (head 01038174ec27245b51bd43a66c01ad930880f67b)
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Tue, 21 Mar 2006 16:20:59 +0000 |
parents | 1b9e69c058d2 |
children | 0cbe8f6dbf9e |
comparison
equal
deleted
inserted
replaced
225:ca7e76d981d9 | 297:79bf1023cf11 |
---|---|
1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis | |
2 * | |
3 * LibTomCrypt is a library that provides various cryptographic | |
4 * algorithms in a highly modular and flexible manner. | |
5 * | |
6 * The library is free for all purposes without any express | |
7 * guarantee it works. | |
8 * | |
9 * Tom St Denis, [email protected], http://libtomcrypt.org | |
10 */ | |
11 | |
12 /** | |
13 @file ocb_init.c | |
14 OCB implementation, initialize state, by Tom St Denis | |
15 */ | |
16 #include "tomcrypt.h" | |
17 | |
18 #ifdef OCB_MODE | |
19 | |
20 static const struct { | |
21 int len; | |
22 unsigned char poly_div[MAXBLOCKSIZE], | |
23 poly_mul[MAXBLOCKSIZE]; | |
24 } polys[] = { | |
25 { | |
26 8, | |
27 { 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0D }, | |
28 { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x1B } | |
29 }, { | |
30 16, | |
31 { 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
32 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x43 }, | |
33 { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
34 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x87 } | |
35 } | |
36 }; | |
37 | |
38 /** | |
39 Initialize an OCB context. | |
40 @param ocb [out] The destination of the OCB state | |
41 @param cipher The index of the desired cipher | |
42 @param key The secret key | |
43 @param keylen The length of the secret key (octets) | |
44 @param nonce The session nonce (length of the block size of the cipher) | |
45 @return CRYPT_OK if successful | |
46 */ | |
47 int ocb_init(ocb_state *ocb, int cipher, | |
48 const unsigned char *key, unsigned long keylen, const unsigned char *nonce) | |
49 { | |
50 int poly, x, y, m, err; | |
51 | |
52 LTC_ARGCHK(ocb != NULL); | |
53 LTC_ARGCHK(key != NULL); | |
54 LTC_ARGCHK(nonce != NULL); | |
55 | |
56 /* valid cipher? */ | |
57 if ((err = cipher_is_valid(cipher)) != CRYPT_OK) { | |
58 return err; | |
59 } | |
60 | |
61 /* determine which polys to use */ | |
62 ocb->block_len = cipher_descriptor[cipher].block_length; | |
63 for (poly = 0; poly < (int)(sizeof(polys)/sizeof(polys[0])); poly++) { | |
64 if (polys[poly].len == ocb->block_len) { | |
65 break; | |
66 } | |
67 } | |
68 if (polys[poly].len != ocb->block_len) { | |
69 return CRYPT_INVALID_ARG; | |
70 } | |
71 | |
72 /* schedule the key */ | |
73 if ((err = cipher_descriptor[cipher].setup(key, keylen, 0, &ocb->key)) != CRYPT_OK) { | |
74 return err; | |
75 } | |
76 | |
77 /* find L = E[0] */ | |
78 zeromem(ocb->L, ocb->block_len); | |
79 cipher_descriptor[cipher].ecb_encrypt(ocb->L, ocb->L, &ocb->key); | |
80 | |
81 /* find R = E[N xor L] */ | |
82 for (x = 0; x < ocb->block_len; x++) { | |
83 ocb->R[x] = ocb->L[x] ^ nonce[x]; | |
84 } | |
85 cipher_descriptor[cipher].ecb_encrypt(ocb->R, ocb->R, &ocb->key); | |
86 | |
87 /* find Ls[i] = L << i for i == 0..31 */ | |
88 XMEMCPY(ocb->Ls[0], ocb->L, ocb->block_len); | |
89 for (x = 1; x < 32; x++) { | |
90 m = ocb->Ls[x-1][0] >> 7; | |
91 for (y = 0; y < ocb->block_len-1; y++) { | |
92 ocb->Ls[x][y] = ((ocb->Ls[x-1][y] << 1) | (ocb->Ls[x-1][y+1] >> 7)) & 255; | |
93 } | |
94 ocb->Ls[x][ocb->block_len-1] = (ocb->Ls[x-1][ocb->block_len-1] << 1) & 255; | |
95 | |
96 if (m == 1) { | |
97 for (y = 0; y < ocb->block_len; y++) { | |
98 ocb->Ls[x][y] ^= polys[poly].poly_mul[y]; | |
99 } | |
100 } | |
101 } | |
102 | |
103 /* find Lr = L / x */ | |
104 m = ocb->L[ocb->block_len-1] & 1; | |
105 | |
106 /* shift right */ | |
107 for (x = ocb->block_len - 1; x > 0; x--) { | |
108 ocb->Lr[x] = ((ocb->L[x] >> 1) | (ocb->L[x-1] << 7)) & 255; | |
109 } | |
110 ocb->Lr[0] = ocb->L[0] >> 1; | |
111 | |
112 if (m == 1) { | |
113 for (x = 0; x < ocb->block_len; x++) { | |
114 ocb->Lr[x] ^= polys[poly].poly_div[x]; | |
115 } | |
116 } | |
117 | |
118 /* set Li, checksum */ | |
119 zeromem(ocb->Li, ocb->block_len); | |
120 zeromem(ocb->checksum, ocb->block_len); | |
121 | |
122 /* set other params */ | |
123 ocb->block_index = 1; | |
124 ocb->cipher = cipher; | |
125 | |
126 return CRYPT_OK; | |
127 } | |
128 | |
129 #endif | |
130 | |
131 /* $Source: /cvs/libtom/libtomcrypt/src/encauth/ocb/ocb_init.c,v $ */ | |
132 /* $Revision: 1.3 $ */ | |
133 /* $Date: 2005/05/05 14:35:58 $ */ |