qud_cksm.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /* crypto/des/qud_cksm.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. /* From "Message Authentication" R.R. Jueneman, S.M. Matyas, C.H. Meyer
  59. * IEEE Communications Magazine Sept 1985 Vol. 23 No. 9 p 29-40
  60. * This module in only based on the code in this paper and is
  61. * almost definitely not the same as the MIT implementation.
  62. */
  63. #include "des_locl.h"
  64. /* bug fix for dos - 7/6/91 - Larry hughes@logos.ucs.indiana.edu */
  65. #define Q_B0(a) (((DES_LONG)(a)))
  66. #define Q_B1(a) (((DES_LONG)(a))<<8)
  67. #define Q_B2(a) (((DES_LONG)(a))<<16)
  68. #define Q_B3(a) (((DES_LONG)(a))<<24)
  69. /* used to scramble things a bit */
  70. /* Got the value MIT uses via brute force :-) 2/10/90 eay */
  71. #define NOISE ((DES_LONG)83653421L)
  72. DES_LONG DES_quad_cksum(const unsigned char *input, DES_cblock output[],
  73. long length, int out_count, DES_cblock *seed)
  74. {
  75. DES_LONG z0,z1,t0,t1;
  76. int i;
  77. long l;
  78. const unsigned char *cp;
  79. #ifdef _CRAY
  80. struct lp_st { int a:32; int b:32; } *lp;
  81. #else
  82. DES_LONG *lp;
  83. #endif
  84. if (out_count < 1) out_count=1;
  85. #ifdef _CRAY
  86. lp = (struct lp_st *) &(output[0])[0];
  87. #else
  88. lp = (DES_LONG *) &(output[0])[0];
  89. #endif
  90. z0=Q_B0((*seed)[0])|Q_B1((*seed)[1])|Q_B2((*seed)[2])|Q_B3((*seed)[3]);
  91. z1=Q_B0((*seed)[4])|Q_B1((*seed)[5])|Q_B2((*seed)[6])|Q_B3((*seed)[7]);
  92. for (i=0; ((i<4)&&(i<out_count)); i++)
  93. {
  94. cp=input;
  95. l=length;
  96. while (l > 0)
  97. {
  98. if (l > 1)
  99. {
  100. t0= (DES_LONG)(*(cp++));
  101. t0|=(DES_LONG)Q_B1(*(cp++));
  102. l--;
  103. }
  104. else
  105. t0= (DES_LONG)(*(cp++));
  106. l--;
  107. /* add */
  108. t0+=z0;
  109. t0&=0xffffffffL;
  110. t1=z1;
  111. /* square, well sort of square */
  112. z0=((((t0*t0)&0xffffffffL)+((t1*t1)&0xffffffffL))
  113. &0xffffffffL)%0x7fffffffL;
  114. z1=((t0*((t1+NOISE)&0xffffffffL))&0xffffffffL)%0x7fffffffL;
  115. }
  116. if (lp != NULL)
  117. {
  118. /* The MIT library assumes that the checksum is
  119. * composed of 2*out_count 32 bit ints */
  120. #ifdef _CRAY
  121. (*lp).a = z0;
  122. (*lp).b = z1;
  123. lp++;
  124. #else
  125. *lp++ = z0;
  126. *lp++ = z1;
  127. #endif
  128. }
  129. }
  130. return(z0);
  131. }