sha2_large_common.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141
  1. /* sha2_large_common.c */
  2. /*
  3. This file is part of the ARM-Crypto-Lib.
  4. Copyright (C) 2006-2011 Daniel Otte (daniel.otte@rub.de)
  5. This program is free software: you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation, either version 3 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>.
  15. */
  16. #include <stdint.h>
  17. #include <string.h>
  18. #include <crypto/sha2_large_common.h>
  19. static const
  20. uint64_t sha2_large_common_const[80] = {
  21. 0x428a2f98d728ae22LL, 0x7137449123ef65cdLL, 0xb5c0fbcfec4d3b2fLL, 0xe9b5dba58189dbbcLL,
  22. 0x3956c25bf348b538LL, 0x59f111f1b605d019LL, 0x923f82a4af194f9bLL, 0xab1c5ed5da6d8118LL,
  23. 0xd807aa98a3030242LL, 0x12835b0145706fbeLL, 0x243185be4ee4b28cLL, 0x550c7dc3d5ffb4e2LL,
  24. 0x72be5d74f27b896fLL, 0x80deb1fe3b1696b1LL, 0x9bdc06a725c71235LL, 0xc19bf174cf692694LL,
  25. 0xe49b69c19ef14ad2LL, 0xefbe4786384f25e3LL, 0x0fc19dc68b8cd5b5LL, 0x240ca1cc77ac9c65LL,
  26. 0x2de92c6f592b0275LL, 0x4a7484aa6ea6e483LL, 0x5cb0a9dcbd41fbd4LL, 0x76f988da831153b5LL,
  27. 0x983e5152ee66dfabLL, 0xa831c66d2db43210LL, 0xb00327c898fb213fLL, 0xbf597fc7beef0ee4LL,
  28. 0xc6e00bf33da88fc2LL, 0xd5a79147930aa725LL, 0x06ca6351e003826fLL, 0x142929670a0e6e70LL,
  29. 0x27b70a8546d22ffcLL, 0x2e1b21385c26c926LL, 0x4d2c6dfc5ac42aedLL, 0x53380d139d95b3dfLL,
  30. 0x650a73548baf63deLL, 0x766a0abb3c77b2a8LL, 0x81c2c92e47edaee6LL, 0x92722c851482353bLL,
  31. 0xa2bfe8a14cf10364LL, 0xa81a664bbc423001LL, 0xc24b8b70d0f89791LL, 0xc76c51a30654be30LL,
  32. 0xd192e819d6ef5218LL, 0xd69906245565a910LL, 0xf40e35855771202aLL, 0x106aa07032bbd1b8LL,
  33. 0x19a4c116b8d2d0c8LL, 0x1e376c085141ab53LL, 0x2748774cdf8eeb99LL, 0x34b0bcb5e19b48a8LL,
  34. 0x391c0cb3c5c95a63LL, 0x4ed8aa4ae3418acbLL, 0x5b9cca4f7763e373LL, 0x682e6ff3d6b2b8a3LL,
  35. 0x748f82ee5defb2fcLL, 0x78a5636f43172f60LL, 0x84c87814a1f0ab72LL, 0x8cc702081a6439ecLL,
  36. 0x90befffa23631e28LL, 0xa4506cebde82bde9LL, 0xbef9a3f7b2c67915LL, 0xc67178f2e372532bLL,
  37. 0xca273eceea26619cLL, 0xd186b8c721c0c207LL, 0xeada7dd6cde0eb1eLL, 0xf57d4f7fee6ed178LL,
  38. 0x06f067aa72176fbaLL, 0x0a637dc5a2c898a6LL, 0x113f9804bef90daeLL, 0x1b710b35131c471bLL,
  39. 0x28db77f523047d84LL, 0x32caab7b40c72493LL, 0x3c9ebe0a15c9bebcLL, 0x431d67c49c100d4cLL,
  40. 0x4cc5d4becb3e42b6LL, 0x597f299cfc657e2aLL, 0x5fcb6fab3ad6faecLL, 0x6c44198c4a475817LL
  41. };
  42. static const
  43. uint64_t change_endian64(uint64_t x){
  44. uint64_t r=0;
  45. uint8_t i=8;
  46. do{
  47. r <<= 8;
  48. r |= 0xff&x;
  49. x >>=8;
  50. }while(--i);
  51. return r;
  52. }
  53. static const
  54. uint64_t rotr64(uint64_t x, uint8_t n){
  55. return (x>>n)|(x<<(64-n));
  56. }
  57. static const
  58. uint64_t rotl64(uint64_t x, uint8_t n){
  59. return (x<<n)|(x>>(64-n));
  60. }
  61. #define CH(x,y,z) (((x)&(y))^((~(x))&(z)))
  62. #define MAJ(x,y,z) (((x)&(y))^((x)&(z))^((y)&(z)))
  63. #define SIGMA_0(x) (rotr64((x), 28) ^ rotl64((x), 30) ^ rotl64((x), 25))
  64. #define SIGMA_1(x) (rotr64((x), 14) ^ rotr64((x), 18) ^ rotl64((x), 23))
  65. #define SIGMA_a(x) (rotr64((x), 1) ^ rotr64((x), 8) ^ ((x)>>7))
  66. #define SIGMA_b(x) (rotr64((x), 19) ^ rotl64((x), 3) ^ ((x)>>6))
  67. static
  68. void load_endian64_changed(uint8_t* dest, uint8_t* src, uint16_t words){
  69. uint8_t i;
  70. while(words--){
  71. i = 7;
  72. do{
  73. *dest++ = src[i];
  74. }while(i--);
  75. src += 8;
  76. }
  77. }
  78. void sha2_large_common_nextBlock(sha2_large_common_ctx_t* ctx, const void* block){
  79. uint64_t w[16], wx;
  80. uint64_t a[8];
  81. uint64_t t1, t2;
  82. const uint64_t *k=sha2_large_common_const;
  83. uint8_t i;
  84. load_endian64_changed((uint8_t*)w, (uint8_t*)block, 16);
  85. memcpy(a, ctx->h, 8*8);
  86. for(i=0; i<80; ++i){
  87. if(i<16){
  88. wx=w[i];
  89. }else{
  90. wx = SIGMA_b(w[14]) + w[9] + SIGMA_a(w[1]) + w[0];
  91. memmove(&(w[0]), &(w[1]), 15*8);
  92. w[15] = wx;
  93. }
  94. t1 = a[7] + SIGMA_1(a[4]) + CH(a[4], a[5], a[6]) + *k++ + wx;
  95. t2 = SIGMA_0(a[0]) + MAJ(a[0], a[1], a[2]);
  96. memmove(&(a[1]), &(a[0]), 7*8);
  97. a[0] = t1 + t2;
  98. a[4] += t1;
  99. }
  100. i=7;
  101. do{
  102. ctx->h[i] += a[i];
  103. }while(i--);
  104. ctx->length += 1;
  105. }
  106. void sha2_large_common_lastBlock(sha2_large_common_ctx_t* ctx, const void* block, uint16_t length_b){
  107. while(length_b >= 1024){
  108. sha2_large_common_nextBlock(ctx, block);
  109. block = (uint8_t*)block + 1024/8;
  110. length_b -= 1024;
  111. }
  112. uint8_t buffer[1024/8];
  113. uint64_t len;
  114. len = ((uint64_t)ctx->length)*1024LL + length_b;
  115. len = change_endian64(len);
  116. memset(buffer, 0, 1024/8);
  117. memcpy(buffer, block, (length_b+7)/8);
  118. buffer[length_b/8] |= 0x80>>(length_b%8);
  119. if(length_b>1024-128-1){
  120. /* length goes into the next block */
  121. sha2_large_common_nextBlock(ctx, buffer);
  122. memset(buffer, 0, 120);
  123. }
  124. memcpy(&(buffer[128-8]), &len, 8);
  125. sha2_large_common_nextBlock(ctx, buffer);
  126. }