2
0

crypto.js 53 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619
  1. /**
  2. * @licstart The following is the entire license notice for the
  3. * Javascript code in this page
  4. *
  5. * Copyright 2021 Mozilla Foundation
  6. *
  7. * Licensed under the Apache License, Version 2.0 (the "License");
  8. * you may not use this file except in compliance with the License.
  9. * You may obtain a copy of the License at
  10. *
  11. * http://www.apache.org/licenses/LICENSE-2.0
  12. *
  13. * Unless required by applicable law or agreed to in writing, software
  14. * distributed under the License is distributed on an "AS IS" BASIS,
  15. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  16. * See the License for the specific language governing permissions and
  17. * limitations under the License.
  18. *
  19. * @licend The above is the entire license notice for the
  20. * Javascript code in this page
  21. */
  22. "use strict";
  23. Object.defineProperty(exports, "__esModule", {
  24. value: true
  25. });
  26. exports.calculateSHA384 = calculateSHA384;
  27. exports.PDF20 = exports.PDF17 = exports.CipherTransformFactory = exports.calculateSHA512 = exports.calculateSHA256 = exports.calculateMD5 = exports.ARCFourCipher = exports.AES256Cipher = exports.AES128Cipher = void 0;
  28. var _util = require("../shared/util.js");
  29. var _primitives = require("./primitives.js");
  30. var _stream = require("./stream.js");
  31. class ARCFourCipher {
  32. constructor(key) {
  33. this.a = 0;
  34. this.b = 0;
  35. var s = new Uint8Array(256);
  36. var i,
  37. j = 0,
  38. tmp,
  39. keyLength = key.length;
  40. for (i = 0; i < 256; ++i) {
  41. s[i] = i;
  42. }
  43. for (i = 0; i < 256; ++i) {
  44. tmp = s[i];
  45. j = j + tmp + key[i % keyLength] & 0xff;
  46. s[i] = s[j];
  47. s[j] = tmp;
  48. }
  49. this.s = s;
  50. }
  51. encryptBlock(data) {
  52. var i,
  53. n = data.length,
  54. tmp,
  55. tmp2;
  56. var a = this.a,
  57. b = this.b,
  58. s = this.s;
  59. var output = new Uint8Array(n);
  60. for (i = 0; i < n; ++i) {
  61. a = a + 1 & 0xff;
  62. tmp = s[a];
  63. b = b + tmp & 0xff;
  64. tmp2 = s[b];
  65. s[a] = tmp2;
  66. s[b] = tmp;
  67. output[i] = data[i] ^ s[tmp + tmp2 & 0xff];
  68. }
  69. this.a = a;
  70. this.b = b;
  71. return output;
  72. }
  73. decryptBlock(data) {
  74. return this.encryptBlock(data);
  75. }
  76. encrypt(data) {
  77. return this.encryptBlock(data);
  78. }
  79. }
  80. exports.ARCFourCipher = ARCFourCipher;
  81. var calculateMD5 = function calculateMD5Closure() {
  82. var r = new Uint8Array([7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]);
  83. var k = new Int32Array([-680876936, -389564586, 606105819, -1044525330, -176418897, 1200080426, -1473231341, -45705983, 1770035416, -1958414417, -42063, -1990404162, 1804603682, -40341101, -1502002290, 1236535329, -165796510, -1069501632, 643717713, -373897302, -701558691, 38016083, -660478335, -405537848, 568446438, -1019803690, -187363961, 1163531501, -1444681467, -51403784, 1735328473, -1926607734, -378558, -2022574463, 1839030562, -35309556, -1530992060, 1272893353, -155497632, -1094730640, 681279174, -358537222, -722521979, 76029189, -640364487, -421815835, 530742520, -995338651, -198630844, 1126891415, -1416354905, -57434055, 1700485571, -1894986606, -1051523, -2054922799, 1873313359, -30611744, -1560198380, 1309151649, -145523070, -1120210379, 718787259, -343485551]);
  84. function hash(data, offset, length) {
  85. var h0 = 1732584193,
  86. h1 = -271733879,
  87. h2 = -1732584194,
  88. h3 = 271733878;
  89. var paddedLength = length + 72 & ~63;
  90. var padded = new Uint8Array(paddedLength);
  91. var i, j, n;
  92. for (i = 0; i < length; ++i) {
  93. padded[i] = data[offset++];
  94. }
  95. padded[i++] = 0x80;
  96. n = paddedLength - 8;
  97. while (i < n) {
  98. padded[i++] = 0;
  99. }
  100. padded[i++] = length << 3 & 0xff;
  101. padded[i++] = length >> 5 & 0xff;
  102. padded[i++] = length >> 13 & 0xff;
  103. padded[i++] = length >> 21 & 0xff;
  104. padded[i++] = length >>> 29 & 0xff;
  105. padded[i++] = 0;
  106. padded[i++] = 0;
  107. padded[i++] = 0;
  108. var w = new Int32Array(16);
  109. for (i = 0; i < paddedLength;) {
  110. for (j = 0; j < 16; ++j, i += 4) {
  111. w[j] = padded[i] | padded[i + 1] << 8 | padded[i + 2] << 16 | padded[i + 3] << 24;
  112. }
  113. var a = h0,
  114. b = h1,
  115. c = h2,
  116. d = h3,
  117. f,
  118. g;
  119. for (j = 0; j < 64; ++j) {
  120. if (j < 16) {
  121. f = b & c | ~b & d;
  122. g = j;
  123. } else if (j < 32) {
  124. f = d & b | ~d & c;
  125. g = 5 * j + 1 & 15;
  126. } else if (j < 48) {
  127. f = b ^ c ^ d;
  128. g = 3 * j + 5 & 15;
  129. } else {
  130. f = c ^ (b | ~d);
  131. g = 7 * j & 15;
  132. }
  133. var tmp = d,
  134. rotateArg = a + f + k[j] + w[g] | 0,
  135. rotate = r[j];
  136. d = c;
  137. c = b;
  138. b = b + (rotateArg << rotate | rotateArg >>> 32 - rotate) | 0;
  139. a = tmp;
  140. }
  141. h0 = h0 + a | 0;
  142. h1 = h1 + b | 0;
  143. h2 = h2 + c | 0;
  144. h3 = h3 + d | 0;
  145. }
  146. return new Uint8Array([h0 & 0xFF, h0 >> 8 & 0xFF, h0 >> 16 & 0xFF, h0 >>> 24 & 0xFF, h1 & 0xFF, h1 >> 8 & 0xFF, h1 >> 16 & 0xFF, h1 >>> 24 & 0xFF, h2 & 0xFF, h2 >> 8 & 0xFF, h2 >> 16 & 0xFF, h2 >>> 24 & 0xFF, h3 & 0xFF, h3 >> 8 & 0xFF, h3 >> 16 & 0xFF, h3 >>> 24 & 0xFF]);
  147. }
  148. return hash;
  149. }();
  150. exports.calculateMD5 = calculateMD5;
  151. class Word64 {
  152. constructor(highInteger, lowInteger) {
  153. this.high = highInteger | 0;
  154. this.low = lowInteger | 0;
  155. }
  156. and(word) {
  157. this.high &= word.high;
  158. this.low &= word.low;
  159. }
  160. xor(word) {
  161. this.high ^= word.high;
  162. this.low ^= word.low;
  163. }
  164. or(word) {
  165. this.high |= word.high;
  166. this.low |= word.low;
  167. }
  168. shiftRight(places) {
  169. if (places >= 32) {
  170. this.low = this.high >>> places - 32 | 0;
  171. this.high = 0;
  172. } else {
  173. this.low = this.low >>> places | this.high << 32 - places;
  174. this.high = this.high >>> places | 0;
  175. }
  176. }
  177. shiftLeft(places) {
  178. if (places >= 32) {
  179. this.high = this.low << places - 32;
  180. this.low = 0;
  181. } else {
  182. this.high = this.high << places | this.low >>> 32 - places;
  183. this.low = this.low << places;
  184. }
  185. }
  186. rotateRight(places) {
  187. var low, high;
  188. if (places & 32) {
  189. high = this.low;
  190. low = this.high;
  191. } else {
  192. low = this.low;
  193. high = this.high;
  194. }
  195. places &= 31;
  196. this.low = low >>> places | high << 32 - places;
  197. this.high = high >>> places | low << 32 - places;
  198. }
  199. not() {
  200. this.high = ~this.high;
  201. this.low = ~this.low;
  202. }
  203. add(word) {
  204. var lowAdd = (this.low >>> 0) + (word.low >>> 0);
  205. var highAdd = (this.high >>> 0) + (word.high >>> 0);
  206. if (lowAdd > 0xffffffff) {
  207. highAdd += 1;
  208. }
  209. this.low = lowAdd | 0;
  210. this.high = highAdd | 0;
  211. }
  212. copyTo(bytes, offset) {
  213. bytes[offset] = this.high >>> 24 & 0xff;
  214. bytes[offset + 1] = this.high >> 16 & 0xff;
  215. bytes[offset + 2] = this.high >> 8 & 0xff;
  216. bytes[offset + 3] = this.high & 0xff;
  217. bytes[offset + 4] = this.low >>> 24 & 0xff;
  218. bytes[offset + 5] = this.low >> 16 & 0xff;
  219. bytes[offset + 6] = this.low >> 8 & 0xff;
  220. bytes[offset + 7] = this.low & 0xff;
  221. }
  222. assign(word) {
  223. this.high = word.high;
  224. this.low = word.low;
  225. }
  226. }
  227. var calculateSHA256 = function calculateSHA256Closure() {
  228. function rotr(x, n) {
  229. return x >>> n | x << 32 - n;
  230. }
  231. function ch(x, y, z) {
  232. return x & y ^ ~x & z;
  233. }
  234. function maj(x, y, z) {
  235. return x & y ^ x & z ^ y & z;
  236. }
  237. function sigma(x) {
  238. return rotr(x, 2) ^ rotr(x, 13) ^ rotr(x, 22);
  239. }
  240. function sigmaPrime(x) {
  241. return rotr(x, 6) ^ rotr(x, 11) ^ rotr(x, 25);
  242. }
  243. function littleSigma(x) {
  244. return rotr(x, 7) ^ rotr(x, 18) ^ x >>> 3;
  245. }
  246. function littleSigmaPrime(x) {
  247. return rotr(x, 17) ^ rotr(x, 19) ^ x >>> 10;
  248. }
  249. var k = [0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2];
  250. function hash(data, offset, length) {
  251. var h0 = 0x6a09e667,
  252. h1 = 0xbb67ae85,
  253. h2 = 0x3c6ef372,
  254. h3 = 0xa54ff53a,
  255. h4 = 0x510e527f,
  256. h5 = 0x9b05688c,
  257. h6 = 0x1f83d9ab,
  258. h7 = 0x5be0cd19;
  259. var paddedLength = Math.ceil((length + 9) / 64) * 64;
  260. var padded = new Uint8Array(paddedLength);
  261. var i, j, n;
  262. for (i = 0; i < length; ++i) {
  263. padded[i] = data[offset++];
  264. }
  265. padded[i++] = 0x80;
  266. n = paddedLength - 8;
  267. while (i < n) {
  268. padded[i++] = 0;
  269. }
  270. padded[i++] = 0;
  271. padded[i++] = 0;
  272. padded[i++] = 0;
  273. padded[i++] = length >>> 29 & 0xff;
  274. padded[i++] = length >> 21 & 0xff;
  275. padded[i++] = length >> 13 & 0xff;
  276. padded[i++] = length >> 5 & 0xff;
  277. padded[i++] = length << 3 & 0xff;
  278. var w = new Uint32Array(64);
  279. for (i = 0; i < paddedLength;) {
  280. for (j = 0; j < 16; ++j) {
  281. w[j] = padded[i] << 24 | padded[i + 1] << 16 | padded[i + 2] << 8 | padded[i + 3];
  282. i += 4;
  283. }
  284. for (j = 16; j < 64; ++j) {
  285. w[j] = littleSigmaPrime(w[j - 2]) + w[j - 7] + littleSigma(w[j - 15]) + w[j - 16] | 0;
  286. }
  287. var a = h0,
  288. b = h1,
  289. c = h2,
  290. d = h3,
  291. e = h4,
  292. f = h5,
  293. g = h6,
  294. h = h7,
  295. t1,
  296. t2;
  297. for (j = 0; j < 64; ++j) {
  298. t1 = h + sigmaPrime(e) + ch(e, f, g) + k[j] + w[j];
  299. t2 = sigma(a) + maj(a, b, c);
  300. h = g;
  301. g = f;
  302. f = e;
  303. e = d + t1 | 0;
  304. d = c;
  305. c = b;
  306. b = a;
  307. a = t1 + t2 | 0;
  308. }
  309. h0 = h0 + a | 0;
  310. h1 = h1 + b | 0;
  311. h2 = h2 + c | 0;
  312. h3 = h3 + d | 0;
  313. h4 = h4 + e | 0;
  314. h5 = h5 + f | 0;
  315. h6 = h6 + g | 0;
  316. h7 = h7 + h | 0;
  317. }
  318. return new Uint8Array([h0 >> 24 & 0xFF, h0 >> 16 & 0xFF, h0 >> 8 & 0xFF, h0 & 0xFF, h1 >> 24 & 0xFF, h1 >> 16 & 0xFF, h1 >> 8 & 0xFF, h1 & 0xFF, h2 >> 24 & 0xFF, h2 >> 16 & 0xFF, h2 >> 8 & 0xFF, h2 & 0xFF, h3 >> 24 & 0xFF, h3 >> 16 & 0xFF, h3 >> 8 & 0xFF, h3 & 0xFF, h4 >> 24 & 0xFF, h4 >> 16 & 0xFF, h4 >> 8 & 0xFF, h4 & 0xFF, h5 >> 24 & 0xFF, h5 >> 16 & 0xFF, h5 >> 8 & 0xFF, h5 & 0xFF, h6 >> 24 & 0xFF, h6 >> 16 & 0xFF, h6 >> 8 & 0xFF, h6 & 0xFF, h7 >> 24 & 0xFF, h7 >> 16 & 0xFF, h7 >> 8 & 0xFF, h7 & 0xFF]);
  319. }
  320. return hash;
  321. }();
  322. exports.calculateSHA256 = calculateSHA256;
  323. var calculateSHA512 = function calculateSHA512Closure() {
  324. function ch(result, x, y, z, tmp) {
  325. result.assign(x);
  326. result.and(y);
  327. tmp.assign(x);
  328. tmp.not();
  329. tmp.and(z);
  330. result.xor(tmp);
  331. }
  332. function maj(result, x, y, z, tmp) {
  333. result.assign(x);
  334. result.and(y);
  335. tmp.assign(x);
  336. tmp.and(z);
  337. result.xor(tmp);
  338. tmp.assign(y);
  339. tmp.and(z);
  340. result.xor(tmp);
  341. }
  342. function sigma(result, x, tmp) {
  343. result.assign(x);
  344. result.rotateRight(28);
  345. tmp.assign(x);
  346. tmp.rotateRight(34);
  347. result.xor(tmp);
  348. tmp.assign(x);
  349. tmp.rotateRight(39);
  350. result.xor(tmp);
  351. }
  352. function sigmaPrime(result, x, tmp) {
  353. result.assign(x);
  354. result.rotateRight(14);
  355. tmp.assign(x);
  356. tmp.rotateRight(18);
  357. result.xor(tmp);
  358. tmp.assign(x);
  359. tmp.rotateRight(41);
  360. result.xor(tmp);
  361. }
  362. function littleSigma(result, x, tmp) {
  363. result.assign(x);
  364. result.rotateRight(1);
  365. tmp.assign(x);
  366. tmp.rotateRight(8);
  367. result.xor(tmp);
  368. tmp.assign(x);
  369. tmp.shiftRight(7);
  370. result.xor(tmp);
  371. }
  372. function littleSigmaPrime(result, x, tmp) {
  373. result.assign(x);
  374. result.rotateRight(19);
  375. tmp.assign(x);
  376. tmp.rotateRight(61);
  377. result.xor(tmp);
  378. tmp.assign(x);
  379. tmp.shiftRight(6);
  380. result.xor(tmp);
  381. }
  382. var k = [new Word64(0x428a2f98, 0xd728ae22), new Word64(0x71374491, 0x23ef65cd), new Word64(0xb5c0fbcf, 0xec4d3b2f), new Word64(0xe9b5dba5, 0x8189dbbc), new Word64(0x3956c25b, 0xf348b538), new Word64(0x59f111f1, 0xb605d019), new Word64(0x923f82a4, 0xaf194f9b), new Word64(0xab1c5ed5, 0xda6d8118), new Word64(0xd807aa98, 0xa3030242), new Word64(0x12835b01, 0x45706fbe), new Word64(0x243185be, 0x4ee4b28c), new Word64(0x550c7dc3, 0xd5ffb4e2), new Word64(0x72be5d74, 0xf27b896f), new Word64(0x80deb1fe, 0x3b1696b1), new Word64(0x9bdc06a7, 0x25c71235), new Word64(0xc19bf174, 0xcf692694), new Word64(0xe49b69c1, 0x9ef14ad2), new Word64(0xefbe4786, 0x384f25e3), new Word64(0x0fc19dc6, 0x8b8cd5b5), new Word64(0x240ca1cc, 0x77ac9c65), new Word64(0x2de92c6f, 0x592b0275), new Word64(0x4a7484aa, 0x6ea6e483), new Word64(0x5cb0a9dc, 0xbd41fbd4), new Word64(0x76f988da, 0x831153b5), new Word64(0x983e5152, 0xee66dfab), new Word64(0xa831c66d, 0x2db43210), new Word64(0xb00327c8, 0x98fb213f), new Word64(0xbf597fc7, 0xbeef0ee4), new Word64(0xc6e00bf3, 0x3da88fc2), new Word64(0xd5a79147, 0x930aa725), new Word64(0x06ca6351, 0xe003826f), new Word64(0x14292967, 0x0a0e6e70), new Word64(0x27b70a85, 0x46d22ffc), new Word64(0x2e1b2138, 0x5c26c926), new Word64(0x4d2c6dfc, 0x5ac42aed), new Word64(0x53380d13, 0x9d95b3df), new Word64(0x650a7354, 0x8baf63de), new Word64(0x766a0abb, 0x3c77b2a8), new Word64(0x81c2c92e, 0x47edaee6), new Word64(0x92722c85, 0x1482353b), new Word64(0xa2bfe8a1, 0x4cf10364), new Word64(0xa81a664b, 0xbc423001), new Word64(0xc24b8b70, 0xd0f89791), new Word64(0xc76c51a3, 0x0654be30), new Word64(0xd192e819, 0xd6ef5218), new Word64(0xd6990624, 0x5565a910), new Word64(0xf40e3585, 0x5771202a), new Word64(0x106aa070, 0x32bbd1b8), new Word64(0x19a4c116, 0xb8d2d0c8), new Word64(0x1e376c08, 0x5141ab53), new Word64(0x2748774c, 0xdf8eeb99), new Word64(0x34b0bcb5, 0xe19b48a8), new Word64(0x391c0cb3, 0xc5c95a63), new Word64(0x4ed8aa4a, 0xe3418acb), new Word64(0x5b9cca4f, 0x7763e373), new Word64(0x682e6ff3, 0xd6b2b8a3), new Word64(0x748f82ee, 0x5defb2fc), new Word64(0x78a5636f, 0x43172f60), new Word64(0x84c87814, 0xa1f0ab72), new Word64(0x8cc70208, 0x1a6439ec), new Word64(0x90befffa, 0x23631e28), new Word64(0xa4506ceb, 0xde82bde9), new Word64(0xbef9a3f7, 0xb2c67915), new Word64(0xc67178f2, 0xe372532b), new Word64(0xca273ece, 0xea26619c), new Word64(0xd186b8c7, 0x21c0c207), new Word64(0xeada7dd6, 0xcde0eb1e), new Word64(0xf57d4f7f, 0xee6ed178), new Word64(0x06f067aa, 0x72176fba), new Word64(0x0a637dc5, 0xa2c898a6), new Word64(0x113f9804, 0xbef90dae), new Word64(0x1b710b35, 0x131c471b), new Word64(0x28db77f5, 0x23047d84), new Word64(0x32caab7b, 0x40c72493), new Word64(0x3c9ebe0a, 0x15c9bebc), new Word64(0x431d67c4, 0x9c100d4c), new Word64(0x4cc5d4be, 0xcb3e42b6), new Word64(0x597f299c, 0xfc657e2a), new Word64(0x5fcb6fab, 0x3ad6faec), new Word64(0x6c44198c, 0x4a475817)];
  383. function hash(data, offset, length, mode384 = false) {
  384. var h0, h1, h2, h3, h4, h5, h6, h7;
  385. if (!mode384) {
  386. h0 = new Word64(0x6a09e667, 0xf3bcc908);
  387. h1 = new Word64(0xbb67ae85, 0x84caa73b);
  388. h2 = new Word64(0x3c6ef372, 0xfe94f82b);
  389. h3 = new Word64(0xa54ff53a, 0x5f1d36f1);
  390. h4 = new Word64(0x510e527f, 0xade682d1);
  391. h5 = new Word64(0x9b05688c, 0x2b3e6c1f);
  392. h6 = new Word64(0x1f83d9ab, 0xfb41bd6b);
  393. h7 = new Word64(0x5be0cd19, 0x137e2179);
  394. } else {
  395. h0 = new Word64(0xcbbb9d5d, 0xc1059ed8);
  396. h1 = new Word64(0x629a292a, 0x367cd507);
  397. h2 = new Word64(0x9159015a, 0x3070dd17);
  398. h3 = new Word64(0x152fecd8, 0xf70e5939);
  399. h4 = new Word64(0x67332667, 0xffc00b31);
  400. h5 = new Word64(0x8eb44a87, 0x68581511);
  401. h6 = new Word64(0xdb0c2e0d, 0x64f98fa7);
  402. h7 = new Word64(0x47b5481d, 0xbefa4fa4);
  403. }
  404. var paddedLength = Math.ceil((length + 17) / 128) * 128;
  405. var padded = new Uint8Array(paddedLength);
  406. var i, j, n;
  407. for (i = 0; i < length; ++i) {
  408. padded[i] = data[offset++];
  409. }
  410. padded[i++] = 0x80;
  411. n = paddedLength - 16;
  412. while (i < n) {
  413. padded[i++] = 0;
  414. }
  415. padded[i++] = 0;
  416. padded[i++] = 0;
  417. padded[i++] = 0;
  418. padded[i++] = 0;
  419. padded[i++] = 0;
  420. padded[i++] = 0;
  421. padded[i++] = 0;
  422. padded[i++] = 0;
  423. padded[i++] = 0;
  424. padded[i++] = 0;
  425. padded[i++] = 0;
  426. padded[i++] = length >>> 29 & 0xff;
  427. padded[i++] = length >> 21 & 0xff;
  428. padded[i++] = length >> 13 & 0xff;
  429. padded[i++] = length >> 5 & 0xff;
  430. padded[i++] = length << 3 & 0xff;
  431. var w = new Array(80);
  432. for (i = 0; i < 80; i++) {
  433. w[i] = new Word64(0, 0);
  434. }
  435. var a = new Word64(0, 0),
  436. b = new Word64(0, 0),
  437. c = new Word64(0, 0);
  438. var d = new Word64(0, 0),
  439. e = new Word64(0, 0),
  440. f = new Word64(0, 0);
  441. var g = new Word64(0, 0),
  442. h = new Word64(0, 0);
  443. var t1 = new Word64(0, 0),
  444. t2 = new Word64(0, 0);
  445. var tmp1 = new Word64(0, 0),
  446. tmp2 = new Word64(0, 0),
  447. tmp3;
  448. for (i = 0; i < paddedLength;) {
  449. for (j = 0; j < 16; ++j) {
  450. w[j].high = padded[i] << 24 | padded[i + 1] << 16 | padded[i + 2] << 8 | padded[i + 3];
  451. w[j].low = padded[i + 4] << 24 | padded[i + 5] << 16 | padded[i + 6] << 8 | padded[i + 7];
  452. i += 8;
  453. }
  454. for (j = 16; j < 80; ++j) {
  455. tmp3 = w[j];
  456. littleSigmaPrime(tmp3, w[j - 2], tmp2);
  457. tmp3.add(w[j - 7]);
  458. littleSigma(tmp1, w[j - 15], tmp2);
  459. tmp3.add(tmp1);
  460. tmp3.add(w[j - 16]);
  461. }
  462. a.assign(h0);
  463. b.assign(h1);
  464. c.assign(h2);
  465. d.assign(h3);
  466. e.assign(h4);
  467. f.assign(h5);
  468. g.assign(h6);
  469. h.assign(h7);
  470. for (j = 0; j < 80; ++j) {
  471. t1.assign(h);
  472. sigmaPrime(tmp1, e, tmp2);
  473. t1.add(tmp1);
  474. ch(tmp1, e, f, g, tmp2);
  475. t1.add(tmp1);
  476. t1.add(k[j]);
  477. t1.add(w[j]);
  478. sigma(t2, a, tmp2);
  479. maj(tmp1, a, b, c, tmp2);
  480. t2.add(tmp1);
  481. tmp3 = h;
  482. h = g;
  483. g = f;
  484. f = e;
  485. d.add(t1);
  486. e = d;
  487. d = c;
  488. c = b;
  489. b = a;
  490. tmp3.assign(t1);
  491. tmp3.add(t2);
  492. a = tmp3;
  493. }
  494. h0.add(a);
  495. h1.add(b);
  496. h2.add(c);
  497. h3.add(d);
  498. h4.add(e);
  499. h5.add(f);
  500. h6.add(g);
  501. h7.add(h);
  502. }
  503. var result;
  504. if (!mode384) {
  505. result = new Uint8Array(64);
  506. h0.copyTo(result, 0);
  507. h1.copyTo(result, 8);
  508. h2.copyTo(result, 16);
  509. h3.copyTo(result, 24);
  510. h4.copyTo(result, 32);
  511. h5.copyTo(result, 40);
  512. h6.copyTo(result, 48);
  513. h7.copyTo(result, 56);
  514. } else {
  515. result = new Uint8Array(48);
  516. h0.copyTo(result, 0);
  517. h1.copyTo(result, 8);
  518. h2.copyTo(result, 16);
  519. h3.copyTo(result, 24);
  520. h4.copyTo(result, 32);
  521. h5.copyTo(result, 40);
  522. }
  523. return result;
  524. }
  525. return hash;
  526. }();
  527. exports.calculateSHA512 = calculateSHA512;
  528. function calculateSHA384(data, offset, length) {
  529. return calculateSHA512(data, offset, length, true);
  530. }
  531. class NullCipher {
  532. decryptBlock(data) {
  533. return data;
  534. }
  535. encrypt(data) {
  536. return data;
  537. }
  538. }
  539. class AESBaseCipher {
  540. constructor() {
  541. if (this.constructor === AESBaseCipher) {
  542. (0, _util.unreachable)("Cannot initialize AESBaseCipher.");
  543. }
  544. this._s = new Uint8Array([0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16]);
  545. this._inv_s = new Uint8Array([0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84, 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4, 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d]);
  546. this._mix = new Uint32Array([0x00000000, 0x0e090d0b, 0x1c121a16, 0x121b171d, 0x3824342c, 0x362d3927, 0x24362e3a, 0x2a3f2331, 0x70486858, 0x7e416553, 0x6c5a724e, 0x62537f45, 0x486c5c74, 0x4665517f, 0x547e4662, 0x5a774b69, 0xe090d0b0, 0xee99ddbb, 0xfc82caa6, 0xf28bc7ad, 0xd8b4e49c, 0xd6bde997, 0xc4a6fe8a, 0xcaaff381, 0x90d8b8e8, 0x9ed1b5e3, 0x8ccaa2fe, 0x82c3aff5, 0xa8fc8cc4, 0xa6f581cf, 0xb4ee96d2, 0xbae79bd9, 0xdb3bbb7b, 0xd532b670, 0xc729a16d, 0xc920ac66, 0xe31f8f57, 0xed16825c, 0xff0d9541, 0xf104984a, 0xab73d323, 0xa57ade28, 0xb761c935, 0xb968c43e, 0x9357e70f, 0x9d5eea04, 0x8f45fd19, 0x814cf012, 0x3bab6bcb, 0x35a266c0, 0x27b971dd, 0x29b07cd6, 0x038f5fe7, 0x0d8652ec, 0x1f9d45f1, 0x119448fa, 0x4be30393, 0x45ea0e98, 0x57f11985, 0x59f8148e, 0x73c737bf, 0x7dce3ab4, 0x6fd52da9, 0x61dc20a2, 0xad766df6, 0xa37f60fd, 0xb16477e0, 0xbf6d7aeb, 0x955259da, 0x9b5b54d1, 0x894043cc, 0x87494ec7, 0xdd3e05ae, 0xd33708a5, 0xc12c1fb8, 0xcf2512b3, 0xe51a3182, 0xeb133c89, 0xf9082b94, 0xf701269f, 0x4de6bd46, 0x43efb04d, 0x51f4a750, 0x5ffdaa5b, 0x75c2896a, 0x7bcb8461, 0x69d0937c, 0x67d99e77, 0x3daed51e, 0x33a7d815, 0x21bccf08, 0x2fb5c203, 0x058ae132, 0x0b83ec39, 0x1998fb24, 0x1791f62f, 0x764dd68d, 0x7844db86, 0x6a5fcc9b, 0x6456c190, 0x4e69e2a1, 0x4060efaa, 0x527bf8b7, 0x5c72f5bc, 0x0605bed5, 0x080cb3de, 0x1a17a4c3, 0x141ea9c8, 0x3e218af9, 0x302887f2, 0x223390ef, 0x2c3a9de4, 0x96dd063d, 0x98d40b36, 0x8acf1c2b, 0x84c61120, 0xaef93211, 0xa0f03f1a, 0xb2eb2807, 0xbce2250c, 0xe6956e65, 0xe89c636e, 0xfa877473, 0xf48e7978, 0xdeb15a49, 0xd0b85742, 0xc2a3405f, 0xccaa4d54, 0x41ecdaf7, 0x4fe5d7fc, 0x5dfec0e1, 0x53f7cdea, 0x79c8eedb, 0x77c1e3d0, 0x65daf4cd, 0x6bd3f9c6, 0x31a4b2af, 0x3fadbfa4, 0x2db6a8b9, 0x23bfa5b2, 0x09808683, 0x07898b88, 0x15929c95, 0x1b9b919e, 0xa17c0a47, 0xaf75074c, 0xbd6e1051, 0xb3671d5a, 0x99583e6b, 0x97513360, 0x854a247d, 0x8b432976, 0xd134621f, 0xdf3d6f14, 0xcd267809, 0xc32f7502, 0xe9105633, 0xe7195b38, 0xf5024c25, 0xfb0b412e, 0x9ad7618c, 0x94de6c87, 0x86c57b9a, 0x88cc7691, 0xa2f355a0, 0xacfa58ab, 0xbee14fb6, 0xb0e842bd, 0xea9f09d4, 0xe49604df, 0xf68d13c2, 0xf8841ec9, 0xd2bb3df8, 0xdcb230f3, 0xcea927ee, 0xc0a02ae5, 0x7a47b13c, 0x744ebc37, 0x6655ab2a, 0x685ca621, 0x42638510, 0x4c6a881b, 0x5e719f06, 0x5078920d, 0x0a0fd964, 0x0406d46f, 0x161dc372, 0x1814ce79, 0x322bed48, 0x3c22e043, 0x2e39f75e, 0x2030fa55, 0xec9ab701, 0xe293ba0a, 0xf088ad17, 0xfe81a01c, 0xd4be832d, 0xdab78e26, 0xc8ac993b, 0xc6a59430, 0x9cd2df59, 0x92dbd252, 0x80c0c54f, 0x8ec9c844, 0xa4f6eb75, 0xaaffe67e, 0xb8e4f163, 0xb6edfc68, 0x0c0a67b1, 0x02036aba, 0x10187da7, 0x1e1170ac, 0x342e539d, 0x3a275e96, 0x283c498b, 0x26354480, 0x7c420fe9, 0x724b02e2, 0x605015ff, 0x6e5918f4, 0x44663bc5, 0x4a6f36ce, 0x587421d3, 0x567d2cd8, 0x37a10c7a, 0x39a80171, 0x2bb3166c, 0x25ba1b67, 0x0f853856, 0x018c355d, 0x13972240, 0x1d9e2f4b, 0x47e96422, 0x49e06929, 0x5bfb7e34, 0x55f2733f, 0x7fcd500e, 0x71c45d05, 0x63df4a18, 0x6dd64713, 0xd731dcca, 0xd938d1c1, 0xcb23c6dc, 0xc52acbd7, 0xef15e8e6, 0xe11ce5ed, 0xf307f2f0, 0xfd0efffb, 0xa779b492, 0xa970b999, 0xbb6bae84, 0xb562a38f, 0x9f5d80be, 0x91548db5, 0x834f9aa8, 0x8d4697a3]);
  547. this._mixCol = new Uint8Array(256);
  548. for (let i = 0; i < 256; i++) {
  549. if (i < 128) {
  550. this._mixCol[i] = i << 1;
  551. } else {
  552. this._mixCol[i] = i << 1 ^ 0x1b;
  553. }
  554. }
  555. this.buffer = new Uint8Array(16);
  556. this.bufferPosition = 0;
  557. }
  558. _expandKey(cipherKey) {
  559. (0, _util.unreachable)("Cannot call `_expandKey` on the base class");
  560. }
  561. _decrypt(input, key) {
  562. let t, u, v;
  563. const state = new Uint8Array(16);
  564. state.set(input);
  565. for (let j = 0, k = this._keySize; j < 16; ++j, ++k) {
  566. state[j] ^= key[k];
  567. }
  568. for (let i = this._cyclesOfRepetition - 1; i >= 1; --i) {
  569. t = state[13];
  570. state[13] = state[9];
  571. state[9] = state[5];
  572. state[5] = state[1];
  573. state[1] = t;
  574. t = state[14];
  575. u = state[10];
  576. state[14] = state[6];
  577. state[10] = state[2];
  578. state[6] = t;
  579. state[2] = u;
  580. t = state[15];
  581. u = state[11];
  582. v = state[7];
  583. state[15] = state[3];
  584. state[11] = t;
  585. state[7] = u;
  586. state[3] = v;
  587. for (let j = 0; j < 16; ++j) {
  588. state[j] = this._inv_s[state[j]];
  589. }
  590. for (let j = 0, k = i * 16; j < 16; ++j, ++k) {
  591. state[j] ^= key[k];
  592. }
  593. for (let j = 0; j < 16; j += 4) {
  594. const s0 = this._mix[state[j]];
  595. const s1 = this._mix[state[j + 1]];
  596. const s2 = this._mix[state[j + 2]];
  597. const s3 = this._mix[state[j + 3]];
  598. t = s0 ^ s1 >>> 8 ^ s1 << 24 ^ s2 >>> 16 ^ s2 << 16 ^ s3 >>> 24 ^ s3 << 8;
  599. state[j] = t >>> 24 & 0xff;
  600. state[j + 1] = t >> 16 & 0xff;
  601. state[j + 2] = t >> 8 & 0xff;
  602. state[j + 3] = t & 0xff;
  603. }
  604. }
  605. t = state[13];
  606. state[13] = state[9];
  607. state[9] = state[5];
  608. state[5] = state[1];
  609. state[1] = t;
  610. t = state[14];
  611. u = state[10];
  612. state[14] = state[6];
  613. state[10] = state[2];
  614. state[6] = t;
  615. state[2] = u;
  616. t = state[15];
  617. u = state[11];
  618. v = state[7];
  619. state[15] = state[3];
  620. state[11] = t;
  621. state[7] = u;
  622. state[3] = v;
  623. for (let j = 0; j < 16; ++j) {
  624. state[j] = this._inv_s[state[j]];
  625. state[j] ^= key[j];
  626. }
  627. return state;
  628. }
  629. _encrypt(input, key) {
  630. const s = this._s;
  631. let t, u, v;
  632. const state = new Uint8Array(16);
  633. state.set(input);
  634. for (let j = 0; j < 16; ++j) {
  635. state[j] ^= key[j];
  636. }
  637. for (let i = 1; i < this._cyclesOfRepetition; i++) {
  638. for (let j = 0; j < 16; ++j) {
  639. state[j] = s[state[j]];
  640. }
  641. v = state[1];
  642. state[1] = state[5];
  643. state[5] = state[9];
  644. state[9] = state[13];
  645. state[13] = v;
  646. v = state[2];
  647. u = state[6];
  648. state[2] = state[10];
  649. state[6] = state[14];
  650. state[10] = v;
  651. state[14] = u;
  652. v = state[3];
  653. u = state[7];
  654. t = state[11];
  655. state[3] = state[15];
  656. state[7] = v;
  657. state[11] = u;
  658. state[15] = t;
  659. for (let j = 0; j < 16; j += 4) {
  660. const s0 = state[j + 0];
  661. const s1 = state[j + 1];
  662. const s2 = state[j + 2];
  663. const s3 = state[j + 3];
  664. t = s0 ^ s1 ^ s2 ^ s3;
  665. state[j + 0] ^= t ^ this._mixCol[s0 ^ s1];
  666. state[j + 1] ^= t ^ this._mixCol[s1 ^ s2];
  667. state[j + 2] ^= t ^ this._mixCol[s2 ^ s3];
  668. state[j + 3] ^= t ^ this._mixCol[s3 ^ s0];
  669. }
  670. for (let j = 0, k = i * 16; j < 16; ++j, ++k) {
  671. state[j] ^= key[k];
  672. }
  673. }
  674. for (let j = 0; j < 16; ++j) {
  675. state[j] = s[state[j]];
  676. }
  677. v = state[1];
  678. state[1] = state[5];
  679. state[5] = state[9];
  680. state[9] = state[13];
  681. state[13] = v;
  682. v = state[2];
  683. u = state[6];
  684. state[2] = state[10];
  685. state[6] = state[14];
  686. state[10] = v;
  687. state[14] = u;
  688. v = state[3];
  689. u = state[7];
  690. t = state[11];
  691. state[3] = state[15];
  692. state[7] = v;
  693. state[11] = u;
  694. state[15] = t;
  695. for (let j = 0, k = this._keySize; j < 16; ++j, ++k) {
  696. state[j] ^= key[k];
  697. }
  698. return state;
  699. }
  700. _decryptBlock2(data, finalize) {
  701. const sourceLength = data.length;
  702. let buffer = this.buffer,
  703. bufferLength = this.bufferPosition;
  704. const result = [];
  705. let iv = this.iv;
  706. for (let i = 0; i < sourceLength; ++i) {
  707. buffer[bufferLength] = data[i];
  708. ++bufferLength;
  709. if (bufferLength < 16) {
  710. continue;
  711. }
  712. const plain = this._decrypt(buffer, this._key);
  713. for (let j = 0; j < 16; ++j) {
  714. plain[j] ^= iv[j];
  715. }
  716. iv = buffer;
  717. result.push(plain);
  718. buffer = new Uint8Array(16);
  719. bufferLength = 0;
  720. }
  721. this.buffer = buffer;
  722. this.bufferLength = bufferLength;
  723. this.iv = iv;
  724. if (result.length === 0) {
  725. return new Uint8Array(0);
  726. }
  727. let outputLength = 16 * result.length;
  728. if (finalize) {
  729. const lastBlock = result[result.length - 1];
  730. let psLen = lastBlock[15];
  731. if (psLen <= 16) {
  732. for (let i = 15, ii = 16 - psLen; i >= ii; --i) {
  733. if (lastBlock[i] !== psLen) {
  734. psLen = 0;
  735. break;
  736. }
  737. }
  738. outputLength -= psLen;
  739. result[result.length - 1] = lastBlock.subarray(0, 16 - psLen);
  740. }
  741. }
  742. const output = new Uint8Array(outputLength);
  743. for (let i = 0, j = 0, ii = result.length; i < ii; ++i, j += 16) {
  744. output.set(result[i], j);
  745. }
  746. return output;
  747. }
  748. decryptBlock(data, finalize, iv = null) {
  749. const sourceLength = data.length;
  750. const buffer = this.buffer;
  751. let bufferLength = this.bufferPosition;
  752. if (iv) {
  753. this.iv = iv;
  754. } else {
  755. for (let i = 0; bufferLength < 16 && i < sourceLength; ++i, ++bufferLength) {
  756. buffer[bufferLength] = data[i];
  757. }
  758. if (bufferLength < 16) {
  759. this.bufferLength = bufferLength;
  760. return new Uint8Array(0);
  761. }
  762. this.iv = buffer;
  763. data = data.subarray(16);
  764. }
  765. this.buffer = new Uint8Array(16);
  766. this.bufferLength = 0;
  767. this.decryptBlock = this._decryptBlock2;
  768. return this.decryptBlock(data, finalize);
  769. }
  770. encrypt(data, iv) {
  771. const sourceLength = data.length;
  772. let buffer = this.buffer,
  773. bufferLength = this.bufferPosition;
  774. const result = [];
  775. if (!iv) {
  776. iv = new Uint8Array(16);
  777. }
  778. for (let i = 0; i < sourceLength; ++i) {
  779. buffer[bufferLength] = data[i];
  780. ++bufferLength;
  781. if (bufferLength < 16) {
  782. continue;
  783. }
  784. for (let j = 0; j < 16; ++j) {
  785. buffer[j] ^= iv[j];
  786. }
  787. const cipher = this._encrypt(buffer, this._key);
  788. iv = cipher;
  789. result.push(cipher);
  790. buffer = new Uint8Array(16);
  791. bufferLength = 0;
  792. }
  793. this.buffer = buffer;
  794. this.bufferLength = bufferLength;
  795. this.iv = iv;
  796. if (result.length === 0) {
  797. return new Uint8Array(0);
  798. }
  799. const outputLength = 16 * result.length;
  800. const output = new Uint8Array(outputLength);
  801. for (let i = 0, j = 0, ii = result.length; i < ii; ++i, j += 16) {
  802. output.set(result[i], j);
  803. }
  804. return output;
  805. }
  806. }
  807. class AES128Cipher extends AESBaseCipher {
  808. constructor(key) {
  809. super();
  810. this._cyclesOfRepetition = 10;
  811. this._keySize = 160;
  812. this._rcon = new Uint8Array([0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91, 0x39, 0x72, 0xe4, 0xd3, 0xbd, 0x61, 0xc2, 0x9f, 0x25, 0x4a, 0x94, 0x33, 0x66, 0xcc, 0x83, 0x1d, 0x3a, 0x74, 0xe8, 0xcb, 0x8d]);
  813. this._key = this._expandKey(key);
  814. }
  815. _expandKey(cipherKey) {
  816. const b = 176;
  817. const s = this._s;
  818. const rcon = this._rcon;
  819. const result = new Uint8Array(b);
  820. result.set(cipherKey);
  821. for (let j = 16, i = 1; j < b; ++i) {
  822. let t1 = result[j - 3];
  823. let t2 = result[j - 2];
  824. let t3 = result[j - 1];
  825. let t4 = result[j - 4];
  826. t1 = s[t1];
  827. t2 = s[t2];
  828. t3 = s[t3];
  829. t4 = s[t4];
  830. t1 = t1 ^ rcon[i];
  831. for (let n = 0; n < 4; ++n) {
  832. result[j] = t1 ^= result[j - 16];
  833. j++;
  834. result[j] = t2 ^= result[j - 16];
  835. j++;
  836. result[j] = t3 ^= result[j - 16];
  837. j++;
  838. result[j] = t4 ^= result[j - 16];
  839. j++;
  840. }
  841. }
  842. return result;
  843. }
  844. }
  845. exports.AES128Cipher = AES128Cipher;
  846. class AES256Cipher extends AESBaseCipher {
  847. constructor(key) {
  848. super();
  849. this._cyclesOfRepetition = 14;
  850. this._keySize = 224;
  851. this._key = this._expandKey(key);
  852. }
  853. _expandKey(cipherKey) {
  854. const b = 240;
  855. const s = this._s;
  856. const result = new Uint8Array(b);
  857. result.set(cipherKey);
  858. let r = 1;
  859. let t1, t2, t3, t4;
  860. for (let j = 32, i = 1; j < b; ++i) {
  861. if (j % 32 === 16) {
  862. t1 = s[t1];
  863. t2 = s[t2];
  864. t3 = s[t3];
  865. t4 = s[t4];
  866. } else if (j % 32 === 0) {
  867. t1 = result[j - 3];
  868. t2 = result[j - 2];
  869. t3 = result[j - 1];
  870. t4 = result[j - 4];
  871. t1 = s[t1];
  872. t2 = s[t2];
  873. t3 = s[t3];
  874. t4 = s[t4];
  875. t1 = t1 ^ r;
  876. if ((r <<= 1) >= 256) {
  877. r = (r ^ 0x1b) & 0xff;
  878. }
  879. }
  880. for (let n = 0; n < 4; ++n) {
  881. result[j] = t1 ^= result[j - 32];
  882. j++;
  883. result[j] = t2 ^= result[j - 32];
  884. j++;
  885. result[j] = t3 ^= result[j - 32];
  886. j++;
  887. result[j] = t4 ^= result[j - 32];
  888. j++;
  889. }
  890. }
  891. return result;
  892. }
  893. }
  894. exports.AES256Cipher = AES256Cipher;
  895. class PDF17 {
  896. checkOwnerPassword(password, ownerValidationSalt, userBytes, ownerPassword) {
  897. var hashData = new Uint8Array(password.length + 56);
  898. hashData.set(password, 0);
  899. hashData.set(ownerValidationSalt, password.length);
  900. hashData.set(userBytes, password.length + ownerValidationSalt.length);
  901. var result = calculateSHA256(hashData, 0, hashData.length);
  902. return (0, _util.isArrayEqual)(result, ownerPassword);
  903. }
  904. checkUserPassword(password, userValidationSalt, userPassword) {
  905. var hashData = new Uint8Array(password.length + 8);
  906. hashData.set(password, 0);
  907. hashData.set(userValidationSalt, password.length);
  908. var result = calculateSHA256(hashData, 0, hashData.length);
  909. return (0, _util.isArrayEqual)(result, userPassword);
  910. }
  911. getOwnerKey(password, ownerKeySalt, userBytes, ownerEncryption) {
  912. var hashData = new Uint8Array(password.length + 56);
  913. hashData.set(password, 0);
  914. hashData.set(ownerKeySalt, password.length);
  915. hashData.set(userBytes, password.length + ownerKeySalt.length);
  916. var key = calculateSHA256(hashData, 0, hashData.length);
  917. var cipher = new AES256Cipher(key);
  918. return cipher.decryptBlock(ownerEncryption, false, new Uint8Array(16));
  919. }
  920. getUserKey(password, userKeySalt, userEncryption) {
  921. var hashData = new Uint8Array(password.length + 8);
  922. hashData.set(password, 0);
  923. hashData.set(userKeySalt, password.length);
  924. var key = calculateSHA256(hashData, 0, hashData.length);
  925. var cipher = new AES256Cipher(key);
  926. return cipher.decryptBlock(userEncryption, false, new Uint8Array(16));
  927. }
  928. }
  929. exports.PDF17 = PDF17;
  930. var PDF20 = function PDF20Closure() {
  931. function calculatePDF20Hash(password, input, userBytes) {
  932. var k = calculateSHA256(input, 0, input.length).subarray(0, 32);
  933. var e = [0];
  934. var i = 0;
  935. while (i < 64 || e[e.length - 1] > i - 32) {
  936. const combinedLength = password.length + k.length + userBytes.length,
  937. combinedArray = new Uint8Array(combinedLength);
  938. let writeOffset = 0;
  939. combinedArray.set(password, writeOffset);
  940. writeOffset += password.length;
  941. combinedArray.set(k, writeOffset);
  942. writeOffset += k.length;
  943. combinedArray.set(userBytes, writeOffset);
  944. var k1 = new Uint8Array(combinedLength * 64);
  945. for (var j = 0, pos = 0; j < 64; j++, pos += combinedLength) {
  946. k1.set(combinedArray, pos);
  947. }
  948. var cipher = new AES128Cipher(k.subarray(0, 16));
  949. e = cipher.encrypt(k1, k.subarray(16, 32));
  950. var remainder = 0;
  951. for (var z = 0; z < 16; z++) {
  952. remainder *= 256 % 3;
  953. remainder %= 3;
  954. remainder += (e[z] >>> 0) % 3;
  955. remainder %= 3;
  956. }
  957. if (remainder === 0) {
  958. k = calculateSHA256(e, 0, e.length);
  959. } else if (remainder === 1) {
  960. k = calculateSHA384(e, 0, e.length);
  961. } else if (remainder === 2) {
  962. k = calculateSHA512(e, 0, e.length);
  963. }
  964. i++;
  965. }
  966. return k.subarray(0, 32);
  967. }
  968. class PDF20 {
  969. hash(password, concatBytes, userBytes) {
  970. return calculatePDF20Hash(password, concatBytes, userBytes);
  971. }
  972. checkOwnerPassword(password, ownerValidationSalt, userBytes, ownerPassword) {
  973. var hashData = new Uint8Array(password.length + 56);
  974. hashData.set(password, 0);
  975. hashData.set(ownerValidationSalt, password.length);
  976. hashData.set(userBytes, password.length + ownerValidationSalt.length);
  977. var result = calculatePDF20Hash(password, hashData, userBytes);
  978. return (0, _util.isArrayEqual)(result, ownerPassword);
  979. }
  980. checkUserPassword(password, userValidationSalt, userPassword) {
  981. var hashData = new Uint8Array(password.length + 8);
  982. hashData.set(password, 0);
  983. hashData.set(userValidationSalt, password.length);
  984. var result = calculatePDF20Hash(password, hashData, []);
  985. return (0, _util.isArrayEqual)(result, userPassword);
  986. }
  987. getOwnerKey(password, ownerKeySalt, userBytes, ownerEncryption) {
  988. var hashData = new Uint8Array(password.length + 56);
  989. hashData.set(password, 0);
  990. hashData.set(ownerKeySalt, password.length);
  991. hashData.set(userBytes, password.length + ownerKeySalt.length);
  992. var key = calculatePDF20Hash(password, hashData, userBytes);
  993. var cipher = new AES256Cipher(key);
  994. return cipher.decryptBlock(ownerEncryption, false, new Uint8Array(16));
  995. }
  996. getUserKey(password, userKeySalt, userEncryption) {
  997. var hashData = new Uint8Array(password.length + 8);
  998. hashData.set(password, 0);
  999. hashData.set(userKeySalt, password.length);
  1000. var key = calculatePDF20Hash(password, hashData, []);
  1001. var cipher = new AES256Cipher(key);
  1002. return cipher.decryptBlock(userEncryption, false, new Uint8Array(16));
  1003. }
  1004. }
  1005. return PDF20;
  1006. }();
  1007. exports.PDF20 = PDF20;
  1008. class CipherTransform {
  1009. constructor(stringCipherConstructor, streamCipherConstructor) {
  1010. this.StringCipherConstructor = stringCipherConstructor;
  1011. this.StreamCipherConstructor = streamCipherConstructor;
  1012. }
  1013. createStream(stream, length) {
  1014. var cipher = new this.StreamCipherConstructor();
  1015. return new _stream.DecryptStream(stream, length, function cipherTransformDecryptStream(data, finalize) {
  1016. return cipher.decryptBlock(data, finalize);
  1017. });
  1018. }
  1019. decryptString(s) {
  1020. var cipher = new this.StringCipherConstructor();
  1021. var data = (0, _util.stringToBytes)(s);
  1022. data = cipher.decryptBlock(data, true);
  1023. return (0, _util.bytesToString)(data);
  1024. }
  1025. encryptString(s) {
  1026. const cipher = new this.StringCipherConstructor();
  1027. if (cipher instanceof AESBaseCipher) {
  1028. const strLen = s.length;
  1029. const pad = 16 - strLen % 16;
  1030. if (pad !== 16) {
  1031. s = s.padEnd(16 * Math.ceil(strLen / 16), String.fromCharCode(pad));
  1032. }
  1033. const iv = new Uint8Array(16);
  1034. if (typeof crypto !== "undefined") {
  1035. crypto.getRandomValues(iv);
  1036. } else {
  1037. for (let i = 0; i < 16; i++) {
  1038. iv[i] = Math.floor(256 * Math.random());
  1039. }
  1040. }
  1041. let data = (0, _util.stringToBytes)(s);
  1042. data = cipher.encrypt(data, iv);
  1043. const buf = new Uint8Array(16 + data.length);
  1044. buf.set(iv);
  1045. buf.set(data, 16);
  1046. return (0, _util.bytesToString)(buf);
  1047. }
  1048. let data = (0, _util.stringToBytes)(s);
  1049. data = cipher.encrypt(data);
  1050. return (0, _util.bytesToString)(data);
  1051. }
  1052. }
  1053. var CipherTransformFactory = function CipherTransformFactoryClosure() {
  1054. var defaultPasswordBytes = new Uint8Array([0x28, 0xBF, 0x4E, 0x5E, 0x4E, 0x75, 0x8A, 0x41, 0x64, 0x00, 0x4E, 0x56, 0xFF, 0xFA, 0x01, 0x08, 0x2E, 0x2E, 0x00, 0xB6, 0xD0, 0x68, 0x3E, 0x80, 0x2F, 0x0C, 0xA9, 0xFE, 0x64, 0x53, 0x69, 0x7A]);
  1055. function createEncryptionKey20(revision, password, ownerPassword, ownerValidationSalt, ownerKeySalt, uBytes, userPassword, userValidationSalt, userKeySalt, ownerEncryption, userEncryption, perms) {
  1056. if (password) {
  1057. var passwordLength = Math.min(127, password.length);
  1058. password = password.subarray(0, passwordLength);
  1059. } else {
  1060. password = [];
  1061. }
  1062. var pdfAlgorithm;
  1063. if (revision === 6) {
  1064. pdfAlgorithm = new PDF20();
  1065. } else {
  1066. pdfAlgorithm = new PDF17();
  1067. }
  1068. if (pdfAlgorithm.checkUserPassword(password, userValidationSalt, userPassword)) {
  1069. return pdfAlgorithm.getUserKey(password, userKeySalt, userEncryption);
  1070. } else if (password.length && pdfAlgorithm.checkOwnerPassword(password, ownerValidationSalt, uBytes, ownerPassword)) {
  1071. return pdfAlgorithm.getOwnerKey(password, ownerKeySalt, uBytes, ownerEncryption);
  1072. }
  1073. return null;
  1074. }
  1075. function prepareKeyData(fileId, password, ownerPassword, userPassword, flags, revision, keyLength, encryptMetadata) {
  1076. var hashDataSize = 40 + ownerPassword.length + fileId.length;
  1077. var hashData = new Uint8Array(hashDataSize),
  1078. i = 0,
  1079. j,
  1080. n;
  1081. if (password) {
  1082. n = Math.min(32, password.length);
  1083. for (; i < n; ++i) {
  1084. hashData[i] = password[i];
  1085. }
  1086. }
  1087. j = 0;
  1088. while (i < 32) {
  1089. hashData[i++] = defaultPasswordBytes[j++];
  1090. }
  1091. for (j = 0, n = ownerPassword.length; j < n; ++j) {
  1092. hashData[i++] = ownerPassword[j];
  1093. }
  1094. hashData[i++] = flags & 0xff;
  1095. hashData[i++] = flags >> 8 & 0xff;
  1096. hashData[i++] = flags >> 16 & 0xff;
  1097. hashData[i++] = flags >>> 24 & 0xff;
  1098. for (j = 0, n = fileId.length; j < n; ++j) {
  1099. hashData[i++] = fileId[j];
  1100. }
  1101. if (revision >= 4 && !encryptMetadata) {
  1102. hashData[i++] = 0xff;
  1103. hashData[i++] = 0xff;
  1104. hashData[i++] = 0xff;
  1105. hashData[i++] = 0xff;
  1106. }
  1107. var hash = calculateMD5(hashData, 0, i);
  1108. var keyLengthInBytes = keyLength >> 3;
  1109. if (revision >= 3) {
  1110. for (j = 0; j < 50; ++j) {
  1111. hash = calculateMD5(hash, 0, keyLengthInBytes);
  1112. }
  1113. }
  1114. var encryptionKey = hash.subarray(0, keyLengthInBytes);
  1115. var cipher, checkData;
  1116. if (revision >= 3) {
  1117. for (i = 0; i < 32; ++i) {
  1118. hashData[i] = defaultPasswordBytes[i];
  1119. }
  1120. for (j = 0, n = fileId.length; j < n; ++j) {
  1121. hashData[i++] = fileId[j];
  1122. }
  1123. cipher = new ARCFourCipher(encryptionKey);
  1124. checkData = cipher.encryptBlock(calculateMD5(hashData, 0, i));
  1125. n = encryptionKey.length;
  1126. var derivedKey = new Uint8Array(n),
  1127. k;
  1128. for (j = 1; j <= 19; ++j) {
  1129. for (k = 0; k < n; ++k) {
  1130. derivedKey[k] = encryptionKey[k] ^ j;
  1131. }
  1132. cipher = new ARCFourCipher(derivedKey);
  1133. checkData = cipher.encryptBlock(checkData);
  1134. }
  1135. for (j = 0, n = checkData.length; j < n; ++j) {
  1136. if (userPassword[j] !== checkData[j]) {
  1137. return null;
  1138. }
  1139. }
  1140. } else {
  1141. cipher = new ARCFourCipher(encryptionKey);
  1142. checkData = cipher.encryptBlock(defaultPasswordBytes);
  1143. for (j = 0, n = checkData.length; j < n; ++j) {
  1144. if (userPassword[j] !== checkData[j]) {
  1145. return null;
  1146. }
  1147. }
  1148. }
  1149. return encryptionKey;
  1150. }
  1151. function decodeUserPassword(password, ownerPassword, revision, keyLength) {
  1152. var hashData = new Uint8Array(32),
  1153. i = 0,
  1154. j,
  1155. n;
  1156. n = Math.min(32, password.length);
  1157. for (; i < n; ++i) {
  1158. hashData[i] = password[i];
  1159. }
  1160. j = 0;
  1161. while (i < 32) {
  1162. hashData[i++] = defaultPasswordBytes[j++];
  1163. }
  1164. var hash = calculateMD5(hashData, 0, i);
  1165. var keyLengthInBytes = keyLength >> 3;
  1166. if (revision >= 3) {
  1167. for (j = 0; j < 50; ++j) {
  1168. hash = calculateMD5(hash, 0, hash.length);
  1169. }
  1170. }
  1171. var cipher, userPassword;
  1172. if (revision >= 3) {
  1173. userPassword = ownerPassword;
  1174. var derivedKey = new Uint8Array(keyLengthInBytes),
  1175. k;
  1176. for (j = 19; j >= 0; j--) {
  1177. for (k = 0; k < keyLengthInBytes; ++k) {
  1178. derivedKey[k] = hash[k] ^ j;
  1179. }
  1180. cipher = new ARCFourCipher(derivedKey);
  1181. userPassword = cipher.encryptBlock(userPassword);
  1182. }
  1183. } else {
  1184. cipher = new ARCFourCipher(hash.subarray(0, keyLengthInBytes));
  1185. userPassword = cipher.encryptBlock(ownerPassword);
  1186. }
  1187. return userPassword;
  1188. }
  1189. var identityName = _primitives.Name.get("Identity");
  1190. function buildObjectKey(num, gen, encryptionKey, isAes = false) {
  1191. var key = new Uint8Array(encryptionKey.length + 9),
  1192. i,
  1193. n;
  1194. for (i = 0, n = encryptionKey.length; i < n; ++i) {
  1195. key[i] = encryptionKey[i];
  1196. }
  1197. key[i++] = num & 0xff;
  1198. key[i++] = num >> 8 & 0xff;
  1199. key[i++] = num >> 16 & 0xff;
  1200. key[i++] = gen & 0xff;
  1201. key[i++] = gen >> 8 & 0xff;
  1202. if (isAes) {
  1203. key[i++] = 0x73;
  1204. key[i++] = 0x41;
  1205. key[i++] = 0x6c;
  1206. key[i++] = 0x54;
  1207. }
  1208. var hash = calculateMD5(key, 0, i);
  1209. return hash.subarray(0, Math.min(encryptionKey.length + 5, 16));
  1210. }
  1211. function buildCipherConstructor(cf, name, num, gen, key) {
  1212. if (!(0, _primitives.isName)(name)) {
  1213. throw new _util.FormatError("Invalid crypt filter name.");
  1214. }
  1215. var cryptFilter = cf.get(name.name);
  1216. var cfm;
  1217. if (cryptFilter !== null && cryptFilter !== undefined) {
  1218. cfm = cryptFilter.get("CFM");
  1219. }
  1220. if (!cfm || cfm.name === "None") {
  1221. return function cipherTransformFactoryBuildCipherConstructorNone() {
  1222. return new NullCipher();
  1223. };
  1224. }
  1225. if (cfm.name === "V2") {
  1226. return function cipherTransformFactoryBuildCipherConstructorV2() {
  1227. return new ARCFourCipher(buildObjectKey(num, gen, key, false));
  1228. };
  1229. }
  1230. if (cfm.name === "AESV2") {
  1231. return function cipherTransformFactoryBuildCipherConstructorAESV2() {
  1232. return new AES128Cipher(buildObjectKey(num, gen, key, true));
  1233. };
  1234. }
  1235. if (cfm.name === "AESV3") {
  1236. return function cipherTransformFactoryBuildCipherConstructorAESV3() {
  1237. return new AES256Cipher(key);
  1238. };
  1239. }
  1240. throw new _util.FormatError("Unknown crypto method");
  1241. }
  1242. class CipherTransformFactory {
  1243. constructor(dict, fileId, password) {
  1244. var filter = dict.get("Filter");
  1245. if (!(0, _primitives.isName)(filter, "Standard")) {
  1246. throw new _util.FormatError("unknown encryption method");
  1247. }
  1248. this.dict = dict;
  1249. var algorithm = dict.get("V");
  1250. if (!Number.isInteger(algorithm) || algorithm !== 1 && algorithm !== 2 && algorithm !== 4 && algorithm !== 5) {
  1251. throw new _util.FormatError("unsupported encryption algorithm");
  1252. }
  1253. this.algorithm = algorithm;
  1254. var keyLength = dict.get("Length");
  1255. if (!keyLength) {
  1256. if (algorithm <= 3) {
  1257. keyLength = 40;
  1258. } else {
  1259. var cfDict = dict.get("CF");
  1260. var streamCryptoName = dict.get("StmF");
  1261. if ((0, _primitives.isDict)(cfDict) && (0, _primitives.isName)(streamCryptoName)) {
  1262. cfDict.suppressEncryption = true;
  1263. var handlerDict = cfDict.get(streamCryptoName.name);
  1264. keyLength = handlerDict && handlerDict.get("Length") || 128;
  1265. if (keyLength < 40) {
  1266. keyLength <<= 3;
  1267. }
  1268. }
  1269. }
  1270. }
  1271. if (!Number.isInteger(keyLength) || keyLength < 40 || keyLength % 8 !== 0) {
  1272. throw new _util.FormatError("invalid key length");
  1273. }
  1274. var ownerPassword = (0, _util.stringToBytes)(dict.get("O")).subarray(0, 32);
  1275. var userPassword = (0, _util.stringToBytes)(dict.get("U")).subarray(0, 32);
  1276. var flags = dict.get("P");
  1277. var revision = dict.get("R");
  1278. var encryptMetadata = (algorithm === 4 || algorithm === 5) && dict.get("EncryptMetadata") !== false;
  1279. this.encryptMetadata = encryptMetadata;
  1280. var fileIdBytes = (0, _util.stringToBytes)(fileId);
  1281. var passwordBytes;
  1282. if (password) {
  1283. if (revision === 6) {
  1284. try {
  1285. password = (0, _util.utf8StringToString)(password);
  1286. } catch (ex) {
  1287. (0, _util.warn)("CipherTransformFactory: " + "Unable to convert UTF8 encoded password.");
  1288. }
  1289. }
  1290. passwordBytes = (0, _util.stringToBytes)(password);
  1291. }
  1292. var encryptionKey;
  1293. if (algorithm !== 5) {
  1294. encryptionKey = prepareKeyData(fileIdBytes, passwordBytes, ownerPassword, userPassword, flags, revision, keyLength, encryptMetadata);
  1295. } else {
  1296. var ownerValidationSalt = (0, _util.stringToBytes)(dict.get("O")).subarray(32, 40);
  1297. var ownerKeySalt = (0, _util.stringToBytes)(dict.get("O")).subarray(40, 48);
  1298. var uBytes = (0, _util.stringToBytes)(dict.get("U")).subarray(0, 48);
  1299. var userValidationSalt = (0, _util.stringToBytes)(dict.get("U")).subarray(32, 40);
  1300. var userKeySalt = (0, _util.stringToBytes)(dict.get("U")).subarray(40, 48);
  1301. var ownerEncryption = (0, _util.stringToBytes)(dict.get("OE"));
  1302. var userEncryption = (0, _util.stringToBytes)(dict.get("UE"));
  1303. var perms = (0, _util.stringToBytes)(dict.get("Perms"));
  1304. encryptionKey = createEncryptionKey20(revision, passwordBytes, ownerPassword, ownerValidationSalt, ownerKeySalt, uBytes, userPassword, userValidationSalt, userKeySalt, ownerEncryption, userEncryption, perms);
  1305. }
  1306. if (!encryptionKey && !password) {
  1307. throw new _util.PasswordException("No password given", _util.PasswordResponses.NEED_PASSWORD);
  1308. } else if (!encryptionKey && password) {
  1309. var decodedPassword = decodeUserPassword(passwordBytes, ownerPassword, revision, keyLength);
  1310. encryptionKey = prepareKeyData(fileIdBytes, decodedPassword, ownerPassword, userPassword, flags, revision, keyLength, encryptMetadata);
  1311. }
  1312. if (!encryptionKey) {
  1313. throw new _util.PasswordException("Incorrect Password", _util.PasswordResponses.INCORRECT_PASSWORD);
  1314. }
  1315. this.encryptionKey = encryptionKey;
  1316. if (algorithm >= 4) {
  1317. var cf = dict.get("CF");
  1318. if ((0, _primitives.isDict)(cf)) {
  1319. cf.suppressEncryption = true;
  1320. }
  1321. this.cf = cf;
  1322. this.stmf = dict.get("StmF") || identityName;
  1323. this.strf = dict.get("StrF") || identityName;
  1324. this.eff = dict.get("EFF") || this.stmf;
  1325. }
  1326. }
  1327. createCipherTransform(num, gen) {
  1328. if (this.algorithm === 4 || this.algorithm === 5) {
  1329. return new CipherTransform(buildCipherConstructor(this.cf, this.stmf, num, gen, this.encryptionKey), buildCipherConstructor(this.cf, this.strf, num, gen, this.encryptionKey));
  1330. }
  1331. var key = buildObjectKey(num, gen, this.encryptionKey, false);
  1332. var cipherConstructor = function buildCipherCipherConstructor() {
  1333. return new ARCFourCipher(key);
  1334. };
  1335. return new CipherTransform(cipherConstructor, cipherConstructor);
  1336. }
  1337. }
  1338. return CipherTransformFactory;
  1339. }();
  1340. exports.CipherTransformFactory = CipherTransformFactory;