code: function int2bigInt(t,bits,minSize) {   
      var i,k, buff;
      k=Math.ceil(bits/bpe)+1;
      k=minSize>k ? minSize : k;
      buff=new Array(k);
      copyInt_(buff,t);
      return buff;
    }
docs: convert the integer t into a bigInt with at least the given number of bits. the returned array stores the bigInt in bpe-bit chunks, little endian (buff[0] is least significant word) Pad the array with leading zeros so that it has at least minSize elements. There will always be at least one leading 0 element.