@ivujs/i-utils 2.0.0 → 2.1.0

package/dist/cjs/crypto/sm/lib/sm3.cjs

@@ -1,158 +0,0 @@
-'use strict';
-
-// 消息扩展
-const W = new Uint32Array(68);
-const M = new Uint32Array(64); // W'
-/**
- * 循环左移
- */
-function rotl(x, n) {
-    const s = n & 31;
-    return (x << s) | (x >>> (32 - s));
-}
-/**
- * 二进制异或运算
- */
-function xor(x, y) {
-    const result = [];
-    for (let i = x.length - 1; i >= 0; i--)
-        result[i] = (x[i] ^ y[i]) & 0xff;
-    return result;
-}
-/**
- * 压缩函数中的置换函数 P0(X) = X xor (X <<< 9) xor (X <<< 17)
- */
-function P0(X) {
-    return X ^ rotl(X, 9) ^ rotl(X, 17);
-}
-/**
- * 消息扩展中的置换函数 P1(X) = X xor (X <<< 15) xor (X <<< 23)
- */
-function P1(X) {
-    return X ^ rotl(X, 15) ^ rotl(X, 23);
-}
-/**
- * sm3 本体
- */
-function sm3(array) {
-    let len = array.length * 8;
-    // k 是满足 len + 1 + k = 448mod512 的最小的非负整数
-    let k = len % 512;
-    // 如果 448 <= (512 % len) < 512，需要多补充 (len % 448) 比特'0'以满足总比特长度为512的倍数
-    k = k >= 448 ? 512 - (k % 448) - 1 : 448 - k - 1;
-    // 填充
-    const kArr = new Array((k - 7) / 8);
-    const lenArr = new Array(8);
-    for (let i = 0, len = kArr.length; i < len; i++)
-        kArr[i] = 0;
-    for (let i = 0, len = lenArr.length; i < len; i++)
-        lenArr[i] = 0;
-    len = len.toString(2);
-    for (let i = 7; i >= 0; i--) {
-        if (len.length > 8) {
-            const start = len.length - 8;
-            lenArr[i] = parseInt(len.substr(start), 2);
-            len = len.substr(0, start);
-        }
-        else if (len.length > 0) {
-            lenArr[i] = parseInt(len, 2);
-            len = "";
-        }
-    }
-    const m = new Uint8Array([...array, 0x80, ...kArr, ...lenArr]);
-    const dataView = new DataView(m.buffer, 0);
-    // 迭代压缩
-    const n = m.length / 64;
-    const V = new Uint32Array([
-        0x7380166f, 0x4914b2b9, 0x172442d7, 0xda8a0600, 0xa96f30bc, 0x163138aa, 0xe38dee4d, 0xb0fb0e4e,
-    ]);
-    for (let i = 0; i < n; i++) {
-        W.fill(0);
-        M.fill(0);
-        // 将消息分组B划分为 16 个字 W0， W1，……，W15
-        const start = 16 * i;
-        for (let j = 0; j < 16; j++) {
-            W[j] = dataView.getUint32((start + j) * 4, false);
-        }
-        // W16 ～ W67：W[j] <- P1(W[j−16] xor W[j−9] xor (W[j−3] <<< 15)) xor (W[j−13] <<< 7) xor W[j−6]
-        for (let j = 16; j < 68; j++) {
-            W[j] = P1(W[j - 16] ^ W[j - 9] ^ rotl(W[j - 3], 15)) ^ rotl(W[j - 13], 7) ^ W[j - 6];
-        }
-        // W′0 ～ W′63：W′[j] = W[j] xor W[j+4]
-        for (let j = 0; j < 64; j++) {
-            M[j] = W[j] ^ W[j + 4];
-        }
-        // 压缩
-        const T1 = 0x79cc4519;
-        const T2 = 0x7a879d8a;
-        // 字寄存器
-        let A = V[0];
-        let B = V[1];
-        let C = V[2];
-        let D = V[3];
-        let E = V[4];
-        let F = V[5];
-        let G = V[6];
-        let H = V[7];
-        // 中间变量
-        let SS1;
-        let SS2;
-        let TT1;
-        let TT2;
-        let T;
-        for (let j = 0; j < 64; j++) {
-            T = j >= 0 && j <= 15 ? T1 : T2;
-            SS1 = rotl(rotl(A, 12) + E + rotl(T, j), 7);
-            SS2 = SS1 ^ rotl(A, 12);
-            TT1 = (j >= 0 && j <= 15 ? A ^ B ^ C : (A & B) | (A & C) | (B & C)) + D + SS2 + M[j];
-            TT2 = (j >= 0 && j <= 15 ? E ^ F ^ G : (E & F) | (~E & G)) + H + SS1 + W[j];
-            D = C;
-            C = rotl(B, 9);
-            B = A;
-            A = TT1;
-            H = G;
-            G = rotl(F, 19);
-            F = E;
-            E = P0(TT2);
-        }
-        V[0] ^= A;
-        V[1] ^= B;
-        V[2] ^= C;
-        V[3] ^= D;
-        V[4] ^= E;
-        V[5] ^= F;
-        V[6] ^= G;
-        V[7] ^= H;
-    }
-    // 转回 uint8
-    const result = [];
-    for (let i = 0, len = V.length; i < len; i++) {
-        const word = V[i];
-        result.push((word & 0xff000000) >>> 24, (word & 0xff0000) >>> 16, (word & 0xff00) >>> 8, word & 0xff);
-    }
-    return result;
-}
-/**
- * hmac 实现
- */
-const blockLen = 64;
-const iPad = new Uint8Array(blockLen);
-const oPad = new Uint8Array(blockLen);
-for (let i = 0; i < blockLen; i++) {
-    iPad[i] = 0x36;
-    oPad[i] = 0x5c;
-}
-function hmac(input, key) {
-    // 密钥填充
-    if (key.length > blockLen)
-        key = sm3(key);
-    while (key.length < blockLen)
-        key.push(0);
-    const iPadKey = xor(key, iPad);
-    const oPadKey = xor(key, oPad);
-    const hash = sm3([...iPadKey, ...input]);
-    return sm3([...oPadKey, ...hash]);
-}
-
-exports.hmac = hmac;
-exports.sm3 = sm3;

package/dist/cjs/crypto/sm/lib/utils.cjs

@@ -1,170 +0,0 @@
-'use strict';
-
-var jsbn = require('./jsbn.cjs');
-var ec = require('./ec.cjs');
-
-const { BigInteger, SecureRandom } = jsbn;
-const { ECCurveFp } = ec;
-const rng = new SecureRandom();
-const { curve, G, n } = generateEcparam();
-/**
- * 获取公共椭圆曲线
- */
-function getGlobalCurve() {
-    return curve;
-}
-/**
- * 生成ecparam
- */
-function generateEcparam() {
-    // 椭圆曲线
-    const p = new BigInteger("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16);
-    const a = new BigInteger("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16);
-    const b = new BigInteger("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16);
-    const curve = new ECCurveFp(p, a, b);
-    // 基点
-    const gxHex = "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7";
-    const gyHex = "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0";
-    const G = curve.decodePointHex("04" + gxHex + gyHex);
-    const n = new BigInteger("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
-    return { curve, G, n };
-}
-/**
- * 生成密钥对：publicKey = privateKey * G
- */
-function generateKeyPairHex(a, b, c) {
-    const random = a ? new BigInteger(a, b, c) : new BigInteger(n.bitLength(), rng);
-    const d = random.mod(n.subtract(BigInteger.ONE)).add(BigInteger.ONE); // 随机数
-    const privateKey = leftPad(d.toString(16), 64);
-    const P = G.multiply(d); // P = dG，p 为公钥，d 为私钥
-    const Px = leftPad(P.getX().toBigInteger().toString(16), 64);
-    const Py = leftPad(P.getY().toBigInteger().toString(16), 64);
-    const publicKey = "04" + Px + Py;
-    return { privateKey, publicKey };
-}
-/**
- * 生成压缩公钥
- */
-function compressPublicKeyHex(s) {
-    if (s.length !== 130)
-        throw new Error("Invalid public key to compress");
-    const len = (s.length - 2) / 2;
-    const xHex = s.substr(2, len);
-    const y = new BigInteger(s.substr(len + 2, len), 16);
-    let prefix = "03";
-    if (y.mod(new BigInteger("2")).equals(BigInteger.ZERO))
-        prefix = "02";
-    return prefix + xHex;
-}
-/**
- * utf8串转16进制串
- */
-function utf8ToHex(input) {
-    input = unescape(encodeURIComponent(input));
-    const length = input.length;
-    // 转换到字数组
-    const words = [];
-    for (let i = 0; i < length; i++) {
-        words[i >>> 2] |= (input.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);
-    }
-    // 转换到16进制
-    const hexChars = [];
-    for (let i = 0; i < length; i++) {
-        const bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
-        hexChars.push((bite >>> 4).toString(16));
-        hexChars.push((bite & 0x0f).toString(16));
-    }
-    return hexChars.join("");
-}
-/**
- * 补全16进制字符串
- */
-function leftPad(input, num) {
-    if (input.length >= num)
-        return input;
-    return new Array(num - input.length + 1).join("0") + input;
-}
-/**
- * 转成16进制串
- */
-function arrayToHex(arr) {
-    return arr
-        .map((item) => {
-        item = item.toString(16);
-        return item.length === 1 ? "0" + item : item;
-    })
-        .join("");
-}
-/**
- * 转成utf8串
- */
-function arrayToUtf8(arr) {
-    const words = [];
-    let j = 0;
-    for (let i = 0; i < arr.length * 2; i += 2) {
-        words[i >>> 3] |= parseInt(arr[j], 10) << (24 - (i % 8) * 4);
-        j++;
-    }
-    try {
-        const latin1Chars = [];
-        for (let i = 0; i < arr.length; i++) {
-            const bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
-            latin1Chars.push(String.fromCharCode(bite));
-        }
-        return decodeURIComponent(escape(latin1Chars.join("")));
-    }
-    catch (e) {
-        throw new Error("Malformed UTF-8 data");
-    }
-}
-/**
- * 转成字节数组
- */
-function hexToArray(hexStr) {
-    const words = [];
-    let hexStrLength = hexStr.length;
-    if (hexStrLength % 2 !== 0) {
-        hexStr = leftPad(hexStr, hexStrLength + 1);
-    }
-    hexStrLength = hexStr.length;
-    for (let i = 0; i < hexStrLength; i += 2) {
-        words.push(parseInt(hexStr.substr(i, 2), 16));
-    }
-    return words;
-}
-/**
- * 验证公钥是否为椭圆曲线上的点
- */
-function verifyPublicKey(publicKey) {
-    const point = curve.decodePointHex(publicKey);
-    if (!point)
-        return false;
-    const x = point.getX();
-    const y = point.getY();
-    // 验证 y^2 是否等于 x^3 + ax + b
-    return y.square().equals(x.multiply(x.square()).add(x.multiply(curve.a)).add(curve.b));
-}
-/**
- * 验证公钥是否等价，等价返回true
- */
-function comparePublicKeyHex(publicKey1, publicKey2) {
-    const point1 = curve.decodePointHex(publicKey1);
-    if (!point1)
-        return false;
-    const point2 = curve.decodePointHex(publicKey2);
-    if (!point2)
-        return false;
-    return point1.equals(point2);
-}
-
-exports.arrayToHex = arrayToHex;
-exports.arrayToUtf8 = arrayToUtf8;
-exports.comparePublicKeyHex = comparePublicKeyHex;
-exports.compressPublicKeyHex = compressPublicKeyHex;
-exports.generateEcparam = generateEcparam;
-exports.generateKeyPairHex = generateKeyPairHex;
-exports.getGlobalCurve = getGlobalCurve;
-exports.hexToArray = hexToArray;
-exports.leftPad = leftPad;
-exports.utf8ToHex = utf8ToHex;
-exports.verifyPublicKey = verifyPublicKey;

package/dist/cjs/crypto/sm/sm2/index.cjs

@@ -1,112 +0,0 @@
-'use strict';
-
-var sm2 = require('./sm2.cjs');
-
-// 获取密钥对
-/**
- * sm2 生成公钥和私钥
- * @param {String} str 字符串
- * @param {Number} rnd 随机数
- * @returns {Object} 返回公钥和私钥
- */
-function generateKeyPairHex(str, rnd) {
-    return sm2.generateKeyPairHex(str, rnd);
-}
-/**
- * sm2 压缩公钥
- * @param {String} publicKey 公钥
- * @returns {String} 返回公钥字符串
- */
-function compressPublicKeyHex(publicKey) {
-    return sm2.compressPublicKeyHex(publicKey);
-}
-/**
- * sm2 对比公钥是否等价
- * @param {String} publicKey 公钥
- * @param {String} compressedPublicKey 压缩后的公钥
- * @returns {Boolean} 返回结果
- */
-function comparePublicKeyHex(publicKey, compressedPublicKey) {
-    return sm2.comparePublicKeyHex(publicKey, compressedPublicKey);
-}
-// 验证密钥对
-/**
- * sm2 验证公钥
- * @param {String} publicKey 公钥，也可以传压缩后的公钥
- * @returns {Boolean} 返回结果
- */
-function verifyPublicKey(publicKey) {
-    return sm2.verifyPublicKey(publicKey);
-}
-// 加密解密
-/**
- * sm2 加密
- * @param {String} str 字符串
- * @param {String} publicKey 公钥
- * @param {Number} cipherMode 加密模式，1（C1C3C2）和0（C1C2C3），默认1
- * @returns {String} 返回加密后的字符串
- */
-function encrypt(str, publicKey, cipherMode = 1) {
-    return sm2.doEncrypt(str, publicKey, cipherMode);
-}
-/**
- * sm2 解密
- * @param {String} str 字符串
- * @param {String} privateKey 私钥
- * @param {Number} cipherMode 解密模式，1（C1C3C2）和0（C1C2C3），默认1
- * @param {Object} outputConfig 输出结果配置，{output:'string/array'}
- * @returns {String,Array} 返回解密后的数据
- */
-function decrypt(str, privateKey, cipherMode = 1, outputConfig = { output: "string" }) {
-    return sm2.doDecrypt(str, privateKey, cipherMode, outputConfig);
-}
-// 签名验签
-/**
- * sm2 生成签名
- * @param {String} str 字符串
- * @param {String} privateKey 私钥
- * @param {Object} signatureConfig 签名配置
- * @returns {String} 返回签名信息
- */
-function doSignature(str, privateKey, signatureConfig) {
-    return sm2.doSignature(str, privateKey, signatureConfig);
-}
-/**
- * sm2 验证签名
- * @param {String} str 字符串
- * @param {String} signHex 生成签名的信息
- * @param {String} publicKey 公钥
- * @param {Object} verifyConfig 验证配置
- * @returns {String} 返回结果
- */
-function doVerifySignature(str, signHex, publicKey, verifyConfig) {
-    return sm2.doVerifySignature(str, signHex, publicKey, verifyConfig);
-}
-// 获取椭圆曲线点
-/**
- * sm2 获取椭圆曲线点
- * @returns {Object} 返回椭圆曲线点，可在sm2签名时传入
- */
-function getPoint() {
-    return sm2.getPoint();
-}
-// 根据私钥获取公钥
-/**
- * sm2 根据私钥获取公钥
- * @param {String} privateKey 私钥
- * @returns {String} 返回公钥
- */
-function getPublicKeyFromPrivateKey(privateKey) {
-    return sm2.getPublicKeyFromPrivateKey(privateKey);
-}
-
-exports.comparePublicKeyHex = comparePublicKeyHex;
-exports.compressPublicKeyHex = compressPublicKeyHex;
-exports.decrypt = decrypt;
-exports.doSignature = doSignature;
-exports.doVerifySignature = doVerifySignature;
-exports.encrypt = encrypt;
-exports.generateKeyPairHex = generateKeyPairHex;
-exports.getPoint = getPoint;
-exports.getPublicKeyFromPrivateKey = getPublicKeyFromPrivateKey;
-exports.verifyPublicKey = verifyPublicKey;

package/dist/cjs/crypto/sm/sm2/sm2.cjs

@@ -1,231 +0,0 @@
-'use strict';
-
-var jsbn = require('../lib/jsbn.cjs');
-var asn1 = require('../lib/asn1.cjs');
-var utils = require('../lib/utils.cjs');
-var sm3 = require('../lib/sm3.cjs');
-
-const { BigInteger } = jsbn;
-const { decodeDer, encodeDer } = asn1;
-const { G, curve, n } = utils.generateEcparam();
-const C1C2C3 = 0;
-/**
- * 加密
- */
-function doEncrypt(msg, publicKey, cipherMode = 1) {
-    msg = typeof msg === "string" ? utils.hexToArray(utils.utf8ToHex(msg)) : Array.prototype.slice.call(msg);
-    publicKey = utils.getGlobalCurve().decodePointHex(publicKey); // 先将公钥转成点
-    const keypair = utils.generateKeyPairHex();
-    const k = new BigInteger(keypair.privateKey, 16); // 随机数 k
-    // c1 = k * G
-    let c1 = keypair.publicKey;
-    if (c1.length > 128)
-        c1 = c1.substr(c1.length - 128);
-    // (x2, y2) = k * publicKey
-    const p = publicKey.multiply(k);
-    const x2 = utils.hexToArray(utils.leftPad(p.getX().toBigInteger().toRadix(16), 64));
-    const y2 = utils.hexToArray(utils.leftPad(p.getY().toBigInteger().toRadix(16), 64));
-    // c3 = hash(x2 || msg || y2)
-    const c3 = utils.arrayToHex(sm3.sm3([].concat(x2, msg, y2)));
-    let ct = 1;
-    let offset = 0;
-    let t = []; // 256 位
-    const z = [].concat(x2, y2);
-    const nextT = () => {
-        // (1) Hai = hash(z || ct)
-        // (2) ct++
-        t = sm3.sm3([...z, (ct >> 24) & 0x00ff, (ct >> 16) & 0x00ff, (ct >> 8) & 0x00ff, ct & 0x00ff]);
-        ct++;
-        offset = 0;
-    };
-    nextT(); // 先生成 Ha1
-    for (let i = 0, len = msg.length; i < len; i++) {
-        // t = Ha1 || Ha2 || Ha3 || Ha4
-        if (offset === t.length)
-            nextT();
-        // c2 = msg ^ t
-        msg[i] ^= t[offset++] & 0xff;
-    }
-    const c2 = utils.arrayToHex(msg);
-    return cipherMode === C1C2C3 ? c1 + c2 + c3 : c1 + c3 + c2;
-}
-/**
- * 解密
- */
-function doDecrypt(encryptData, privateKey, cipherMode = 1, { output = "string" } = {}) {
-    privateKey = new BigInteger(privateKey, 16);
-    let c3 = encryptData.substr(128, 64);
-    let c2 = encryptData.substr(128 + 64);
-    if (cipherMode === C1C2C3) {
-        c3 = encryptData.substr(encryptData.length - 64);
-        c2 = encryptData.substr(128, encryptData.length - 128 - 64);
-    }
-    const msg = utils.hexToArray(c2);
-    const c1 = utils.getGlobalCurve().decodePointHex("04" + encryptData.substr(0, 128));
-    const p = c1.multiply(privateKey);
-    const x2 = utils.hexToArray(utils.leftPad(p.getX().toBigInteger().toRadix(16), 64));
-    const y2 = utils.hexToArray(utils.leftPad(p.getY().toBigInteger().toRadix(16), 64));
-    let ct = 1;
-    let offset = 0;
-    let t = []; // 256 位
-    const z = [].concat(x2, y2);
-    const nextT = () => {
-        // (1) Hai = hash(z || ct)
-        // (2) ct++
-        t = sm3.sm3([...z, (ct >> 24) & 0x00ff, (ct >> 16) & 0x00ff, (ct >> 8) & 0x00ff, ct & 0x00ff]);
-        ct++;
-        offset = 0;
-    };
-    nextT(); // 先生成 Ha1
-    for (let i = 0, len = msg.length; i < len; i++) {
-        // t = Ha1 || Ha2 || Ha3 || Ha4
-        if (offset === t.length)
-            nextT();
-        // c2 = msg ^ t
-        msg[i] ^= t[offset++] & 0xff;
-    }
-    // c3 = hash(x2 || msg || y2)
-    const checkC3 = utils.arrayToHex(sm3.sm3([].concat(x2, msg, y2)));
-    if (checkC3 === c3.toLowerCase()) {
-        return output === "array" ? msg : utils.arrayToUtf8(msg);
-    }
-    else {
-        return output === "array" ? [] : "";
-    }
-}
-/**
- * 签名
- */
-function doSignature(msg, privateKey, { pointPool, der, hash, publicKey, userId } = {}) {
-    let hashHex = typeof msg === "string" ? utils.utf8ToHex(msg) : utils.arrayToHex(msg);
-    if (hash) {
-        // sm3杂凑
-        publicKey = publicKey || getPublicKeyFromPrivateKey(privateKey);
-        hashHex = getHash(hashHex, publicKey, userId);
-    }
-    const dA = new BigInteger(privateKey, 16);
-    const e = new BigInteger(hashHex, 16);
-    // k
-    let k = null;
-    let r = null;
-    let s = null;
-    do {
-        do {
-            let point;
-            if (pointPool && pointPool.length) {
-                point = pointPool.pop();
-            }
-            else {
-                point = getPoint();
-            }
-            k = point.k;
-            // r = (e + x1) mod n
-            r = e.add(point.x1).mod(n);
-        } while (r.equals(BigInteger.ZERO) || r.add(k).equals(n));
-        // s = ((1 + dA)^-1 * (k - r * dA)) mod n
-        s = dA
-            .add(BigInteger.ONE)
-            .modInverse(n)
-            .multiply(k.subtract(r.multiply(dA)))
-            .mod(n);
-    } while (s.equals(BigInteger.ZERO));
-    if (der)
-        return encodeDer(r, s); // asn.1 der 编码
-    return utils.leftPad(r.toString(16), 64) + utils.leftPad(s.toString(16), 64);
-}
-/**
- * 验签
- */
-function doVerifySignature(msg, signHex, publicKey, { der, hash, userId } = {}) {
-    let hashHex = typeof msg === "string" ? utils.utf8ToHex(msg) : utils.arrayToHex(msg);
-    if (hash) {
-        // sm3杂凑
-        hashHex = getHash(hashHex, publicKey, userId);
-    }
-    let r;
-    let s;
-    if (der) {
-        const decodeDerObj = decodeDer(signHex); // asn.1 der 解码
-        r = decodeDerObj.r;
-        s = decodeDerObj.s;
-    }
-    else {
-        r = new BigInteger(signHex.substring(0, 64), 16);
-        s = new BigInteger(signHex.substring(64), 16);
-    }
-    const PA = curve.decodePointHex(publicKey);
-    const e = new BigInteger(hashHex, 16);
-    // t = (r + s) mod n
-    const t = r.add(s).mod(n);
-    if (t.equals(BigInteger.ZERO))
-        return false;
-    // x1y1 = s * G + t * PA
-    const x1y1 = G.multiply(s).add(PA.multiply(t));
-    // R = (e + x1) mod n
-    const R = e.add(x1y1.getX().toBigInteger()).mod(n);
-    return r.equals(R);
-}
-/**
- * sm3杂凑算法
- */
-function getHash(hashHex, publicKey, userId = "1234567812345678") {
-    // z = hash(entl || userId || a || b || gx || gy || px || py)
-    userId = utils.utf8ToHex(userId);
-    const a = utils.leftPad(G.curve.a.toBigInteger().toRadix(16), 64);
-    const b = utils.leftPad(G.curve.b.toBigInteger().toRadix(16), 64);
-    const gx = utils.leftPad(G.getX().toBigInteger().toRadix(16), 64);
-    const gy = utils.leftPad(G.getY().toBigInteger().toRadix(16), 64);
-    let px;
-    let py;
-    if (publicKey.length === 128) {
-        px = publicKey.substr(0, 64);
-        py = publicKey.substr(64, 64);
-    }
-    else {
-        const point = G.curve.decodePointHex(publicKey);
-        px = utils.leftPad(point.getX().toBigInteger().toRadix(16), 64);
-        py = utils.leftPad(point.getY().toBigInteger().toRadix(16), 64);
-    }
-    const data = utils.hexToArray(userId + a + b + gx + gy + px + py);
-    const entl = userId.length * 4;
-    data.unshift(entl & 0x00ff);
-    data.unshift((entl >> 8) & 0x00ff);
-    const z = sm3.sm3(data);
-    // e = hash(z || msg)
-    return utils.arrayToHex(sm3.sm3(z.concat(utils.hexToArray(hashHex))));
-}
-/**
- * 计算公钥
- */
-function getPublicKeyFromPrivateKey(privateKey) {
-    const PA = G.multiply(new BigInteger(privateKey, 16));
-    const x = utils.leftPad(PA.getX().toBigInteger().toString(16), 64);
-    const y = utils.leftPad(PA.getY().toBigInteger().toString(16), 64);
-    return "04" + x + y;
-}
-/**
- * 获取椭圆曲线点
- */
-function getPoint() {
-    const keypair = utils.generateKeyPairHex();
-    const PA = curve.decodePointHex(keypair.publicKey);
-    keypair.k = new BigInteger(keypair.privateKey, 16);
-    keypair.x1 = PA.getX().toBigInteger();
-    return keypair;
-}
-// es6 export
-const generateKeyPairHex = utils.generateKeyPairHex;
-const compressPublicKeyHex = utils.compressPublicKeyHex;
-const comparePublicKeyHex = utils.comparePublicKeyHex;
-const verifyPublicKey = utils.verifyPublicKey;
-
-exports.comparePublicKeyHex = comparePublicKeyHex;
-exports.compressPublicKeyHex = compressPublicKeyHex;
-exports.doDecrypt = doDecrypt;
-exports.doEncrypt = doEncrypt;
-exports.doSignature = doSignature;
-exports.doVerifySignature = doVerifySignature;
-exports.generateKeyPairHex = generateKeyPairHex;
-exports.getPoint = getPoint;
-exports.getPublicKeyFromPrivateKey = getPublicKeyFromPrivateKey;
-exports.verifyPublicKey = verifyPublicKey;

package/dist/cjs/crypto/sm/sm3/index.cjs

@@ -1,15 +0,0 @@
-'use strict';
-
-var sm3 = require('./sm3.cjs');
-
-/**
- * sm3 加密
- * @param {String} str 字符串
- * @param {Object} options 配置
- * @returns {String} 返回加密后的字符串
- */
-function encrypt(str, options) {
-    return sm3(str, options);
-}
-
-exports.encrypt = encrypt;