-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'correcting-cryptosuites'
- Loading branch information
Showing
16 changed files
with
747 additions
and
182 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,155 @@ | ||
| /** | ||
| * 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. | ||
| */ | ||
| // baseN alphabet indexes | ||
| const _reverseAlphabets = {}; | ||
|
|
||
| /** | ||
| * BaseN-encodes a Uint8Array using the given alphabet. | ||
| * | ||
| * @param {Uint8Array} input - The bytes to encode in a Uint8Array. | ||
| * @param {string} alphabet - The alphabet to use for encoding. | ||
| * @param {number} maxline - The maximum number of encoded characters per line | ||
| * to use, defaults to none. | ||
| * | ||
| * @returns {string} The baseN-encoded output string. | ||
| */ | ||
| export function encode(input, alphabet, maxline) { | ||
| if(!(input instanceof Uint8Array)) { | ||
| throw new TypeError('"input" must be a Uint8Array.'); | ||
| } | ||
| 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.'); | ||
| } | ||
| if(input.length === 0) { | ||
| return ''; | ||
| } | ||
|
|
||
| let output = ''; | ||
|
|
||
| let i = 0; | ||
| const base = alphabet.length; | ||
| const first = alphabet.charAt(0); | ||
| const digits = [0]; | ||
| for(i = 0; i < input.length; ++i) { | ||
| let carry = input[i]; | ||
| for(let j = 0; 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) { | ||
| const 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 {string} input - The baseN-encoded input string. | ||
| * @param {string} alphabet - The alphabet to use for decoding. | ||
| * | ||
| * @returns {Uint8Array} The decoded bytes in a Uint8Array. | ||
| */ | ||
| export function decode(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.'); | ||
| } | ||
| if(input.length === 0) { | ||
| return new Uint8Array(); | ||
| } | ||
|
|
||
| let table = _reverseAlphabets[alphabet]; | ||
| if(!table) { | ||
| // compute reverse alphabet | ||
| table = _reverseAlphabets[alphabet] = []; | ||
| for(let i = 0; i < alphabet.length; ++i) { | ||
| table[alphabet.charCodeAt(i)] = i; | ||
| } | ||
| } | ||
|
|
||
| // remove whitespace characters | ||
| input = input.replace(/\s/g, ''); | ||
|
|
||
| const base = alphabet.length; | ||
| const first = alphabet.charAt(0); | ||
| const bytes = [0]; | ||
| for(let i = 0; i < input.length; i++) { | ||
| const value = table[input.charCodeAt(i)]; | ||
| if(value === undefined) { | ||
| return; | ||
| } | ||
|
|
||
| let carry = value; | ||
| for(let j = 0; 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(let k = 0; input[k] === first && k < input.length - 1; ++k) { | ||
| bytes.push(0); | ||
| } | ||
|
|
||
| return new Uint8Array(bytes.reverse()); | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,4 @@ | ||
| /// <reference types="node" /> | ||
|
|
||
| export function encode(input: Uint8Array, maxline?: number): string; | ||
| export function decode(input: string): Uint8Array; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,18 @@ | ||
| /*! | ||
| * Copyright (c) 2019-2022 Digital Bazaar, Inc. All rights reserved. | ||
| */ | ||
| import { | ||
| encode as _encode, | ||
| decode as _decode | ||
| } from './baseN.js'; | ||
|
|
||
| // base58 characters (Bitcoin alphabet) | ||
| const alphabet = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'; | ||
|
|
||
| export function encode(input, maxline) { | ||
| return _encode(input, alphabet, maxline); | ||
| } | ||
|
|
||
| export function decode(input) { | ||
| return _decode(input, alphabet); | ||
| } |
Oops, something went wrong.