rc2_cbc.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229
  1. /* crypto/rc2/rc2_cbc.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 <openssl/rc2.h>
  59. #include "rc2_locl.h"
  60. void RC2_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,
  61. RC2_KEY *ks, unsigned char *iv, int encrypt)
  62. {
  63. register unsigned long tin0, tin1;
  64. register unsigned long tout0, tout1, xor0, xor1;
  65. register long l = length;
  66. unsigned long tin[2];
  67. if (encrypt) {
  68. c2l(iv, tout0);
  69. c2l(iv, tout1);
  70. iv -= 8;
  71. for (l -= 8; l >= 0; l -= 8) {
  72. c2l(in, tin0);
  73. c2l(in, tin1);
  74. tin0 ^= tout0;
  75. tin1 ^= tout1;
  76. tin[0] = tin0;
  77. tin[1] = tin1;
  78. RC2_encrypt(tin, ks);
  79. tout0 = tin[0];
  80. l2c(tout0, out);
  81. tout1 = tin[1];
  82. l2c(tout1, out);
  83. }
  84. if (l != -8) {
  85. c2ln(in, tin0, tin1, l + 8);
  86. tin0 ^= tout0;
  87. tin1 ^= tout1;
  88. tin[0] = tin0;
  89. tin[1] = tin1;
  90. RC2_encrypt(tin, ks);
  91. tout0 = tin[0];
  92. l2c(tout0, out);
  93. tout1 = tin[1];
  94. l2c(tout1, out);
  95. }
  96. l2c(tout0, iv);
  97. l2c(tout1, iv);
  98. } else {
  99. c2l(iv, xor0);
  100. c2l(iv, xor1);
  101. iv -= 8;
  102. for (l -= 8; l >= 0; l -= 8) {
  103. c2l(in, tin0);
  104. tin[0] = tin0;
  105. c2l(in, tin1);
  106. tin[1] = tin1;
  107. RC2_decrypt(tin, ks);
  108. tout0 = tin[0] ^ xor0;
  109. tout1 = tin[1] ^ xor1;
  110. l2c(tout0, out);
  111. l2c(tout1, out);
  112. xor0 = tin0;
  113. xor1 = tin1;
  114. }
  115. if (l != -8) {
  116. c2l(in, tin0);
  117. tin[0] = tin0;
  118. c2l(in, tin1);
  119. tin[1] = tin1;
  120. RC2_decrypt(tin, ks);
  121. tout0 = tin[0] ^ xor0;
  122. tout1 = tin[1] ^ xor1;
  123. l2cn(tout0, tout1, out, l + 8);
  124. xor0 = tin0;
  125. xor1 = tin1;
  126. }
  127. l2c(xor0, iv);
  128. l2c(xor1, iv);
  129. }
  130. tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0;
  131. tin[0] = tin[1] = 0;
  132. }
  133. void RC2_encrypt(unsigned long *d, RC2_KEY *key)
  134. {
  135. int i, n;
  136. register RC2_INT *p0, *p1;
  137. register RC2_INT x0, x1, x2, x3, t;
  138. unsigned long l;
  139. l = d[0];
  140. x0 = (RC2_INT) l & 0xffff;
  141. x1 = (RC2_INT) (l >> 16L);
  142. l = d[1];
  143. x2 = (RC2_INT) l & 0xffff;
  144. x3 = (RC2_INT) (l >> 16L);
  145. n = 3;
  146. i = 5;
  147. p0 = p1 = &(key->data[0]);
  148. for (;;) {
  149. t = (x0 + (x1 & ~x3) + (x2 & x3) + *(p0++)) & 0xffff;
  150. x0 = (t << 1) | (t >> 15);
  151. t = (x1 + (x2 & ~x0) + (x3 & x0) + *(p0++)) & 0xffff;
  152. x1 = (t << 2) | (t >> 14);
  153. t = (x2 + (x3 & ~x1) + (x0 & x1) + *(p0++)) & 0xffff;
  154. x2 = (t << 3) | (t >> 13);
  155. t = (x3 + (x0 & ~x2) + (x1 & x2) + *(p0++)) & 0xffff;
  156. x3 = (t << 5) | (t >> 11);
  157. if (--i == 0) {
  158. if (--n == 0)
  159. break;
  160. i = (n == 2) ? 6 : 5;
  161. x0 += p1[x3 & 0x3f];
  162. x1 += p1[x0 & 0x3f];
  163. x2 += p1[x1 & 0x3f];
  164. x3 += p1[x2 & 0x3f];
  165. }
  166. }
  167. d[0] =
  168. (unsigned long)(x0 & 0xffff) | ((unsigned long)(x1 & 0xffff) << 16L);
  169. d[1] =
  170. (unsigned long)(x2 & 0xffff) | ((unsigned long)(x3 & 0xffff) << 16L);
  171. }
  172. void RC2_decrypt(unsigned long *d, RC2_KEY *key)
  173. {
  174. int i, n;
  175. register RC2_INT *p0, *p1;
  176. register RC2_INT x0, x1, x2, x3, t;
  177. unsigned long l;
  178. l = d[0];
  179. x0 = (RC2_INT) l & 0xffff;
  180. x1 = (RC2_INT) (l >> 16L);
  181. l = d[1];
  182. x2 = (RC2_INT) l & 0xffff;
  183. x3 = (RC2_INT) (l >> 16L);
  184. n = 3;
  185. i = 5;
  186. p0 = &(key->data[63]);
  187. p1 = &(key->data[0]);
  188. for (;;) {
  189. t = ((x3 << 11) | (x3 >> 5)) & 0xffff;
  190. x3 = (t - (x0 & ~x2) - (x1 & x2) - *(p0--)) & 0xffff;
  191. t = ((x2 << 13) | (x2 >> 3)) & 0xffff;
  192. x2 = (t - (x3 & ~x1) - (x0 & x1) - *(p0--)) & 0xffff;
  193. t = ((x1 << 14) | (x1 >> 2)) & 0xffff;
  194. x1 = (t - (x2 & ~x0) - (x3 & x0) - *(p0--)) & 0xffff;
  195. t = ((x0 << 15) | (x0 >> 1)) & 0xffff;
  196. x0 = (t - (x1 & ~x3) - (x2 & x3) - *(p0--)) & 0xffff;
  197. if (--i == 0) {
  198. if (--n == 0)
  199. break;
  200. i = (n == 2) ? 6 : 5;
  201. x3 = (x3 - p1[x2 & 0x3f]) & 0xffff;
  202. x2 = (x2 - p1[x1 & 0x3f]) & 0xffff;
  203. x1 = (x1 - p1[x0 & 0x3f]) & 0xffff;
  204. x0 = (x0 - p1[x3 & 0x3f]) & 0xffff;
  205. }
  206. }
  207. d[0] =
  208. (unsigned long)(x0 & 0xffff) | ((unsigned long)(x1 & 0xffff) << 16L);
  209. d[1] =
  210. (unsigned long)(x2 & 0xffff) | ((unsigned long)(x3 & 0xffff) << 16L);
  211. }