i_cbc.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  1. /* crypto/idea/i_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/idea.h>
  59. #include "idea_lcl.h"
  60. void idea_cbc_encrypt(const unsigned char *in, unsigned char *out,
  61. long length, IDEA_KEY_SCHEDULE *ks, unsigned char *iv,
  62. int encrypt)
  63. {
  64. register unsigned long tin0, tin1;
  65. register unsigned long tout0, tout1, xor0, xor1;
  66. register long l = length;
  67. unsigned long tin[2];
  68. if (encrypt) {
  69. n2l(iv, tout0);
  70. n2l(iv, tout1);
  71. iv -= 8;
  72. for (l -= 8; l >= 0; l -= 8) {
  73. n2l(in, tin0);
  74. n2l(in, tin1);
  75. tin0 ^= tout0;
  76. tin1 ^= tout1;
  77. tin[0] = tin0;
  78. tin[1] = tin1;
  79. idea_encrypt(tin, ks);
  80. tout0 = tin[0];
  81. l2n(tout0, out);
  82. tout1 = tin[1];
  83. l2n(tout1, out);
  84. }
  85. if (l != -8) {
  86. n2ln(in, tin0, tin1, l + 8);
  87. tin0 ^= tout0;
  88. tin1 ^= tout1;
  89. tin[0] = tin0;
  90. tin[1] = tin1;
  91. idea_encrypt(tin, ks);
  92. tout0 = tin[0];
  93. l2n(tout0, out);
  94. tout1 = tin[1];
  95. l2n(tout1, out);
  96. }
  97. l2n(tout0, iv);
  98. l2n(tout1, iv);
  99. } else {
  100. n2l(iv, xor0);
  101. n2l(iv, xor1);
  102. iv -= 8;
  103. for (l -= 8; l >= 0; l -= 8) {
  104. n2l(in, tin0);
  105. tin[0] = tin0;
  106. n2l(in, tin1);
  107. tin[1] = tin1;
  108. idea_encrypt(tin, ks);
  109. tout0 = tin[0] ^ xor0;
  110. tout1 = tin[1] ^ xor1;
  111. l2n(tout0, out);
  112. l2n(tout1, out);
  113. xor0 = tin0;
  114. xor1 = tin1;
  115. }
  116. if (l != -8) {
  117. n2l(in, tin0);
  118. tin[0] = tin0;
  119. n2l(in, tin1);
  120. tin[1] = tin1;
  121. idea_encrypt(tin, ks);
  122. tout0 = tin[0] ^ xor0;
  123. tout1 = tin[1] ^ xor1;
  124. l2nn(tout0, tout1, out, l + 8);
  125. xor0 = tin0;
  126. xor1 = tin1;
  127. }
  128. l2n(xor0, iv);
  129. l2n(xor1, iv);
  130. }
  131. tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0;
  132. tin[0] = tin[1] = 0;
  133. }
  134. void idea_encrypt(unsigned long *d, IDEA_KEY_SCHEDULE *key)
  135. {
  136. register IDEA_INT *p;
  137. register unsigned long x1, x2, x3, x4, t0, t1, ul;
  138. x2 = d[0];
  139. x1 = (x2 >> 16);
  140. x4 = d[1];
  141. x3 = (x4 >> 16);
  142. p = &(key->data[0][0]);
  143. E_IDEA(0);
  144. E_IDEA(1);
  145. E_IDEA(2);
  146. E_IDEA(3);
  147. E_IDEA(4);
  148. E_IDEA(5);
  149. E_IDEA(6);
  150. E_IDEA(7);
  151. x1 &= 0xffff;
  152. idea_mul(x1, x1, *p, ul);
  153. p++;
  154. t0 = x3 + *(p++);
  155. t1 = x2 + *(p++);
  156. x4 &= 0xffff;
  157. idea_mul(x4, x4, *p, ul);
  158. d[0] = (t0 & 0xffff) | ((x1 & 0xffff) << 16);
  159. d[1] = (x4 & 0xffff) | ((t1 & 0xffff) << 16);
  160. }