base32.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241
  1. /**
  2. * Copyright (c) 2017 Saleem Rashid
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining
  5. * a copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included
  12. * in all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, E1PRESS
  15. * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  17. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES
  18. * OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  19. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  20. * OTHER DEALINGS IN THE SOFTWARE.
  21. */
  22. #include "base32.h"
  23. #include <string.h>
  24. const char* BASE32_ALPHABET_RFC4648 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ23456789";
  25. static inline void base32_5to8(const uint8_t* in, uint8_t length, uint8_t* out);
  26. static inline bool
  27. base32_8to5(const uint8_t* in, uint8_t length, uint8_t* out, const char* alphabet);
  28. static inline void base32_8to5_raw(const uint8_t* in, uint8_t length, uint8_t* out);
  29. static inline int base32_encode_character(uint8_t decoded, const char* alphabet);
  30. static inline int base32_decode_character(char encoded, const char* alphabet);
  31. char* base32_encode(
  32. const uint8_t* in,
  33. size_t inlen,
  34. char* out,
  35. size_t outlen,
  36. const char* alphabet) {
  37. size_t length = base32_encoded_length(inlen);
  38. if(outlen <= length) {
  39. return NULL;
  40. }
  41. base32_encode_unsafe(in, inlen, (uint8_t*)out);
  42. for(size_t i = 0; i < length; i++) {
  43. int ret = base32_encode_character(out[i], alphabet);
  44. if(ret == -1) {
  45. return NULL;
  46. } else {
  47. out[i] = ret;
  48. }
  49. }
  50. out[length] = '\0';
  51. return &out[length];
  52. }
  53. uint8_t*
  54. base32_decode(const char* in, size_t inlen, uint8_t* out, size_t outlen, const char* alphabet) {
  55. size_t length = base32_decoded_length(inlen);
  56. if(outlen < length) {
  57. return NULL;
  58. }
  59. if(!base32_decode_unsafe((uint8_t*)in, inlen, (uint8_t*)out, alphabet)) {
  60. return NULL;
  61. }
  62. return &out[length];
  63. }
  64. void base32_encode_unsafe(const uint8_t* in, size_t inlen, uint8_t* out) {
  65. uint8_t remainder = inlen % 5;
  66. size_t limit = inlen - remainder;
  67. size_t i = 0, j = 0;
  68. for(i = 0, j = 0; i < limit; i += 5, j += 8) {
  69. base32_5to8(&in[i], 5, &out[j]);
  70. }
  71. if(remainder) base32_5to8(&in[i], remainder, &out[j]);
  72. }
  73. bool base32_decode_unsafe(const uint8_t* in, size_t inlen, uint8_t* out, const char* alphabet) {
  74. uint8_t remainder = inlen % 8;
  75. size_t limit = inlen - remainder;
  76. size_t i = 0, j = 0;
  77. for(i = 0, j = 0; i < limit; i += 8, j += 5) {
  78. if(!base32_8to5(&in[i], 8, &out[j], alphabet)) {
  79. return false;
  80. }
  81. }
  82. if(remainder && !base32_8to5(&in[i], remainder, &out[j], alphabet)) {
  83. return false;
  84. }
  85. return true;
  86. }
  87. size_t base32_encoded_length(size_t inlen) {
  88. uint8_t remainder = inlen % 5;
  89. return (inlen / 5) * 8 + (remainder * 8 + 4) / 5;
  90. }
  91. size_t base32_decoded_length(size_t inlen) {
  92. uint8_t remainder = inlen % 8;
  93. return (inlen / 8) * 5 + (remainder * 5) / 8;
  94. }
  95. void base32_5to8(const uint8_t* in, uint8_t length, uint8_t* out) {
  96. if(length >= 1) {
  97. out[0] = (in[0] >> 3);
  98. out[1] = (in[0] & 7) << 2;
  99. }
  100. if(length >= 2) {
  101. out[1] |= (in[1] >> 6);
  102. out[2] = (in[1] >> 1) & 31;
  103. out[3] = (in[1] & 1) << 4;
  104. }
  105. if(length >= 3) {
  106. out[3] |= (in[2] >> 4);
  107. out[4] = (in[2] & 15) << 1;
  108. }
  109. if(length >= 4) {
  110. out[4] |= (in[3] >> 7);
  111. out[5] = (in[3] >> 2) & 31;
  112. out[6] = (in[3] & 3) << 3;
  113. }
  114. if(length >= 5) {
  115. out[6] |= (in[4] >> 5);
  116. out[7] = (in[4] & 31);
  117. }
  118. }
  119. bool base32_8to5(const uint8_t* in, uint8_t length, uint8_t* out, const char* alphabet) {
  120. if(length == 1 || length == 3 || length == 6 || length > 8) {
  121. return false;
  122. }
  123. if(alphabet) {
  124. uint8_t decoded[length];
  125. memset(decoded, 0, sizeof(decoded));
  126. for(size_t i = 0; i < length; i++) {
  127. int ret = base32_decode_character(in[i], alphabet);
  128. if(ret == -1) {
  129. return false;
  130. } else {
  131. decoded[i] = ret;
  132. }
  133. }
  134. base32_8to5_raw(decoded, length, out);
  135. } else {
  136. base32_8to5_raw(in, length, out);
  137. }
  138. return true;
  139. }
  140. void base32_8to5_raw(const uint8_t* in, uint8_t length, uint8_t* out) {
  141. if(length >= 2) {
  142. out[0] = (in[0] << 3);
  143. out[0] |= (in[1] >> 2);
  144. }
  145. if(length >= 4) {
  146. out[1] = (in[1] & 3) << 6;
  147. out[1] |= (in[2] << 1);
  148. out[1] |= (in[3] >> 4);
  149. }
  150. if(length >= 5) {
  151. out[2] = (in[3] & 15) << 4;
  152. out[2] |= (in[4] >> 1);
  153. }
  154. if(length >= 7) {
  155. out[3] = (in[4] & 1) << 7;
  156. out[3] |= (in[5] << 2);
  157. out[3] |= (in[6] >> 3);
  158. }
  159. if(length >= 8) {
  160. out[4] = (in[6] & 7) << 5;
  161. out[4] |= (in[7] & 31);
  162. }
  163. }
  164. int base32_encode_character(uint8_t decoded, const char* alphabet) {
  165. if(decoded >> 5) {
  166. return -1;
  167. }
  168. if(alphabet == BASE32_ALPHABET_RFC4648) {
  169. if(decoded < 26) {
  170. return 'A' + decoded;
  171. } else {
  172. return '2' - 26 + decoded;
  173. }
  174. }
  175. return alphabet[decoded];
  176. }
  177. int base32_decode_character(char encoded, const char* alphabet) {
  178. if(alphabet == BASE32_ALPHABET_RFC4648) {
  179. if(encoded >= 'A' && encoded <= 'Z') {
  180. return encoded - 'A';
  181. } else if(encoded >= 'a' && encoded <= 'z') {
  182. return encoded - 'a';
  183. } else if(encoded >= '2' && encoded <= '7') {
  184. return encoded - '2' + 26;
  185. } else {
  186. return -1;
  187. }
  188. }
  189. const char* occurrence = strchr(alphabet, encoded);
  190. if(occurrence) {
  191. return occurrence - alphabet;
  192. } else {
  193. return -1;
  194. }
  195. }