Gecko [ gandhischool.edu.np ]

Name	Size	Permission
aes.js	38.12 KB	-rw-r--r--
aesCipherSuites.js	8.92 KB	-rw-r--r--
asn1.js	41.06 KB	-rw-r--r--
baseN.js	4.95 KB	-rw-r--r--
cipher.js	6.51 KB	-rw-r--r--
cipherModes.js	27.94 KB	-rw-r--r--
debug.js	2.03 KB	-rw-r--r--
des.js	19.96 KB	-rw-r--r--
ed25519.js	21.69 KB	-rw-r--r--
forge.js	200 B	-rw-r--r--
form.js	3.79 KB	-rw-r--r--
hmac.js	3.74 KB	-rw-r--r--
http.js	38.55 KB	-rw-r--r--
index.all.js	366 B	-rw-r--r--
index.js	679 B	-rw-r--r--
jsbn.js	34.36 KB	-rw-r--r--
kem.js	5.09 KB	-rw-r--r--
log.js	8.96 KB	-rw-r--r--
md.all.js	251 B	-rw-r--r--
md.js	253 B	-rw-r--r--
md5.js	7.8 KB	-rw-r--r--
mgf.js	274 B	-rw-r--r--
mgf1.js	1.61 KB	-rw-r--r--
oids.js	5.88 KB	-rw-r--r--
pbe.js	30.27 KB	-rw-r--r--
pbkdf2.js	5.67 KB	-rw-r--r--
pem.js	6.3 KB	-rw-r--r--
pkcs1.js	8.18 KB	-rw-r--r--
pkcs12.js	32.57 KB	-rw-r--r--
pkcs7.js	38.35 KB	-rw-r--r--
pkcs7asn1.js	11.19 KB	-rw-r--r--
pki.js	2.59 KB	-rw-r--r--
prime.js	8.57 KB	-rw-r--r--
prime.worker.js	4.69 KB	-rw-r--r--
prng.js	12.06 KB	-rw-r--r--
pss.js	7.67 KB	-rw-r--r--
random.js	5.31 KB	-rw-r--r--
rc2.js	11.67 KB	-rw-r--r--
rsa.js	53.9 KB	-rw-r--r--
sha1.js	8.88 KB	-rw-r--r--
sha256.js	9.35 KB	-rw-r--r--
sha512.js	16.73 KB	-rw-r--r--
socket.js	8.13 KB	-rw-r--r--
ssh.js	7 KB	-rw-r--r--
task.js	19.32 KB	-rw-r--r--
tls.js	129.37 KB	-rw-r--r--
tlssocket.js	6.8 KB	-rw-r--r--
util.js	76.36 KB	-rw-r--r--
x509.js	100.2 KB	-rw-r--r--
xhr.js	21.57 KB	-rw-r--r--

Code Editor : baseN.js

/**
 * Base-N/Base-X encoding/decoding functions.
 *
 * Original implementation from base-x:
 * https://github.com/cryptocoinjs/base-x
 *
 * Which is MIT licensed:
 *
 * The MIT License (MIT)
 *
 * Copyright base-x contributors (c) 2016
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */
var api = {};
module.exports = api;

// baseN alphabet indexes
var _reverseAlphabets = {};

/**
 * BaseN-encodes a Uint8Array using the given alphabet.
 *
 * @param input the Uint8Array to encode.
 * @param maxline the maximum number of encoded characters per line to use,
 *          defaults to none.
 *
 * @return the baseN-encoded output string.
 */
api.encode = function(input, alphabet, maxline) {
  if(typeof alphabet !== 'string') {
    throw new TypeError('"alphabet" must be a string.');
  }
  if(maxline !== undefined && typeof maxline !== 'number') {
    throw new TypeError('"maxline" must be a number.');
  }

var output = '';

if(!(input instanceof Uint8Array)) {
    // assume forge byte buffer
    output = _encodeWithByteBuffer(input, alphabet);
  } else {
    var i = 0;
    var base = alphabet.length;
    var first = alphabet.charAt(0);
    var digits = [0];
    for(i = 0; i < input.length; ++i) {
      for(var j = 0, carry = input[i]; j < digits.length; ++j) {
        carry += digits[j] << 8;
        digits[j] = carry % base;
        carry = (carry / base) | 0;
      }

while(carry > 0) {
        digits.push(carry % base);
        carry = (carry / base) | 0;
      }
    }

// deal with leading zeros
    for(i = 0; input[i] === 0 && i < input.length - 1; ++i) {
      output += first;
    }
    // convert digits to a string
    for(i = digits.length - 1; i >= 0; --i) {
      output += alphabet[digits[i]];
    }
  }

if(maxline) {
    var regex = new RegExp('.{1,' + maxline + '}', 'g');
    output = output.match(regex).join('\r\n');
  }

return output;
};

/**
 * Decodes a baseN-encoded (using the given alphabet) string to a
 * Uint8Array.
 *
 * @param input the baseN-encoded input string.
 *
 * @return the Uint8Array.
 */
api.decode = function(input, alphabet) {
  if(typeof input !== 'string') {
    throw new TypeError('"input" must be a string.');
  }
  if(typeof alphabet !== 'string') {
    throw new TypeError('"alphabet" must be a string.');
  }

var table = _reverseAlphabets[alphabet];
  if(!table) {
    // compute reverse alphabet
    table = _reverseAlphabets[alphabet] = [];
    for(var i = 0; i < alphabet.length; ++i) {
      table[alphabet.charCodeAt(i)] = i;
    }
  }

// remove whitespace characters
  input = input.replace(/\s/g, '');

var base = alphabet.length;
  var first = alphabet.charAt(0);
  var bytes = [0];
  for(var i = 0; i < input.length; i++) {
    var value = table[input.charCodeAt(i)];
    if(value === undefined) {
      return;
    }

for(var j = 0, carry = value; j < bytes.length; ++j) {
      carry += bytes[j] * base;
      bytes[j] = carry & 0xff;
      carry >>= 8;
    }

while(carry > 0) {
      bytes.push(carry & 0xff);
      carry >>= 8;
    }
  }

// deal with leading zeros
  for(var k = 0; input[k] === first && k < input.length - 1; ++k) {
    bytes.push(0);
  }

if(typeof Buffer !== 'undefined') {
    return Buffer.from(bytes.reverse());
  }

return new Uint8Array(bytes.reverse());
};

function _encodeWithByteBuffer(input, alphabet) {
  var i = 0;
  var base = alphabet.length;
  var first = alphabet.charAt(0);
  var digits = [0];
  for(i = 0; i < input.length(); ++i) {
    for(var j = 0, carry = input.at(i); j < digits.length; ++j) {
      carry += digits[j] << 8;
      digits[j] = carry % base;
      carry = (carry / base) | 0;
    }

while(carry > 0) {
      digits.push(carry % base);
      carry = (carry / base) | 0;
    }
  }

var output = '';

// deal with leading zeros
  for(i = 0; input.at(i) === 0 && i < input.length() - 1; ++i) {
    output += first;
  }
  // convert digits to a string
  for(i = digits.length - 1; i >= 0; --i) {
    output += alphabet[digits[i]];
  }

return output;
}

${this.title}

Code Editor : baseN.js