Rename back

Author: paulmillr

index.ts

@@ -56,7 +56,7 @@ class Point {
     this.pz = afield0(Z);
     frz(this);
   }
-  static from(bytes: Bytes): Point {
+  static fromBytes(bytes: Bytes): Point {
     au8(bytes);
     let p: Point | undefined = undefined;
     const head = bytes[0], tail = bytes.subarray(1);    // first byte is prefix, rest is data
@@ -202,14 +202,14 @@ const inv = (num: bigint, md: bigint): bigint => {      // modular inversion
   }
   return b === _1 ? M(x, md) : err('no inverse');       // b is gcd at this point
 };
-const normPriv = (pr: Bytes): bigint => {               // normalize private key to bigint
+const toPriv = (pr: Bytes): bigint => {               // normalize private key to bigint
   let num = b2n(au8(pr, L)); // convert to bigint when bytes
   return arange(num, _1, N, 'private key invalid 3');    // check if bigint is in range
 };
 const highS = (n: bigint): boolean => n > (N >> _1);     // if a number is bigger than CURVE.n/2
 /** Creates 33/65-byte public key from 32-byte private key. */
 const getPublicKey = (privKey: Bytes, isCompressed = true): Bytes => {
-  return G.mul(normPriv(privKey)).toBytes(isCompressed);
+  return G.mul(toPriv(privKey)).toBytes(isCompressed);
 }
 /** ECDSA Signature class. Supports only compact 64-byte representation, not DER. */
 class Signature {
@@ -254,7 +254,7 @@ const prepSig = (msgh: Bytes, priv: Bytes, opts: OptS = optS): BC => {// prepare
   if (lowS == null) lowS = true;                        // RFC6979 3.2: we skip step A
   const h1i = bits2int_modN(msgh);                 // msg bigint
   const h1o = i2o(h1i);                                 // msg octets
-  const d = normPriv(priv);                               // validate private key, convert to bigint
+  const d = toPriv(priv);                               // validate private key, convert to bigint
   const seed = [i2o(d), h1o];                           // Step D of RFC6979 3.2
   // RFC6979 3.6: additional k' (optional)
   if (extraEntropy) { // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')
@@ -381,7 +381,7 @@ const verify = (sig: Bytes, msgh: Bytes, pub: Bytes, opts: OptV = optV): boolean
   let { r, s } = new Signature(slc(sig, 0, L), slc(sig, L, L2)) // throw error when DER is suspected now.
   try {
     h = bits2int_modN(msgh);                      // Truncate hash
-    P = Point.from(pub);                           // Validate public key
+    P = Point.fromBytes(pub);                           // Validate public key
   } catch (e) { return false; }                         // Check sig for validity in both cases
   if (lowS && highS(s)) return false;                    // lowS bans sig.s >= CURVE.n/2
   let R: AffinePoint;                                   // Actual verification code begins here
@@ -406,7 +406,7 @@ const recoverPublicKey = (point: SignatureWithRecovery, msgh: Bytes): Point => {
   const radj = rec === 2 || rec === 3 ? r + N : r;    // If rec was 2 or 3, q.x is bigger than n
   afield(radj);                                       // ensure q.x is still a field element
   const head = isEvenN(rec) ? '02' : '03';         // head is 0x02 or 0x03
-  const R = Point.from(h2b(head + n2h(radj)));          // concat head + hex repr of r
+  const R = Point.fromBytes(h2b(head + n2h(radj)));          // concat head + hex repr of r
   const ir = inv(radj, N);                            // r^-1
   const u1 = modN(-h * ir);                           // -hr^-1
   const u2 = modN(s * ir);                            // sr^-1
@@ -423,7 +423,7 @@ const recoverPublicKey = (point: SignatureWithRecovery, msgh: Bytes): Point => {
  * @returns public key C
  */
 const getSharedSecret = (privA: Bytes, pubB: Bytes, isCompressed = true): Bytes => {
-  return Point.from(pubB).mul(normPriv(privA)).toBytes(isCompressed); // ECDH
+  return Point.fromBytes(pubB).mul(toPriv(privA)).toBytes(isCompressed); // ECDH
 };
 const randomBytes = (len = L): Bytes => {                   // CSPRNG (random number generator)
   const crypto = cr(); // Must be shimmed in node.js <= 18 to prevent error. See README.
@@ -461,7 +461,7 @@ const randomPrivateKey = (): Bytes => {
 }; // FIPS 186 B.4.1.
 /** Curve-specific utilities for private keys. */
 const utils = {                                         // utilities
-  isValidPrivateKey: (key: Bytes): boolean => { try { return !!normPriv(key); } catch (e) { return false; } },
+  isValidPrivateKey: (key: Bytes): boolean => { try { return !!toPriv(key); } catch (e) { return false; } },
   randomPrivateKey: randomPrivateKey as () => Bytes,
   // precompute: (w=8, p: Point = G): Point => { p.multiply(3n); w; return p; }, // no-op
 };
@@ -529,7 +529,7 @@ const taggedHashAsync = async (tag: string, ...messages: Bytes[]): Promise<Bytes
 const pointToBytes = (point: Point): Uint8Array<ArrayBuffer> => point.toBytes(true).slice(1);
 // Calculate point, scalar and bytes
 const extpubSchnorr = (priv: Bytes) => {
-  const d_ = normPriv(priv); // same method executed in fromPrivateKey
+  const d_ = toPriv(priv); // same method executed in fromPrivateKey
   const p = G.mul(d_); // P = d'⋅G; 0 < d' < n check is done inside
   const d = isEvenB(p.aff().y) ? d_ : modN(-d_);
   const px = pointToBytes(p);