encode.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445
  1. /* crypto/evp/encode.c */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young (eay@cryptsoft.com).
  7. * The implementation was written so as to conform with Netscapes SSL.
  8. *
  9. * This library is free for commercial and non-commercial use as long as
  10. * the following conditions are aheared to. The following conditions
  11. * apply to all code found in this distribution, be it the RC4, RSA,
  12. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  13. * included with this distribution is covered by the same copyright terms
  14. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15. *
  16. * Copyright remains Eric Young's, and as such any Copyright notices in
  17. * the code are not to be removed.
  18. * If this package is used in a product, Eric Young should be given attribution
  19. * as the author of the parts of the library used.
  20. * This can be in the form of a textual message at program startup or
  21. * in documentation (online or textual) provided with the package.
  22. *
  23. * Redistribution and use in source and binary forms, with or without
  24. * modification, are permitted provided that the following conditions
  25. * are met:
  26. * 1. Redistributions of source code must retain the copyright
  27. * notice, this list of conditions and the following disclaimer.
  28. * 2. Redistributions in binary form must reproduce the above copyright
  29. * notice, this list of conditions and the following disclaimer in the
  30. * documentation and/or other materials provided with the distribution.
  31. * 3. All advertising materials mentioning features or use of this software
  32. * must display the following acknowledgement:
  33. * "This product includes cryptographic software written by
  34. * Eric Young (eay@cryptsoft.com)"
  35. * The word 'cryptographic' can be left out if the rouines from the library
  36. * being used are not cryptographic related :-).
  37. * 4. If you include any Windows specific code (or a derivative thereof) from
  38. * the apps directory (application code) you must include an acknowledgement:
  39. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40. *
  41. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51. * SUCH DAMAGE.
  52. *
  53. * The licence and distribution terms for any publically available version or
  54. * derivative of this code cannot be changed. i.e. this code cannot simply be
  55. * copied and put under another distribution licence
  56. * [including the GNU Public Licence.]
  57. */
  58. #include <stdio.h>
  59. #include "cryptlib.h"
  60. #include <openssl/evp.h>
  61. #ifndef CHARSET_EBCDIC
  62. #define conv_bin2ascii(a) (data_bin2ascii[(a)&0x3f])
  63. #define conv_ascii2bin(a) (data_ascii2bin[(a)&0x7f])
  64. #else
  65. /* We assume that PEM encoded files are EBCDIC files
  66. * (i.e., printable text files). Convert them here while decoding.
  67. * When encoding, output is EBCDIC (text) format again.
  68. * (No need for conversion in the conv_bin2ascii macro, as the
  69. * underlying textstring data_bin2ascii[] is already EBCDIC)
  70. */
  71. #define conv_bin2ascii(a) (data_bin2ascii[(a)&0x3f])
  72. #define conv_ascii2bin(a) (data_ascii2bin[os_toascii[a]&0x7f])
  73. #endif
  74. /* 64 char lines
  75. * pad input with 0
  76. * left over chars are set to =
  77. * 1 byte => xx==
  78. * 2 bytes => xxx=
  79. * 3 bytes => xxxx
  80. */
  81. #define BIN_PER_LINE (64/4*3)
  82. #define CHUNKS_PER_LINE (64/4)
  83. #define CHAR_PER_LINE (64+1)
  84. static const unsigned char data_bin2ascii[65]="ABCDEFGHIJKLMNOPQRSTUVWXYZ\
  85. abcdefghijklmnopqrstuvwxyz0123456789+/";
  86. /* 0xF0 is a EOLN
  87. * 0xF1 is ignore but next needs to be 0xF0 (for \r\n processing).
  88. * 0xF2 is EOF
  89. * 0xE0 is ignore at start of line.
  90. * 0xFF is error
  91. */
  92. #define B64_EOLN 0xF0
  93. #define B64_CR 0xF1
  94. #define B64_EOF 0xF2
  95. #define B64_WS 0xE0
  96. #define B64_ERROR 0xFF
  97. #define B64_NOT_BASE64(a) (((a)|0x13) == 0xF3)
  98. static const unsigned char data_ascii2bin[128]={
  99. 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
  100. 0xFF,0xE0,0xF0,0xFF,0xFF,0xF1,0xFF,0xFF,
  101. 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
  102. 0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
  103. 0xE0,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
  104. 0xFF,0xFF,0xFF,0x3E,0xFF,0xF2,0xFF,0x3F,
  105. 0x34,0x35,0x36,0x37,0x38,0x39,0x3A,0x3B,
  106. 0x3C,0x3D,0xFF,0xFF,0xFF,0x00,0xFF,0xFF,
  107. 0xFF,0x00,0x01,0x02,0x03,0x04,0x05,0x06,
  108. 0x07,0x08,0x09,0x0A,0x0B,0x0C,0x0D,0x0E,
  109. 0x0F,0x10,0x11,0x12,0x13,0x14,0x15,0x16,
  110. 0x17,0x18,0x19,0xFF,0xFF,0xFF,0xFF,0xFF,
  111. 0xFF,0x1A,0x1B,0x1C,0x1D,0x1E,0x1F,0x20,
  112. 0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,
  113. 0x29,0x2A,0x2B,0x2C,0x2D,0x2E,0x2F,0x30,
  114. 0x31,0x32,0x33,0xFF,0xFF,0xFF,0xFF,0xFF,
  115. };
  116. void EVP_EncodeInit(EVP_ENCODE_CTX *ctx)
  117. {
  118. ctx->length=48;
  119. ctx->num=0;
  120. ctx->line_num=0;
  121. }
  122. void EVP_EncodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,
  123. const unsigned char *in, int inl)
  124. {
  125. int i,j;
  126. unsigned int total=0;
  127. *outl=0;
  128. if (inl == 0) return;
  129. OPENSSL_assert(ctx->length <= (int)sizeof(ctx->enc_data));
  130. if ((ctx->num+inl) < ctx->length)
  131. {
  132. memcpy(&(ctx->enc_data[ctx->num]),in,inl);
  133. ctx->num+=inl;
  134. return;
  135. }
  136. if (ctx->num != 0)
  137. {
  138. i=ctx->length-ctx->num;
  139. memcpy(&(ctx->enc_data[ctx->num]),in,i);
  140. in+=i;
  141. inl-=i;
  142. j=EVP_EncodeBlock(out,ctx->enc_data,ctx->length);
  143. ctx->num=0;
  144. out+=j;
  145. *(out++)='\n';
  146. *out='\0';
  147. total=j+1;
  148. }
  149. while (inl >= ctx->length)
  150. {
  151. j=EVP_EncodeBlock(out,in,ctx->length);
  152. in+=ctx->length;
  153. inl-=ctx->length;
  154. out+=j;
  155. *(out++)='\n';
  156. *out='\0';
  157. total+=j+1;
  158. }
  159. if (inl != 0)
  160. memcpy(&(ctx->enc_data[0]),in,inl);
  161. ctx->num=inl;
  162. *outl=total;
  163. }
  164. void EVP_EncodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl)
  165. {
  166. unsigned int ret=0;
  167. if (ctx->num != 0)
  168. {
  169. ret=EVP_EncodeBlock(out,ctx->enc_data,ctx->num);
  170. out[ret++]='\n';
  171. out[ret]='\0';
  172. ctx->num=0;
  173. }
  174. *outl=ret;
  175. }
  176. int EVP_EncodeBlock(unsigned char *t, const unsigned char *f, int dlen)
  177. {
  178. int i,ret=0;
  179. unsigned long l;
  180. for (i=dlen; i > 0; i-=3)
  181. {
  182. if (i >= 3)
  183. {
  184. l= (((unsigned long)f[0])<<16L)|
  185. (((unsigned long)f[1])<< 8L)|f[2];
  186. *(t++)=conv_bin2ascii(l>>18L);
  187. *(t++)=conv_bin2ascii(l>>12L);
  188. *(t++)=conv_bin2ascii(l>> 6L);
  189. *(t++)=conv_bin2ascii(l );
  190. }
  191. else
  192. {
  193. l=((unsigned long)f[0])<<16L;
  194. if (i == 2) l|=((unsigned long)f[1]<<8L);
  195. *(t++)=conv_bin2ascii(l>>18L);
  196. *(t++)=conv_bin2ascii(l>>12L);
  197. *(t++)=(i == 1)?'=':conv_bin2ascii(l>> 6L);
  198. *(t++)='=';
  199. }
  200. ret+=4;
  201. f+=3;
  202. }
  203. *t='\0';
  204. return(ret);
  205. }
  206. void EVP_DecodeInit(EVP_ENCODE_CTX *ctx)
  207. {
  208. ctx->length=30;
  209. ctx->num=0;
  210. ctx->line_num=0;
  211. ctx->expect_nl=0;
  212. }
  213. /* -1 for error
  214. * 0 for last line
  215. * 1 for full line
  216. */
  217. int EVP_DecodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,
  218. const unsigned char *in, int inl)
  219. {
  220. int seof= -1,eof=0,rv= -1,ret=0,i,v,tmp,n,ln,exp_nl;
  221. unsigned char *d;
  222. n=ctx->num;
  223. d=ctx->enc_data;
  224. ln=ctx->line_num;
  225. exp_nl=ctx->expect_nl;
  226. /* last line of input. */
  227. if ((inl == 0) || ((n == 0) && (conv_ascii2bin(in[0]) == B64_EOF)))
  228. { rv=0; goto end; }
  229. /* We parse the input data */
  230. for (i=0; i<inl; i++)
  231. {
  232. /* If the current line is > 80 characters, scream alot */
  233. if (ln >= 80) { rv= -1; goto end; }
  234. /* Get char and put it into the buffer */
  235. tmp= *(in++);
  236. v=conv_ascii2bin(tmp);
  237. /* only save the good data :-) */
  238. if (!B64_NOT_BASE64(v))
  239. {
  240. OPENSSL_assert(n < (int)sizeof(ctx->enc_data));
  241. d[n++]=tmp;
  242. ln++;
  243. }
  244. else if (v == B64_ERROR)
  245. {
  246. rv= -1;
  247. goto end;
  248. }
  249. /* have we seen a '=' which is 'definitly' the last
  250. * input line. seof will point to the character that
  251. * holds it. and eof will hold how many characters to
  252. * chop off. */
  253. if (tmp == '=')
  254. {
  255. if (seof == -1) seof=n;
  256. eof++;
  257. }
  258. if (v == B64_CR)
  259. {
  260. ln = 0;
  261. if (exp_nl)
  262. continue;
  263. }
  264. /* eoln */
  265. if (v == B64_EOLN)
  266. {
  267. ln=0;
  268. if (exp_nl)
  269. {
  270. exp_nl=0;
  271. continue;
  272. }
  273. }
  274. exp_nl=0;
  275. /* If we are at the end of input and it looks like a
  276. * line, process it. */
  277. if (((i+1) == inl) && (((n&3) == 0) || eof))
  278. {
  279. v=B64_EOF;
  280. /* In case things were given us in really small
  281. records (so two '=' were given in separate
  282. updates), eof may contain the incorrect number
  283. of ending bytes to skip, so let's redo the count */
  284. eof = 0;
  285. if (d[n-1] == '=') eof++;
  286. if (d[n-2] == '=') eof++;
  287. /* There will never be more than two '=' */
  288. }
  289. if ((v == B64_EOF && (n&3) == 0) || (n >= 64))
  290. {
  291. /* This is needed to work correctly on 64 byte input
  292. * lines. We process the line and then need to
  293. * accept the '\n' */
  294. if ((v != B64_EOF) && (n >= 64)) exp_nl=1;
  295. if (n > 0)
  296. {
  297. v=EVP_DecodeBlock(out,d,n);
  298. n=0;
  299. if (v < 0) { rv=0; goto end; }
  300. ret+=(v-eof);
  301. }
  302. else
  303. {
  304. eof=1;
  305. v=0;
  306. }
  307. /* This is the case where we have had a short
  308. * but valid input line */
  309. if ((v < ctx->length) && eof)
  310. {
  311. rv=0;
  312. goto end;
  313. }
  314. else
  315. ctx->length=v;
  316. if (seof >= 0) { rv=0; goto end; }
  317. out+=v;
  318. }
  319. }
  320. rv=1;
  321. end:
  322. *outl=ret;
  323. ctx->num=n;
  324. ctx->line_num=ln;
  325. ctx->expect_nl=exp_nl;
  326. return(rv);
  327. }
  328. int EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n)
  329. {
  330. int i,ret=0,a,b,c,d;
  331. unsigned long l;
  332. /* trim white space from the start of the line. */
  333. while ((conv_ascii2bin(*f) == B64_WS) && (n > 0))
  334. {
  335. f++;
  336. n--;
  337. }
  338. /* strip off stuff at the end of the line
  339. * ascii2bin values B64_WS, B64_EOLN, B64_EOLN and B64_EOF */
  340. while ((n > 3) && (B64_NOT_BASE64(conv_ascii2bin(f[n-1]))))
  341. n--;
  342. if (n%4 != 0) return(-1);
  343. for (i=0; i<n; i+=4)
  344. {
  345. a=conv_ascii2bin(*(f++));
  346. b=conv_ascii2bin(*(f++));
  347. c=conv_ascii2bin(*(f++));
  348. d=conv_ascii2bin(*(f++));
  349. if ( (a & 0x80) || (b & 0x80) ||
  350. (c & 0x80) || (d & 0x80))
  351. return(-1);
  352. l=( (((unsigned long)a)<<18L)|
  353. (((unsigned long)b)<<12L)|
  354. (((unsigned long)c)<< 6L)|
  355. (((unsigned long)d) ));
  356. *(t++)=(unsigned char)(l>>16L)&0xff;
  357. *(t++)=(unsigned char)(l>> 8L)&0xff;
  358. *(t++)=(unsigned char)(l )&0xff;
  359. ret+=3;
  360. }
  361. return(ret);
  362. }
  363. int EVP_DecodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl)
  364. {
  365. int i;
  366. *outl=0;
  367. if (ctx->num != 0)
  368. {
  369. i=EVP_DecodeBlock(out,ctx->enc_data,ctx->num);
  370. if (i < 0) return(-1);
  371. ctx->num=0;
  372. *outl=i;
  373. return(1);
  374. }
  375. else
  376. return(1);
  377. }
  378. #ifdef undef
  379. int EVP_DecodeValid(unsigned char *buf, int len)
  380. {
  381. int i,num=0,bad=0;
  382. if (len == 0) return(-1);
  383. while (conv_ascii2bin(*buf) == B64_WS)
  384. {
  385. buf++;
  386. len--;
  387. if (len == 0) return(-1);
  388. }
  389. for (i=len; i >= 4; i-=4)
  390. {
  391. if ( (conv_ascii2bin(buf[0]) >= 0x40) ||
  392. (conv_ascii2bin(buf[1]) >= 0x40) ||
  393. (conv_ascii2bin(buf[2]) >= 0x40) ||
  394. (conv_ascii2bin(buf[3]) >= 0x40))
  395. return(-1);
  396. buf+=4;
  397. num+=1+(buf[2] != '=')+(buf[3] != '=');
  398. }
  399. if ((i == 1) && (conv_ascii2bin(buf[0]) == B64_EOLN))
  400. return(num);
  401. if ((i == 2) && (conv_ascii2bin(buf[0]) == B64_EOLN) &&
  402. (conv_ascii2bin(buf[0]) == B64_EOLN))
  403. return(num);
  404. return(1);
  405. }
  406. #endif