https://www.greateasterngeneral.com/etc/clientlibs/gegeneral_sg/js/jsencrypt.js

1var JSEncryptExports = {};
2(function(exports) {
3// Copyright (c) 2005  Tom Wu
4// All Rights Reserved.
5// See "LICENSE" for details.
6
7// Basic JavaScript BN library - subset useful for RSA encryption.
8
9// Bits per digit
10var dbits;
11
12// JavaScript engine analysis
13var canary = 0xdeadbeefcafe;
14var j_lm = ((canary&0xffffff)==0xefcafe);
15
16// (public) Constructor
17function BigInteger(a,b,c) {
18  if(a != null)
19    if("number" == typeof a) this.fromNumber(a,b,c);
20    else if(b == null && "string" != typeof a) this.fromString(a,256);
21    else this.fromString(a,b);
22}
23
24// return new, unset BigInteger
25function nbi() { return new BigInteger(null); }
26
27// am: Compute w_j += (x*this_i), propagate carries,
28// c is initial carry, returns final carry.
29// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
30// We need to select the fastest one that works in this environment.
31
32// am1: use a single mult and divide to get the high bits,
33// max digit bits should be 26 because
34// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
35function am1(i,x,w,j,c,n) {
36  while(--n >= 0) {
37    var v = x*this[i++]+w[j]+c;
38    c = Math.floor(v/0x4000000);
39    w[j++] = v&0x3ffffff;
40  }
41  return c;
42}
43// am2 avoids a big mult-and-extract completely.
44// Max digit bits should be <= 30 because we do bitwise ops
45// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
46function am2(i,x,w,j,c,n) {
47  var xl = x&0x7fff, xh = x>>15;
48  while(--n >= 0) {
49    var l = this[i]&0x7fff;
50    var h = this[i++]>>15;
51    var m = xh*l+h*xl;
52    l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);
53    c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);
54    w[j++] = l&0x3fffffff;
55  }
56  return c;
57}
58// Alternately, set max digit bits to 28 since some
59// browsers slow down when dealing with 32-bit numbers.
60function am3(i,x,w,j,c,n) {
61  var xl = x&0x3fff, xh = x>>14;
62  while(--n >= 0) {
63    var l = this[i]&0x3fff;
64    var h = this[i++]>>14;
65    var m = xh*l+h*xl;
66    l = xl*l+((m&0x3fff)<<14)+w[j]+c;
67    c = (l>>28)+(m>>14)+xh*h;
68    w[j++] = l&0xfffffff;
69  }
70  return c;
71}
72if(j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
73  BigInteger.prototype.am = am2;
74  dbits = 30;
75}
76else if(j_lm && (navigator.appName != "Netscape")) {
77  BigInteger.prototype.am = am1;
78  dbits = 26;
79}
80else { // Mozilla/Netscape seems to prefer am3
81  BigInteger.prototype.am = am3;
82  dbits = 28;
83}
84
85BigInteger.prototype.DB = dbits;
86BigInteger.prototype.DM = ((1<<dbits)-1);
87BigInteger.prototype.DV = (1<<dbits);
88
89var BI_FP = 52;
90BigInteger.prototype.FV = Math.pow(2,BI_FP);
91BigInteger.prototype.F1 = BI_FP-dbits;
92BigInteger.prototype.F2 = 2*dbits-BI_FP;
93
94// Digit conversions
95var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
96var BI_RC = new Array();
97var rr,vv;
98rr = "0".charCodeAt(0);
99for(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
100rr = "a".charCodeAt(0);
101for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
102rr = "A".charCodeAt(0);
103for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
104
105function int2char(n) { return BI_RM.charAt(n); }
106function intAt(s,i) {
107  var c = BI_RC[s.charCodeAt(i)];
108  return (c==null)?-1:c;
109}
110
111// (protected) copy this to r
112function bnpCopyTo(r) {
113  for(var i = this.t-1; i >= 0; --i) r[i] = this[i];
114  r.t = this.t;
115  r.s = this.s;
116}
117
118// (protected) set from integer value x, -DV <= x < DV
119function bnpFromInt(x) {
120  this.t = 1;
121  this.s = (x<0)?-1:0;
122  if(x > 0) this[0] = x;
123  else if(x < -1) this[0] = x+this.DV;
124  else this.t = 0;
125}
126
127// return bigint initialized to value
128function nbv(i) { var r = nbi(); r.fromInt(i); return r; }
129
130// (protected) set from string and radix
131function bnpFromString(s,b) {
132  var k;
133  if(b == 16) k = 4;
134  else if(b == 8) k = 3;
135  else if(b == 256) k = 8; // byte array
136  else if(b == 2) k = 1;
137  else if(b == 32) k = 5;
138  else if(b == 4) k = 2;
139  else { this.fromRadix(s,b); return; }
140  this.t = 0;
141  this.s = 0;
142  var i = s.length, mi = false, sh = 0;
143  while(--i >= 0) {
144    var x = (k==8)?s[i]&0xff:intAt(s,i);
145    if(x < 0) {
146      if(s.charAt(i) == "-") mi = true;
147      continue;
148    }
149    mi = false;
150    if(sh == 0)
151      this[this.t++] = x;
152    else if(sh+k > this.DB) {
153      this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;
154      this[this.t++] = (x>>(this.DB-sh));
155    }
156    else
157      this[this.t-1] |= x<<sh;
158    sh += k;
159    if(sh >= this.DB) sh -= this.DB;
160  }
161  if(k == 8 && (s[0]&0x80) != 0) {
162    this.s = -1;
163    if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;
164  }
165  this.clamp();
166  if(mi) BigInteger.ZERO.subTo(this,this);
167}
168
169// (protected) clamp off excess high words
170function bnpClamp() {
171  var c = this.s&this.DM;
172  while(this.t > 0 && this[this.t-1] == c) --this.t;
173}
174
175// (public) return string representation in given radix
176function bnToString(b) {
177  if(this.s < 0) return "-"+this.negate().toString(b);
178  var k;
179  if(b == 16) k = 4;
180  else if(b == 8) k = 3;
181  else if(b == 2) k = 1;
182  else if(b == 32) k = 5;
183  else if(b == 4) k = 2;
184  else return this.toRadix(b);
185  var km = (1<<k)-1, d, m = false, r = "", i = this.t;
186  var p = this.DB-(i*this.DB)%k;
187  if(i-- > 0) {
188    if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }
189    while(i >= 0) {
190      if(p < k) {
191        d = (this[i]&((1<<p)-1))<<(k-p);
192        d |= this[--i]>>(p+=this.DB-k);
193      }
194      else {
195        d = (this[i]>>(p-=k))&km;
196        if(p <= 0) { p += this.DB; --i; }
197      }
198      if(d > 0) m = true;
199      if(m) r += int2char(d);
200    }
201  }
202  return m?r:"0";
203}
204
205// (public) -this
206function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }
207
208// (public) |this|
209function bnAbs() { return (this.s<0)?this.negate():this; }
210
211// (public) return + if this > a, - if this < a, 0 if equal
212function bnCompareTo(a) {
213  var r = this.s-a.s;
214  if(r != 0) return r;
215  var i = this.t;
216  r = i-a.t;
217  if(r != 0) return (this.s<0)?-r:r;
218  while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;
219  return 0;
220}
221
222// returns bit length of the integer x
223function nbits(x) {
224  var r = 1, t;
225  if((t=x>>>16) != 0) { x = t; r += 16; }
226  if((t=x>>8) != 0) { x = t; r += 8; }
227  if((t=x>>4) != 0) { x = t; r += 4; }
228  if((t=x>>2) != 0) { x = t; r += 2; }
229  if((t=x>>1) != 0) { x = t; r += 1; }
230  return r;
231}
232
233// (public) return the number of bits in "this"
234function bnBitLength() {
235  if(this.t <= 0) return 0;
236  return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));
237}
238
239// (protected) r = this << n*DB
240function bnpDLShiftTo(n,r) {
241  var i;
242  for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];
243  for(i = n-1; i >= 0; --i) r[i] = 0;
244  r.t = this.t+n;
245  r.s = this.s;
246}
247
248// (protected) r = this >> n*DB
249function bnpDRShiftTo(n,r) {
250  for(var i = n; i < this.t; ++i) r[i-n] = this[i];
251  r.t = Math.max(this.t-n,0);
252  r.s = this.s;
253}
254
255// (protected) r = this << n
256function bnpLShiftTo(n,r) {
257  var bs = n%this.DB;
258  var cbs = this.DB-bs;
259  var bm = (1<<cbs)-1;
260  var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;
261  for(i = this.t-1; i >= 0; --i) {
262    r[i+ds+1] = (this[i]>>cbs)|c;
263    c = (this[i]&bm)<<bs;
264  }
265  for(i = ds-1; i >= 0; --i) r[i] = 0;
266  r[ds] = c;
267  r.t = this.t+ds+1;
268  r.s = this.s;
269  r.clamp();
270}
271
272// (protected) r = this >> n
273function bnpRShiftTo(n,r) {
274  r.s = this.s;
275  var ds = Math.floor(n/this.DB);
276  if(ds >= this.t) { r.t = 0; return; }
277  var bs = n%this.DB;
278  var cbs = this.DB-bs;
279  var bm = (1<<bs)-1;
280  r[0] = this[ds]>>bs;
281  for(var i = ds+1; i < this.t; ++i) {
282    r[i-ds-1] |= (this[i]&bm)<<cbs;
283    r[i-ds] = this[i]>>bs;
284  }
285  if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;
286  r.t = this.t-ds;
287  r.clamp();
288}
289
290// (protected) r = this - a
291function bnpSubTo(a,r) {
292  var i = 0, c = 0, m = Math.min(a.t,this.t);
293  while(i < m) {
294    c += this[i]-a[i];
295    r[i++] = c&this.DM;
296    c >>= this.DB;
297  }
298  if(a.t < this.t) {
299    c -= a.s;
300    while(i < this.t) {
301      c += this[i];
302      r[i++] = c&this.DM;
303      c >>= this.DB;
304    }
305    c += this.s;
306  }
307  else {
308    c += this.s;
309    while(i < a.t) {
310      c -= a[i];
311      r[i++] = c&this.DM;
312      c >>= this.DB;
313    }
314    c -= a.s;
315  }
316  r.s = (c<0)?-1:0;
317  if(c < -1) r[i++] = this.DV+c;
318  else if(c > 0) r[i++] = c;
319  r.t = i;
320  r.clamp();
321}
322
323// (protected) r = this * a, r != this,a (HAC 14.12)
324// "this" should be the larger one if appropriate.
325function bnpMultiplyTo(a,r) {
326  var x = this.abs(), y = a.abs();
327  var i = x.t;
328  r.t = i+y.t;
329  while(--i >= 0) r[i] = 0;
330  for(i = 0; i < y.t; ++i) r[i+x.t] = x.am(0,y[i],r,i,0,x.t);
331  r.s = 0;
332  r.clamp();
333  if(this.s != a.s) BigInteger.ZERO.subTo(r,r);
334}
335
336// (protected) r = this^2, r != this (HAC 14.16)
337function bnpSquareTo(r) {
338  var x = this.abs();
339  var i = r.t = 2*x.t;
340  while(--i >= 0) r[i] = 0;
341  for(i = 0; i < x.t-1; ++i) {
342    var c = x.am(i,x[i],r,2*i,0,1);
343    if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {
344      r[i+x.t] -= x.DV;
345      r[i+x.t+1] = 1;
346    }
347  }
348  if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1);
349  r.s = 0;
350  r.clamp();
351}
352
353// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
354// r != q, this != m.  q or r may be null.
355function bnpDivRemTo(m,q,r) {
356  var pm = m.abs();
357  if(pm.t <= 0) return;
358  var pt = this.abs();
359  if(pt.t < pm.t) {
360    if(q != null) q.fromInt(0);
361    if(r != null) this.copyTo(r);
362    return;
363  }
364  if(r == null) r = nbi();
365  var y = nbi(), ts = this.s, ms = m.s;
366  var nsh = this.DB-nbits(pm[pm.t-1]);	// normalize modulus
367  if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); }
368  else { pm.copyTo(y); pt.copyTo(r); }
369  var ys = y.t;
370  var y0 = y[ys-1];
371  if(y0 == 0) return;
372  var yt = y0*(1<<this.F1)+((ys>1)?y[ys-2]>>this.F2:0);
373  var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;
374  var i = r.t, j = i-ys, t = (q==null)?nbi():q;
375  y.dlShiftTo(j,t);
376  if(r.compareTo(t) >= 0) {
377    r[r.t++] = 1;
378    r.subTo(t,r);
379  }
380  BigInteger.ONE.dlShiftTo(ys,t);
381  t.subTo(y,y);	// "negative" y so we can replace sub with am later
382  while(y.t < ys) y[y.t++] = 0;
383  while(--j >= 0) {
384    // Estimate quotient digit
385    var qd = (r[--i]==y0)?this.DM:Math.floor(r[i]*d1+(r[i-1]+e)*d2);
386    if((r[i]+=y.am(0,qd,r,j,0,ys)) < qd) {	// Try it out
387      y.dlShiftTo(j,t);
388      r.subTo(t,r);
389      while(r[i] < --qd) r.subTo(t,r);
390    }
391  }
392  if(q != null) {
393    r.drShiftTo(ys,q);
394    if(ts != ms) BigInteger.ZERO.subTo(q,q);
395  }
396  r.t = ys;
397  r.clamp();
398  if(nsh > 0) r.rShiftTo(nsh,r);	// Denormalize remainder
399  if(ts < 0) BigInteger.ZERO.subTo(r,r);
400}
401
402// (public) this mod a
403function bnMod(a) {
404  var r = nbi();
405  this.abs().divRemTo(a,null,r);
406  if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);
407  return r;
408}
409
410// Modular reduction using "classic" algorithm
411function Classic(m) { this.m = m; }
412function cConvert(x) {
413  if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
414  else return x;
415}
416function cRevert(x) { return x; }
417function cReduce(x) { x.divRemTo(this.m,null,x); }
418function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
419function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
420
421Classic.prototype.convert = cConvert;
422Classic.prototype.revert = cRevert;
423Classic.prototype.reduce = cReduce;
424Classic.prototype.mulTo = cMulTo;
425Classic.prototype.sqrTo = cSqrTo;
426
427// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
428// justification:
429//         xy == 1 (mod m)
430//         xy =  1+km
431//   xy(2-xy) = (1+km)(1-km)
432// x[y(2-xy)] = 1-k^2m^2
433// x[y(2-xy)] == 1 (mod m^2)
434// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
435// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
436// JS multiply "overflows" differently from C/C++, so care is needed here.
437function bnpInvDigit() {
438  if(this.t < 1) return 0;
439  var x = this[0];
440  if((x&1) == 0) return 0;
441  var y = x&3;		// y == 1/x mod 2^2
442  y = (y*(2-(x&0xf)*y))&0xf;	// y == 1/x mod 2^4
443  y = (y*(2-(x&0xff)*y))&0xff;	// y == 1/x mod 2^8
444  y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;	// y == 1/x mod 2^16
445  // last step - calculate inverse mod DV directly;
446  // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
447  y = (y*(2-x*y%this.DV))%this.DV;		// y == 1/x mod 2^dbits
448  // we really want the negative inverse, and -DV < y < DV
449  return (y>0)?this.DV-y:-y;
450}
451
452// Montgomery reduction
453function Montgomery(m) {
454  this.m = m;
455  this.mp = m.invDigit();
456  this.mpl = this.mp&0x7fff;
457  this.mph = this.mp>>15;
458  this.um = (1<<(m.DB-15))-1;
459  this.mt2 = 2*m.t;
460}
461
462// xR mod m
463function montConvert(x) {
464  var r = nbi();
465  x.abs().dlShiftTo(this.m.t,r);
466  r.divRemTo(this.m,null,r);
467  if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);
468  return r;
469}
470
471// x/R mod m
472function montRevert(x) {
473  var r = nbi();
474  x.copyTo(r);
475  this.reduce(r);
476  return r;
477}
478
479// x = x/R mod m (HAC 14.32)
480function montReduce(x) {
481  while(x.t <= this.mt2)	// pad x so am has enough room later
482    x[x.t++] = 0;
483  for(var i = 0; i < this.m.t; ++i) {
484    // faster way of calculating u0 = x[i]*mp mod DV
485    var j = x[i]&0x7fff;
486    var u0 = (j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM;
487    // use am to combine the multiply-shift-add into one call
488    j = i+this.m.t;
489    x[j] += this.m.am(0,u0,x,i,0,this.m.t);
490    // propagate carry
491    while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }
492  }
493  x.clamp();
494  x.drShiftTo(this.m.t,x);
495  if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
496}
497
498// r = "x^2/R mod m"; x != r
499function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
500
501// r = "xy/R mod m"; x,y != r
502function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
503
504Montgomery.prototype.convert = montConvert;
505Montgomery.prototype.revert = montRevert;
506Montgomery.prototype.reduce = montReduce;
507Montgomery.prototype.mulTo = montMulTo;
508Montgomery.prototype.sqrTo = montSqrTo;
509
510// (protected) true iff this is even
511function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }
512
513// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
514function bnpExp(e,z) {
515  if(e > 0xffffffff || e < 1) return BigInteger.ONE;
516  var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;
517  g.copyTo(r);
518  while(--i >= 0) {
519    z.sqrTo(r,r2);
520    if((e&(1<<i)) > 0) z.mulTo(r2,g,r);
521    else { var t = r; r = r2; r2 = t; }
522  }
523  return z.revert(r);
524}
525
526// (public) this^e % m, 0 <= e < 2^32
527function bnModPowInt(e,m) {
528  var z;
529  if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);
530  return this.exp(e,z);
531}
532
533// protected
534BigInteger.prototype.copyTo = bnpCopyTo;
535BigInteger.prototype.fromInt = bnpFromInt;
536BigInteger.prototype.fromString = bnpFromString;
537BigInteger.prototype.clamp = bnpClamp;
538BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
539BigInteger.prototype.drShiftTo = bnpDRShiftTo;
540BigInteger.prototype.lShiftTo = bnpLShiftTo;
541BigInteger.prototype.rShiftTo = bnpRShiftTo;
542BigInteger.prototype.subTo = bnpSubTo;
543BigInteger.prototype.multiplyTo = bnpMultiplyTo;
544BigInteger.prototype.squareTo = bnpSquareTo;
545BigInteger.prototype.divRemTo = bnpDivRemTo;
546BigInteger.prototype.invDigit = bnpInvDigit;
547BigInteger.prototype.isEven = bnpIsEven;
548BigInteger.prototype.exp = bnpExp;
549
550// public
551BigInteger.prototype.toString = bnToString;
552BigInteger.prototype.negate = bnNegate;
553BigInteger.prototype.abs = bnAbs;
554BigInteger.prototype.compareTo = bnCompareTo;
555BigInteger.prototype.bitLength = bnBitLength;
556BigInteger.prototype.mod = bnMod;
557BigInteger.prototype.modPowInt = bnModPowInt;
558
559// "constants"
560BigInteger.ZERO = nbv(0);
561BigInteger.ONE = nbv(1);
562// Copyright (c) 2005-2009  Tom Wu
563// All Rights Reserved.
564// See "LICENSE" for details.
565
566// Extended JavaScript BN functions, required for RSA private ops.
567
568// Version 1.1: new BigInteger("0", 10) returns "proper" zero
569// Version 1.2: square() API, isProbablePrime fix
570
571// (public)
572function bnClone() { var r = nbi(); this.copyTo(r); return r; }
573
574// (public) return value as integer
575function bnIntValue() {
576  if(this.s < 0) {
577    if(this.t == 1) return this[0]-this.DV;
578    else if(this.t == 0) return -1;
579  }
580  else if(this.t == 1) return this[0];
581  else if(this.t == 0) return 0;
582  // assumes 16 < DB < 32
583  return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];
584}
585
586// (public) return value as byte
587function bnByteValue() { return (this.t==0)?this.s:(this[0]<<24)>>24; }
588
589// (public) return value as short (assumes DB>=16)
590function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; }
591
592// (protected) return x s.t. r^x < DV
593function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }
594
595// (public) 0 if this == 0, 1 if this > 0
596function bnSigNum() {
597  if(this.s < 0) return -1;
598  else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
599  else return 1;
600}
601
602// (protected) convert to radix string
603function bnpToRadix(b) {
604  if(b == null) b = 10;
605  if(this.signum() == 0 || b < 2 || b > 36) return "0";
606  var cs = this.chunkSize(b);
607  var a = Math.pow(b,cs);
608  var d = nbv(a), y = nbi(), z = nbi(), r = "";
609  this.divRemTo(d,y,z);
610  while(y.signum() > 0) {
611    r = (a+z.intValue()).toString(b).substr(1) + r;
612    y.divRemTo(d,y,z);
613  }
614  return z.intValue().toString(b) + r;
615}
616
617// (protected) convert from radix string
618function bnpFromRadix(s,b) {
619  this.fromInt(0);
620  if(b == null) b = 10;
621  var cs = this.chunkSize(b);
622  var d = Math.pow(b,cs), mi = false, j = 0, w = 0;
623  for(var i = 0; i < s.length; ++i) {
624    var x = intAt(s,i);
625    if(x < 0) {
626      if(s.charAt(i) == "-" && this.signum() == 0) mi = true;
627      continue;
628    }
629    w = b*w+x;
630    if(++j >= cs) {
631      this.dMultiply(d);
632      this.dAddOffset(w,0);
633      j = 0;
634      w = 0;
635    }
636  }
637  if(j > 0) {
638    this.dMultiply(Math.pow(b,j));
639    this.dAddOffset(w,0);
640  }
641  if(mi) BigInteger.ZERO.subTo(this,this);
642}
643
644// (protected) alternate constructor
645function bnpFromNumber(a,b,c) {
646  if("number" == typeof b) {
647    // new BigInteger(int,int,RNG)
648    if(a < 2) this.fromInt(1);
649    else {
650      this.fromNumber(a,c);
651      if(!this.testBit(a-1))	// force MSB set
652        this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);
653      if(this.isEven()) this.dAddOffset(1,0); // force odd
654      while(!this.isProbablePrime(b)) {
655        this.dAddOffset(2,0);
656        if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);
657      }
658    }
659  }
660  else {
661    // new BigInteger(int,RNG)
662    var x = new Array(), t = a&7;
663    x.length = (a>>3)+1;
664    b.nextBytes(x);
665    if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;
666    this.fromString(x,256);
667  }
668}
669
670// (public) convert to bigendian byte array
671function bnToByteArray() {
672  var i = this.t, r = new Array();
673  r[0] = this.s;
674  var p = this.DB-(i*this.DB)%8, d, k = 0;
675  if(i-- > 0) {
676    if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)
677      r[k++] = d|(this.s<<(this.DB-p));
678    while(i >= 0) {
679      if(p < 8) {
680        d = (this[i]&((1<<p)-1))<<(8-p);
681        d |= this[--i]>>(p+=this.DB-8);
682      }
683      else {
684        d = (this[i]>>(p-=8))&0xff;
685        if(p <= 0) { p += this.DB; --i; }
686      }
687      if((d&0x80) != 0) d |= -256;
688      if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;
689      if(k > 0 || d != this.s) r[k++] = d;
690    }
691  }
692  return r;
693}
694
695function bnEquals(a) { return(this.compareTo(a)==0); }
696function bnMin(a) { return(this.compareTo(a)<0)?this:a; }
697function bnMax(a) { return(this.compareTo(a)>0)?this:a; }
698
699// (protected) r = this op a (bitwise)
700function bnpBitwiseTo(a,op,r) {
701  var i, f, m = Math.min(a.t,this.t);
702  for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);
703  if(a.t < this.t) {
704    f = a.s&this.DM;
705    for(i = m; i < this.t; ++i) r[i] = op(this[i],f);
706    r.t = this.t;
707  }
708  else {
709    f = this.s&this.DM;
710    for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);
711    r.t = a.t;
712  }
713  r.s = op(this.s,a.s);
714  r.clamp();
715}
716
717// (public) this & a
718function op_and(x,y) { return x&y; }
719function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }
720
721// (public) this | a
722function op_or(x,y) { return x|y; }
723function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }
724
725// (public) this ^ a
726function op_xor(x,y) { return x^y; }
727function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }
728
729// (public) this & ~a
730function op_andnot(x,y) { return x&~y; }
731function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }
732
733// (public) ~this
734function bnNot() {
735  var r = nbi();
736  for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i];
737  r.t = this.t;
738  r.s = ~this.s;
739  return r;
740}
741
742// (public) this << n
743function bnShiftLeft(n) {
744  var r = nbi();
745  if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);
746  return r;
747}
748
749// (public) this >> n
750function bnShiftRight(n) {
751  var r = nbi();
752  if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);
753  return r;
754}
755
756// return index of lowest 1-bit in x, x < 2^31
757function lbit(x) {
758  if(x == 0) return -1;
759  var r = 0;
760  if((x&0xffff) == 0) { x >>= 16; r += 16; }
761  if((x&0xff) == 0) { x >>= 8; r += 8; }
762  if((x&0xf) == 0) { x >>= 4; r += 4; }
763  if((x&3) == 0) { x >>= 2; r += 2; }
764  if((x&1) == 0) ++r;
765  return r;
766}
767
768// (public) returns index of lowest 1-bit (or -1 if none)
769function bnGetLowestSetBit() {
770  for(var i = 0; i < this.t; ++i)
771    if(this[i] != 0) return i*this.DB+lbit(this[i]);
772  if(this.s < 0) return this.t*this.DB;
773  return -1;
774}
775
776// return number of 1 bits in x
777function cbit(x) {
778  var r = 0;
779  while(x != 0) { x &= x-1; ++r; }
780  return r;
781}
782
783// (public) return number of set bits
784function bnBitCount() {
785  var r = 0, x = this.s&this.DM;
786  for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);
787  return r;
788}
789
790// (public) true iff nth bit is set
791function bnTestBit(n) {
792  var j = Math.floor(n/this.DB);
793  if(j >= this.t) return(this.s!=0);
794  return((this[j]&(1<<(n%this.DB)))!=0);
795}
796
797// (protected) this op (1<<n)
798function bnpChangeBit(n,op) {
799  var r = BigInteger.ONE.shiftLeft(n);
800  this.bitwiseTo(r,op,r);
801  return r;
802}
803
804// (public) this | (1<<n)
805function bnSetBit(n) { return this.changeBit(n,op_or); }
806
807// (public) this & ~(1<<n)
808function bnClearBit(n) { return this.changeBit(n,op_andnot); }
809
810// (public) this ^ (1<<n)
811function bnFlipBit(n) { return this.changeBit(n,op_xor); }
812
813// (protected) r = this + a
814function bnpAddTo(a,r) {
815  var i = 0, c = 0, m = Math.min(a.t,this.t);
816  while(i < m) {
817    c += this[i]+a[i];
818    r[i++] = c&this.DM;
819    c >>= this.DB;
820  }
821  if(a.t < this.t) {
822    c += a.s;
823    while(i < this.t) {
824      c += this[i];
825      r[i++] = c&this.DM;
826      c >>= this.DB;
827    }
828    c += this.s;
829  }
830  else {
831    c += this.s;
832    while(i < a.t) {
833      c += a[i];
834      r[i++] = c&this.DM;
835      c >>= this.DB;
836    }
837    c += a.s;
838  }
839  r.s = (c<0)?-1:0;
840  if(c > 0) r[i++] = c;
841  else if(c < -1) r[i++] = this.DV+c;
842  r.t = i;
843  r.clamp();
844}
845
846// (public) this + a
847function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }
848
849// (public) this - a
850function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }
851
852// (public) this * a
853function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }
854
855// (public) this^2
856function bnSquare() { var r = nbi(); this.squareTo(r); return r; }
857
858// (public) this / a
859function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }
860
861// (public) this % a
862function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }
863
864// (public) [this/a,this%a]
865function bnDivideAndRemainder(a) {
866  var q = nbi(), r = nbi();
867  this.divRemTo(a,q,r);
868  return new Array(q,r);
869}
870
871// (protected) this *= n, this >= 0, 1 < n < DV
872function bnpDMultiply(n) {
873  this[this.t] = this.am(0,n-1,this,0,0,this.t);
874  ++this.t;
875  this.clamp();
876}
877
878// (protected) this += n << w words, this >= 0
879function bnpDAddOffset(n,w) {
880  if(n == 0) return;
881  while(this.t <= w) this[this.t++] = 0;
882  this[w] += n;
883  while(this[w] >= this.DV) {
884    this[w] -= this.DV;
885    if(++w >= this.t) this[this.t++] = 0;
886    ++this[w];
887  }
888}
889
890// A "null" reducer
891function NullExp() {}
892function nNop(x) { return x; }
893function nMulTo(x,y,r) { x.multiplyTo(y,r); }
894function nSqrTo(x,r) { x.squareTo(r); }
895
896NullExp.prototype.convert = nNop;
897NullExp.prototype.revert = nNop;
898NullExp.prototype.mulTo = nMulTo;
899NullExp.prototype.sqrTo = nSqrTo;
900
901// (public) this^e
902function bnPow(e) { return this.exp(e,new NullExp()); }
903
904// (protected) r = lower n words of "this * a", a.t <= n
905// "this" should be the larger one if appropriate.
906function bnpMultiplyLowerTo(a,n,r) {
907  var i = Math.min(this.t+a.t,n);
908  r.s = 0; // assumes a,this >= 0
909  r.t = i;
910  while(i > 0) r[--i] = 0;
911  var j;
912  for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t);
913  for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i);
914  r.clamp();
915}
916
917// (protected) r = "this * a" without lower n words, n > 0
918// "this" should be the larger one if appropriate.
919function bnpMultiplyUpperTo(a,n,r) {
920  --n;
921  var i = r.t = this.t+a.t-n;
922  r.s = 0; // assumes a,this >= 0
923  while(--i >= 0) r[i] = 0;
924  for(i = Math.max(n-this.t,0); i < a.t; ++i)
925    r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n);
926  r.clamp();
927  r.drShiftTo(1,r);
928}
929
930// Barrett modular reduction
931function Barrett(m) {
932  // setup Barrett
933  this.r2 = nbi();
934  this.q3 = nbi();
935  BigInteger.ONE.dlShiftTo(2*m.t,this.r2);
936  this.mu = this.r2.divide(m);
937  this.m = m;
938}
939
940function barrettConvert(x) {
941  if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);
942  else if(x.compareTo(this.m) < 0) return x;
943  else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
944}
945
946function barrettRevert(x) { return x; }
947
948// x = x mod m (HAC 14.42)
949function barrettReduce(x) {
950  x.drShiftTo(this.m.t-1,this.r2);
951  if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }
952  this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);
953  this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);
954  while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);
955  x.subTo(this.r2,x);
956  while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
957}
958
959// r = x^2 mod m; x != r
960function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
961
962// r = x*y mod m; x,y != r
963function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
964
965Barrett.prototype.convert = barrettConvert;
966Barrett.prototype.revert = barrettRevert;
967Barrett.prototype.reduce = barrettReduce;
968Barrett.prototype.mulTo = barrettMulTo;
969Barrett.prototype.sqrTo = barrettSqrTo;
970
971// (public) this^e % m (HAC 14.85)
972function bnModPow(e,m) {
973  var i = e.bitLength(), k, r = nbv(1), z;
974  if(i <= 0) return r;
975  else if(i < 18) k = 1;
976  else if(i < 48) k = 3;
977  else if(i < 144) k = 4;
978  else if(i < 768) k = 5;
979  else k = 6;
980  if(i < 8)
981    z = new Classic(m);
982  else if(m.isEven())
983    z = new Barrett(m);
984  else
985    z = new Montgomery(m);
986
987  // precomputation
988  var g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;
989  g[1] = z.convert(this);
990  if(k > 1) {
991    var g2 = nbi();
992    z.sqrTo(g[1],g2);
993    while(n <= km) {
994      g[n] = nbi();
995      z.mulTo(g2,g[n-2],g[n]);
996      n += 2;
997    }
998  }
999
1000  var j = e.t-1, w, is1 = true, r2 = nbi(), t;
1001  i = nbits(e[j])-1;
1002  while(j >= 0) {
1003    if(i >= k1) w = (e[j]>>(i-k1))&km;
1004    else {
1005      w = (e[j]&((1<<(i+1))-1))<<(k1-i);
1006      if(j > 0) w |= e[j-1]>>(this.DB+i-k1);
1007    }
1008
1009    n = k;
1010    while((w&1) == 0) { w >>= 1; --n; }
1011    if((i -= n) < 0) { i += this.DB; --j; }
1012    if(is1) {	// ret == 1, don't bother squaring or multiplying it
1013      g[w].copyTo(r);
1014      is1 = false;
1015    }
1016    else {
1017      while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }
1018      if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }
1019      z.mulTo(r2,g[w],r);
1020    }
1021
1022    while(j >= 0 && (e[j]&(1<<i)) == 0) {
1023      z.sqrTo(r,r2); t = r; r = r2; r2 = t;
1024      if(--i < 0) { i = this.DB-1; --j; }
1025    }
1026  }
1027  return z.revert(r);
1028}
1029
1030// (public) gcd(this,a) (HAC 14.54)
1031function bnGCD(a) {
1032  var x = (this.s<0)?this.negate():this.clone();
1033  var y = (a.s<0)?a.negate():a.clone();
1034  if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }
1035  var i = x.getLowestSetBit(), g = y.getLowestSetBit();
1036  if(g < 0) return x;
1037  if(i < g) g = i;
1038  if(g > 0) {
1039    x.rShiftTo(g,x);
1040    y.rShiftTo(g,y);
1041  }
1042  while(x.signum() > 0) {
1043    if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);
1044    if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);
1045    if(x.compareTo(y) >= 0) {
1046      x.subTo(y,x);
1047      x.rShiftTo(1,x);
1048    }
1049    else {
1050      y.subTo(x,y);
1051      y.rShiftTo(1,y);
1052    }
1053  }
1054  if(g > 0) y.lShiftTo(g,y);
1055  return y;
1056}
1057
1058// (protected) this % n, n < 2^26
1059function bnpModInt(n) {
1060  if(n <= 0) return 0;
1061  var d = this.DV%n, r = (this.s<0)?n-1:0;
1062  if(this.t > 0)
1063    if(d == 0) r = this[0]%n;
1064    else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n;
1065  return r;
1066}
1067
1068// (public) 1/this % m (HAC 14.61)
1069function bnModInverse(m) {
1070  var ac = m.isEven();
1071  if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
1072  var u = m.clone(), v = this.clone();
1073  var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);
1074  while(u.signum() != 0) {
1075    while(u.isEven()) {
1076      u.rShiftTo(1,u);
1077      if(ac) {
1078        if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }
1079        a.rShiftTo(1,a);
1080      }
1081      else if(!b.isEven()) b.subTo(m,b);
1082      b.rShiftTo(1,b);
1083    }
1084    while(v.isEven()) {
1085      v.rShiftTo(1,v);
1086      if(ac) {
1087        if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }
1088        c.rShiftTo(1,c);
1089      }
1090      else if(!d.isEven()) d.subTo(m,d);
1091      d.rShiftTo(1,d);
1092    }
1093    if(u.compareTo(v) >= 0) {
1094      u.subTo(v,u);
1095      if(ac) a.subTo(c,a);
1096      b.subTo(d,b);
1097    }
1098    else {
1099      v.subTo(u,v);
1100      if(ac) c.subTo(a,c);
1101      d.subTo(b,d);
1102    }
1103  }
1104  if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
1105  if(d.compareTo(m) >= 0) return d.subtract(m);
1106  if(d.signum() < 0) d.addTo(m,d); else return d;
1107  if(d.signum() < 0) return d.add(m); else return d;
1108}
1109
1110var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];
1111var lplim = (1<<26)/lowprimes[lowprimes.length-1];
1112
1113// (public) test primality with certainty >= 1-.5^t
1114function bnIsProbablePrime(t) {
1115  var i, x = this.abs();
1116  if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) {
1117    for(i = 0; i < lowprimes.length; ++i)
1118      if(x[0] == lowprimes[i]) return true;
1119    return false;
1120  }
1121  if(x.isEven()) return false;
1122  i = 1;
1123  while(i < lowprimes.length) {
1124    var m = lowprimes[i], j = i+1;
1125    while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];
1126    m = x.modInt(m);
1127    while(i < j) if(m%lowprimes[i++] == 0) return false;
1128  }
1129  return x.millerRabin(t);
1130}
1131
1132// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
1133function bnpMillerRabin(t) {
1134  var n1 = this.subtract(BigInteger.ONE);
1135  var k = n1.getLowestSetBit();
1136  if(k <= 0) return false;
1137  var r = n1.shiftRight(k);
1138  t = (t+1)>>1;
1139  if(t > lowprimes.length) t = lowprimes.length;
1140  var a = nbi();
1141  for(var i = 0; i < t; ++i) {
1142    //Pick bases at random, instead of starting at 2
1143    a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);
1144    var y = a.modPow(r,this);
1145    if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
1146      var j = 1;
1147      while(j++ < k && y.compareTo(n1) != 0) {
1148        y = y.modPowInt(2,this);
1149        if(y.compareTo(BigInteger.ONE) == 0) return false;

2157	if (this.hV.length % 2 == 1) {
2158	    throw "value hex must be even length: n=" + hV.length + ",v=" + this.hV;
2159	}
2160	var n = this.hV.length / 2;
2161	var hN = n.toString(16);
2162	if (hN.length % 2 == 1) {
2163	    hN = "0" + hN;
2164	}
2165	if (n < 128) {
2166	    return hN;
2167	} else {
2168	    var hNlen = hN.length / 2;
2169	    if (hNlen > 15) {
2170		throw "ASN.1 length too long to represent by 8x: n = " + n.toString(16);
2171	    }
2172	    var head = 128 + hNlen;
2173	    return head.toString(16) + hN;
2174	}
2175    };
2176
2177    /**
2178     * get hexadecimal string of ASN.1 TLV bytes
2179     * @name getEncodedHex
2180     * @memberOf KJUR.asn1.ASN1Object
2181     * @function
2182     * @return {String} hexadecimal string of ASN.1 TLV
2183     */
2184    this.getEncodedHex = function() {
2185	if (this.hTLV == null || this.isModified) {
2186	    this.hV = this.getFreshValueHex();
2187	    this.hL = this.getLengthHexFromValue();
2188	    this.hTLV = this.hT + this.hL + this.hV;
2189	    this.isModified = false;
2190	    //console.error("first time: " + this.hTLV);
2191	}
2192	return this.hTLV;
2193    };
2194
2195    /**
2196     * get hexadecimal string of ASN.1 TLV value(V) bytes
2197     * @name getValueHex
2198     * @memberOf KJUR.asn1.ASN1Object
2199     * @function
2200     * @return {String} hexadecimal string of ASN.1 TLV value(V) bytes
2201     */
2202    this.getValueHex = function() {
2203	this.getEncodedHex();
2204	return this.hV;
2205    }
2206
2207    this.getFreshValueHex = function() {
2208	return '';
2209    };
2210};
2211
2212// == BEGIN DERAbstractString ================================================
2213/**
2214 * base class for ASN.1 DER string classes
2215 * @name KJUR.asn1.DERAbstractString
2216 * @class base class for ASN.1 DER string classes
2217 * @param {Array} params associative array of parameters (ex. {'str': 'aaa'})
2218 * @property {String} s internal string of value
2219 * @extends KJUR.asn1.ASN1Object
2220 * @description
2221 * <br/>
2222 * As for argument 'params' for constructor, you can specify one of
2223 * following properties:
2224 * <ul>
2225 * <li>str - specify initial ASN.1 value(V) by a string</li>
2226 * <li>hex - specify initial ASN.1 value(V) by a hexadecimal string</li>
2227 * </ul>
2228 * NOTE: 'params' can be omitted.
2229 */
2230KJUR.asn1.DERAbstractString = function(params) {
2231    KJUR.asn1.DERAbstractString.superclass.constructor.call(this);
2232    var s = null;
2233    var hV = null;
2234
2235    /**
2236     * get string value of this string object
2237     * @name getString
2238     * @memberOf KJUR.asn1.DERAbstractString
2239     * @function
2240     * @return {String} string value of this string object
2241     */
2242    this.getString = function() {
2243	return this.s;
2244    };
2245
2246    /**
2247     * set value by a string
2248     * @name setString
2249     * @memberOf KJUR.asn1.DERAbstractString
2250     * @function
2251     * @param {String} newS value by a string to set
2252     */
2253    this.setString = function(newS) {
2254	this.hTLV = null;
2255	this.isModified = true;
2256	this.s = newS;
2257	this.hV = stohex(this.s);
2258    };
2259
2260    /**
2261     * set value by a hexadecimal string
2262     * @name setStringHex
2263     * @memberOf KJUR.asn1.DERAbstractString
2264     * @function
2265     * @param {String} newHexString value by a hexadecimal string to set
2266     */
2267    this.setStringHex = function(newHexString) {
2268	this.hTLV = null;
2269	this.isModified = true;
2270	this.s = null;
2271	this.hV = newHexString;
2272    };
2273
2274    this.getFreshValueHex = function() {
2275	return this.hV;
2276    };
2277
2278    if (typeof params != "undefined") {
2279	if (typeof params['str'] != "undefined") {
2280	    this.setString(params['str']);
2281	} else if (typeof params['hex'] != "undefined") {
2282	    this.setStringHex(params['hex']);
2283	}
2284    }
2285};
2286JSX.extend(KJUR.asn1.DERAbstractString, KJUR.asn1.ASN1Object);
2287// == END   DERAbstractString ================================================
2288
2289// == BEGIN DERAbstractTime ==================================================
2290/**
2291 * base class for ASN.1 DER Generalized/UTCTime class
2292 * @name KJUR.asn1.DERAbstractTime
2293 * @class base class for ASN.1 DER Generalized/UTCTime class
2294 * @param {Array} params associative array of parameters (ex. {'str': '130430235959Z'})
2295 * @extends KJUR.asn1.ASN1Object
2296 * @description
2297 * @see KJUR.asn1.ASN1Object - superclass
2298 */
2299KJUR.asn1.DERAbstractTime = function(params) {
2300    KJUR.asn1.DERAbstractTime.superclass.constructor.call(this);
2301    var s = null;
2302    var date = null;
2303
2304    // --- PRIVATE METHODS --------------------
2305    this.localDateToUTC = function(d) {
2306	utc = d.getTime() + (d.getTimezoneOffset() * 60000);
2307	var utcDate = new Date(utc);
2308	return utcDate;
2309    };
2310
2311    this.formatDate = function(dateObject, type) {
2312	var pad = this.zeroPadding;
2313	var d = this.localDateToUTC(dateObject);
2314	var year = String(d.getFullYear());
2315	if (type == 'utc') year = year.substr(2, 2);

2501     * @description
2502     * <br/>
2503     * NOTE: Value shall be represented by minimum octet length of
2504     * two's complement representation.
2505     */
2506    this.setValueHex = function(newHexString) {
2507	this.hV = newHexString;
2508    };
2509
2510    this.getFreshValueHex = function() {
2511	return this.hV;
2512    };
2513
2514    if (typeof params != "undefined") {
2515	if (typeof params['bigint'] != "undefined") {
2516	    this.setByBigInteger(params['bigint']);
2517	} else if (typeof params['int'] != "undefined") {
2518	    this.setByInteger(params['int']);
2519	} else if (typeof params['hex'] != "undefined") {
2520	    this.setValueHex(params['hex']);
2521	}
2522    }
2523};
2524JSX.extend(KJUR.asn1.DERInteger, KJUR.asn1.ASN1Object);
2525
2526// ********************************************************************
2527/**
2528 * class for ASN.1 DER encoded BitString primitive
2529 * @name KJUR.asn1.DERBitString
2530 * @class class for ASN.1 DER encoded BitString primitive
2531 * @extends KJUR.asn1.ASN1Object
2532 * @description 
2533 * <br/>
2534 * As for argument 'params' for constructor, you can specify one of
2535 * following properties:
2536 * <ul>
2537 * <li>bin - specify binary string (ex. '10111')</li>
2538 * <li>array - specify array of boolean (ex. [true,false,true,true])</li>
2539 * <li>hex - specify hexadecimal string of ASN.1 value(V) including unused bits</li>
2540 * </ul>
2541 * NOTE: 'params' can be omitted.
2542 */
2543KJUR.asn1.DERBitString = function(params) {
2544    KJUR.asn1.DERBitString.superclass.constructor.call(this);
2545    this.hT = "03";
2546
2547    /**
2548     * set ASN.1 value(V) by a hexadecimal string including unused bits
2549     * @name setHexValueIncludingUnusedBits
2550     * @memberOf KJUR.asn1.DERBitString
2551     * @function
2552     * @param {String} newHexStringIncludingUnusedBits
2553     */
2554    this.setHexValueIncludingUnusedBits = function(newHexStringIncludingUnusedBits) {
2555	this.hTLV = null;
2556	this.isModified = true;
2557	this.hV = newHexStringIncludingUnusedBits;
2558    };
2559
2560    /**
2561     * set ASN.1 value(V) by unused bit and hexadecimal string of value
2562     * @name setUnusedBitsAndHexValue
2563     * @memberOf KJUR.asn1.DERBitString
2564     * @function
2565     * @param {Integer} unusedBits
2566     * @param {String} hValue
2567     */
2568    this.setUnusedBitsAndHexValue = function(unusedBits, hValue) {
2569	if (unusedBits < 0 || 7 < unusedBits) {
2570	    throw "unused bits shall be from 0 to 7: u = " + unusedBits;
2571	}
2572	var hUnusedBits = "0" + unusedBits;
2573	this.hTLV = null;
2574	this.isModified = true;
2575	this.hV = hUnusedBits + hValue;
2576    };
2577
2578    /**
2579     * set ASN.1 DER BitString by binary string
2580     * @name setByBinaryString
2581     * @memberOf KJUR.asn1.DERBitString
2582     * @function
2583     * @param {String} binaryString binary value string (i.e. '10111')
2584     * @description
2585     * Its unused bits will be calculated automatically by length of 
2586     * 'binaryValue'. <br/>
2587     * NOTE: Trailing zeros '0' will be ignored.
2588     */
2589    this.setByBinaryString = function(binaryString) {
2590	binaryString = binaryString.replace(/0+$/, '');
2591	var unusedBits = 8 - binaryString.length % 8;
2592	if (unusedBits == 8) unusedBits = 0;
2593	for (var i = 0; i <= unusedBits; i++) {
2594	    binaryString += '0';
2595	}
2596	var h = '';
2597	for (var i = 0; i < binaryString.length - 1; i += 8) {
2598	    var b = binaryString.substr(i, 8);
2599	    var x = parseInt(b, 2).toString(16);
2600	    if (x.length == 1) x = '0' + x;
2601	    h += x;  
2602	}
2603	this.hTLV = null;
2604	this.isModified = true;
2605	this.hV = '0' + unusedBits + h;
2606    };
2607
2608    /**
2609     * set ASN.1 TLV value(V) by an array of boolean
2610     * @name setByBooleanArray
2611     * @memberOf KJUR.asn1.DERBitString
2612     * @function
2613     * @param {array} booleanArray array of boolean (ex. [true, false, true])
2614     * @description
2615     * NOTE: Trailing falses will be ignored.
2616     */
2617    this.setByBooleanArray = function(booleanArray) {
2618	var s = '';
2619	for (var i = 0; i < booleanArray.length; i++) {
2620	    if (booleanArray[i] == true) {
2621		s += '1';
2622	    } else {
2623		s += '0';
2624	    }
2625	}
2626	this.setByBinaryString(s);
2627    };
2628
2629    /**
2630     * generate an array of false with specified length
2631     * @name newFalseArray
2632     * @memberOf KJUR.asn1.DERBitString
2633     * @function
2634     * @param {Integer} nLength length of array to generate
2635     * @return {array} array of boolean faluse