2
0

cfb64ede.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254
  1. /* crypto/des/cfb64ede.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 "des_locl.h"
  59. #include "e_os.h"
  60. /* The input and output encrypted as though 64bit cfb mode is being
  61. * used. The extra state information to record how much of the
  62. * 64bit block we have used is contained in *num;
  63. */
  64. void DES_ede3_cfb64_encrypt(const unsigned char *in, unsigned char *out,
  65. long length, DES_key_schedule *ks1,
  66. DES_key_schedule *ks2, DES_key_schedule *ks3,
  67. DES_cblock *ivec, int *num, int enc)
  68. {
  69. register DES_LONG v0,v1;
  70. register long l=length;
  71. register int n= *num;
  72. DES_LONG ti[2];
  73. unsigned char *iv,c,cc;
  74. iv=&(*ivec)[0];
  75. if (enc)
  76. {
  77. while (l--)
  78. {
  79. if (n == 0)
  80. {
  81. c2l(iv,v0);
  82. c2l(iv,v1);
  83. ti[0]=v0;
  84. ti[1]=v1;
  85. DES_encrypt3(ti,ks1,ks2,ks3);
  86. v0=ti[0];
  87. v1=ti[1];
  88. iv = &(*ivec)[0];
  89. l2c(v0,iv);
  90. l2c(v1,iv);
  91. iv = &(*ivec)[0];
  92. }
  93. c= *(in++)^iv[n];
  94. *(out++)=c;
  95. iv[n]=c;
  96. n=(n+1)&0x07;
  97. }
  98. }
  99. else
  100. {
  101. while (l--)
  102. {
  103. if (n == 0)
  104. {
  105. c2l(iv,v0);
  106. c2l(iv,v1);
  107. ti[0]=v0;
  108. ti[1]=v1;
  109. DES_encrypt3(ti,ks1,ks2,ks3);
  110. v0=ti[0];
  111. v1=ti[1];
  112. iv = &(*ivec)[0];
  113. l2c(v0,iv);
  114. l2c(v1,iv);
  115. iv = &(*ivec)[0];
  116. }
  117. cc= *(in++);
  118. c=iv[n];
  119. iv[n]=cc;
  120. *(out++)=c^cc;
  121. n=(n+1)&0x07;
  122. }
  123. }
  124. v0=v1=ti[0]=ti[1]=c=cc=0;
  125. *num=n;
  126. }
  127. #ifdef undef /* MACRO */
  128. void DES_ede2_cfb64_encrypt(unsigned char *in, unsigned char *out, long length,
  129. DES_key_schedule ks1, DES_key_schedule ks2, DES_cblock (*ivec),
  130. int *num, int enc)
  131. {
  132. DES_ede3_cfb64_encrypt(in,out,length,ks1,ks2,ks1,ivec,num,enc);
  133. }
  134. #endif
  135. /* This is compatible with the single key CFB-r for DES, even thought that's
  136. * not what EVP needs.
  137. */
  138. void DES_ede3_cfb_encrypt(const unsigned char *in,unsigned char *out,
  139. int numbits,long length,DES_key_schedule *ks1,
  140. DES_key_schedule *ks2,DES_key_schedule *ks3,
  141. DES_cblock *ivec,int enc)
  142. {
  143. register DES_LONG d0,d1,v0,v1;
  144. register unsigned long l=length,n=((unsigned int)numbits+7)/8;
  145. register int num=numbits,i;
  146. DES_LONG ti[2];
  147. unsigned char *iv;
  148. unsigned char ovec[16];
  149. if (num > 64) return;
  150. iv = &(*ivec)[0];
  151. c2l(iv,v0);
  152. c2l(iv,v1);
  153. if (enc)
  154. {
  155. while (l >= n)
  156. {
  157. l-=n;
  158. ti[0]=v0;
  159. ti[1]=v1;
  160. DES_encrypt3(ti,ks1,ks2,ks3);
  161. c2ln(in,d0,d1,n);
  162. in+=n;
  163. d0^=ti[0];
  164. d1^=ti[1];
  165. l2cn(d0,d1,out,n);
  166. out+=n;
  167. /* 30-08-94 - eay - changed because l>>32 and
  168. * l<<32 are bad under gcc :-( */
  169. if (num == 32)
  170. { v0=v1; v1=d0; }
  171. else if (num == 64)
  172. { v0=d0; v1=d1; }
  173. else
  174. {
  175. iv=&ovec[0];
  176. l2c(v0,iv);
  177. l2c(v1,iv);
  178. l2c(d0,iv);
  179. l2c(d1,iv);
  180. /* shift ovec left most of the bits... */
  181. memmove(ovec,ovec+num/8,8+(num%8 ? 1 : 0));
  182. /* now the remaining bits */
  183. if(num%8 != 0)
  184. for(i=0 ; i < 8 ; ++i)
  185. {
  186. ovec[i]<<=num%8;
  187. ovec[i]|=ovec[i+1]>>(8-num%8);
  188. }
  189. iv=&ovec[0];
  190. c2l(iv,v0);
  191. c2l(iv,v1);
  192. }
  193. }
  194. }
  195. else
  196. {
  197. while (l >= n)
  198. {
  199. l-=n;
  200. ti[0]=v0;
  201. ti[1]=v1;
  202. DES_encrypt3(ti,ks1,ks2,ks3);
  203. c2ln(in,d0,d1,n);
  204. in+=n;
  205. /* 30-08-94 - eay - changed because l>>32 and
  206. * l<<32 are bad under gcc :-( */
  207. if (num == 32)
  208. { v0=v1; v1=d0; }
  209. else if (num == 64)
  210. { v0=d0; v1=d1; }
  211. else
  212. {
  213. iv=&ovec[0];
  214. l2c(v0,iv);
  215. l2c(v1,iv);
  216. l2c(d0,iv);
  217. l2c(d1,iv);
  218. /* shift ovec left most of the bits... */
  219. memmove(ovec,ovec+num/8,8+(num%8 ? 1 : 0));
  220. /* now the remaining bits */
  221. if(num%8 != 0)
  222. for(i=0 ; i < 8 ; ++i)
  223. {
  224. ovec[i]<<=num%8;
  225. ovec[i]|=ovec[i+1]>>(8-num%8);
  226. }
  227. iv=&ovec[0];
  228. c2l(iv,v0);
  229. c2l(iv,v1);
  230. }
  231. d0^=ti[0];
  232. d1^=ti[1];
  233. l2cn(d0,d1,out,n);
  234. out+=n;
  235. }
  236. }
  237. iv = &(*ivec)[0];
  238. l2c(v0,iv);
  239. l2c(v1,iv);
  240. v0=v1=d0=d1=ti[0]=ti[1]=0;
  241. }