gc2-polynomial.js

import * as math from '../math.js'
import * as webcrypto from 'lib0/webcrypto'
import * as array from '../array.js'
import * as buffer from '../buffer.js'
import * as error from '../error.js'
import * as map from '../map.js'

/**
 * @param {number} degree
 */
const _degreeToMinByteLength = degree => math.floor(degree / 8) + 1

/**
 * This is a GC2 Polynomial abstraction that is not meant for production!
 *
 * It is easy to understand and it's correctness is as obvious as possible. It can be used to verify
 * efficient implementations of algorithms on GC2.
 */
export class GC2Polynomial {
  constructor () {
    /**
      * @type {Set<number>}
      */
    this.degrees = new Set()
  }
}

/**
 * @param {Uint8Array} bytes
 */
export const createFromBytes = bytes => {
  const p = new GC2Polynomial()
  for (let bsi = bytes.length - 1, currDegree = 0; bsi >= 0; bsi--) {
    const currByte = bytes[bsi]
    for (let i = 0; i < 8; i++) {
      if (((currByte >>> i) & 1) === 1) {
        p.degrees.add(currDegree)
      }
      currDegree++
    }
  }
  return p
}

/**
 * Least-significant-byte-first
 *
 * @param {Uint8Array} bytes
 */
export const createFromBytesLsb = bytes => {
  const p = new GC2Polynomial()
  for (let bsi = 0, currDegree = 0; bsi < bytes.length; bsi++) {
    const currByte = bytes[bsi]
    for (let i = 0; i < 8; i++) {
      if (((currByte >>> i) & 1) === 1) {
        p.degrees.add(currDegree)
      }
      currDegree++
    }
  }
  return p
}

/**
 * @param {GC2Polynomial} p
 * @param {number} byteLength
 */
export const toUint8Array = (p, byteLength = _degreeToMinByteLength(getHighestDegree(p))) => {
  const buf = buffer.createUint8ArrayFromLen(byteLength)
  /**
   * @param {number} i
   */
  const setBit = i => {
    const bi = math.floor(i / 8)
    buf[buf.length - 1 - bi] |= (1 << (i % 8))
  }
  p.degrees.forEach(setBit)
  return buf
}

/**
 * @param {GC2Polynomial} p
 * @param {number} byteLength
 */
export const toUint8ArrayLsb = (p, byteLength) => {
  const buf = buffer.createUint8ArrayFromLen(byteLength)
  /**
   * @param {number} i
   */
  const setBit = i => {
    const bi = math.floor(i / 8)
    buf[bi] |= (1 << (i % 8))
  }
  p.degrees.forEach(setBit)
  return buf
}

/**
 * Create from unsigned integer (max 32bit uint) - read most-significant-byte first.
 *
 * @param {number} uint
 */
export const createFromUint = uint => {
  const buf = new Uint8Array(4)
  for (let i = 0; i < 4; i++) {
    buf[i] = uint >>> 8 * (3 - i)
  }
  return createFromBytes(buf)
}

/**
 * Create a random polynomial of a specified degree.
 *
 * @param {number} degree
 */
export const createRandom = degree => {
  const bs = new Uint8Array(_degreeToMinByteLength(degree))
  webcrypto.getRandomValues(bs)
  // Get first byte and explicitly set the bit of "degree" to 1 (the result must have the specified
  // degree).
  const firstByte = bs[0] | 1 << (degree % 8)
  // Find out how many bits of the first byte need to be filled with zeros because they are >degree.
  const zeros = 7 - (degree % 8)
  bs[0] = ((firstByte << zeros) & 0xff) >>> zeros
  return createFromBytes(bs)
}

/**
 * @param {GC2Polynomial} p
 * @return number
 */
export const getHighestDegree = p => array.fold(array.from(p.degrees), 0, math.max)

/**
 * Add (+) p2 int the p1 polynomial.
 *
 * Addition is defined as xor in F2. Substraction is equivalent to addition in F2.
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const addInto = (p1, p2) => {
  p2.degrees.forEach(degree => {
    if (p1.degrees.has(degree)) {
      p1.degrees.delete(degree)
    } else {
      p1.degrees.add(degree)
    }
  })
}

/**
 * Or (|) p2 into the p1 polynomial.
 *
 * Addition is defined as xor in F2. Substraction is equivalent to addition in F2.
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const orInto = (p1, p2) => {
  p2.degrees.forEach(degree => {
    p1.degrees.add(degree)
  })
}

/**
 * Add (+) p2 to the p1 polynomial.
 *
 * Addition is defined as xor in F2. Substraction is equivalent to addition in F2.
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const add = (p1, p2) => {
  const result = new GC2Polynomial()
  p2.degrees.forEach(degree => {
    if (!p1.degrees.has(degree)) {
      result.degrees.add(degree)
    }
  })
  p1.degrees.forEach(degree => {
    if (!p2.degrees.has(degree)) {
      result.degrees.add(degree)
    }
  })
  return result
}

/**
 * Add (+) p2 to the p1 polynomial.
 *
 * Addition is defined as xor in F2. Substraction is equivalent to addition in F2.
 *
 * @param {GC2Polynomial} p
 */
export const clone = (p) => {
  const result = new GC2Polynomial()
  p.degrees.forEach(d => result.degrees.add(d))
  return result
}

/**
 * Add (+) p2 to the p1 polynomial.
 *
 * Addition is defined as xor in F2. Substraction is equivalent to addition in F2.
 *
 * @param {GC2Polynomial} p
 * @param {number} degree
 */
export const addDegreeInto = (p, degree) => {
  if (p.degrees.has(degree)) {
    p.degrees.delete(degree)
  } else {
    p.degrees.add(degree)
  }
}

/**
 * Multiply (•) p1 with p2 and store the result in p1.
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const multiply = (p1, p2) => {
  const result = new GC2Polynomial()
  p1.degrees.forEach(degree1 => {
    p2.degrees.forEach(degree2 => {
      addDegreeInto(result, degree1 + degree2)
    })
  })
  return result
}

/**
 * Multiply (•) p1 with p2 and store the result in p1.
 *
 * @param {GC2Polynomial} p
 * @param {number} shift
 */
export const shiftLeft = (p, shift) => {
  const result = new GC2Polynomial()
  p.degrees.forEach(degree => {
    const r = degree + shift
    r >= 0 && result.degrees.add(r)
  })
  return result
}

/**
 * Multiply (•) p1 with p2 and store the result in p1.
 *
 * @param {GC2Polynomial} p
 * @param {number} shift
 */
export const shiftRight = (p, shift) => shiftLeft(p, -shift)

/**
 * Computes p1 % p2. I.e. the remainder of p1/p2.
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const mod = (p1, p2) => {
  const maxDeg1 = getHighestDegree(p1)
  const maxDeg2 = getHighestDegree(p2)
  const result = clone(p1)
  for (let i = maxDeg1 - maxDeg2; i >= 0; i--) {
    if (result.degrees.has(maxDeg2 + i)) {
      const shifted = shiftLeft(p2, i)
      addInto(result, shifted)
    }
  }
  return result
}

/**
 * Computes (p^e mod m).
 *
 * http://en.wikipedia.org/wiki/Modular_exponentiation
 *
 * @param {GC2Polynomial} p
 * @param {number} e
 * @param {GC2Polynomial} m
 */
export const modPow = (p, e, m) => {
  let result = ONE
  while (true) {
    if ((e & 1) === 1) {
      result = mod(multiply(result, p), m)
    }
    e >>>= 1
    if (e === 0) {
      return result
    }
    p = mod(multiply(p, p), m)
  }
}

/**
 * Find the greatest common divisor using Euclid's Algorithm.
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const gcd = (p1, p2) => {
  while (p2.degrees.size > 0) {
    const modded = mod(p1, p2)
    p1 = p2
    p2 = modded
  }
  return p1
}

/**
 * true iff p1 equals p2
 *
 * @param {GC2Polynomial} p1
 * @param {GC2Polynomial} p2
 */
export const equals = (p1, p2) => {
  if (p1.degrees.size !== p2.degrees.size) return false
  for (const d of p1.degrees) {
    if (!p2.degrees.has(d)) return false
  }
  return true
}

const X = createFromBytes(new Uint8Array([2]))
const ONE = createFromBytes(new Uint8Array([1]))

/**
 * Computes ( x^(2^p) - x ) mod f
 *
 * (shamelessly copied from
 * https://github.com/opendedup/rabinfingerprint/blob/master/src/org/rabinfingerprint/polynomial/Polynomial.java)
 *
 * @param {GC2Polynomial} f
 * @param {number} p
 */
const reduceExponent = (f, p) => {
  // compute (x^q^p mod f)
  const q2p = math.pow(2, p)
  const x2q2p = modPow(X, q2p, f)
  // subtract (x mod f)
  return mod(add(x2q2p, X), f)
}

/**
 * BenOr Reducibility Test
 *
 * Tests and Constructions of Irreducible Polynomials over Finite Fields
 * (1997) Shuhong Gao, Daniel Panario
 *
 * http://citeseer.ist.psu.edu/cache/papers/cs/27167/http:zSzzSzwww.math.clemson.eduzSzfacultyzSzGaozSzpaperszSzGP97a.pdf/gao97tests.pdf
 *
 * @param {GC2Polynomial} p
 */
export const isIrreducibleBenOr = p => {
  const degree = getHighestDegree(p)
  for (let i = 1; i < degree / 2; i++) {
    const b = reduceExponent(p, i)
    const g = gcd(p, b)
    if (!equals(g, ONE)) {
      return false
    }
  }
  return true
}

/**
 * @param {number} degree
 */
export const createIrreducible = degree => {
  while (true) {
    const p = createRandom(degree)
    if (isIrreducibleBenOr(p)) return p
  }
}

/**
 * Create a fingerprint of buf using the irreducible polynomial m.
 *
 * @param {Uint8Array} buf
 * @param {GC2Polynomial} m
 */
export const fingerprint = (buf, m) => toUint8Array(mod(createFromBytes(buf), m), _degreeToMinByteLength(getHighestDegree(m) - 1))

export class FingerprintEncoder {
  /**
   * @param {GC2Polynomial} m The irreducible polynomial
   */
  constructor (m) {
    this.fingerprint = new GC2Polynomial()
    this.m = m
  }

  /**
   * @param {number} b
   */
  write (b) {
    const bp = createFromBytes(new Uint8Array([b]))
    const fingerprint = shiftLeft(this.fingerprint, 8)
    orInto(fingerprint, bp)
    this.fingerprint = mod(fingerprint, this.m)
  }

  getFingerprint () {
    return toUint8Array(this.fingerprint, _degreeToMinByteLength(getHighestDegree(this.m) - 1))
  }
}

/**
 * Shift modulo polynomial i bits to the left. Expect that bs[0] === 1.
 *
 * @param {Uint8Array} bs
 * @param {number} lshift
 */
const _shiftBsLeft = (bs, lshift) => {
  if (lshift === 0) return bs
  bs = new Uint8Array(bs)
  bs[0] <<= lshift
  for (let i = 1; i < bs.length; i++) {
    bs[i - 1] |= bs[i] >>> (8 - lshift)
    bs[i] <<= lshift
  }
  return bs
}

export class EfficientFingerprintEncoder {
  /**
   * @param {Uint8Array} m assert(m[0] === 1)
   */
  constructor (m) {
    this.m = m
    this.blen = m.byteLength
    this.bs = new Uint8Array(this.blen)
    /**
     * This describes the position of the most significant byte (starts with 0 and increases with
     * shift)
     */
    this.bpos = 0
  }

  /**
   * Add/Xor/Substract bytes.
   *
   * Discards bytes that are out of range.
   * @todo put this in function or inline
   *
   * @param {Uint8Array} cs
   */
  add (cs) {
    const copyLen = math.min(this.blen, cs.byteLength)
    // copy from right to left until max is reached
    for (let i = 0; i < copyLen; i++) {
      this.bs[(this.bpos + this.blen - i - 1) % this.blen] ^= cs[cs.byteLength - i - 1]
    }
  }

  /**
   * @param {number} byte
   */
  write (byte) {
    // [0,m1,m2,b]
    //  x            <- bpos
    // Shift one byte to the left, add b
    this.bs[this.bpos] = byte
    this.bpos = (this.bpos + 1) % this.blen
    // mod
    for (let i = 7; i >= 0; i--) {
      if (((this.bs[this.bpos] >>> i) & 1) === 1) {
        this.add(_shiftBsLeft(this.m, i))
      }
    }
    if (this.bs[this.bpos] !== 0) { error.unexpectedCase() }
    // assert(this.bs[this.bpos] === 0)
  }

  getFingerprint () {
    const result = new Uint8Array(this.blen - 1)
    for (let i = 0; i < result.byteLength; i++) {
      result[i] = this.bs[(this.bpos + i + 1) % this.blen]
    }
    return result
  }
}

/**
 * @param {Uint8Array} bs1
 * @param {Uint8Array} bs2
 */
export const xorBuffers = (bs1, bs2) => {
  const res = new Uint8Array(bs1.byteLength)
  if (bs1.byteLength !== bs2.byteLength) error.unexpectedCase()
  for (let i = 0; i < res.byteLength; i++) {
    res[i] = bs1[i] ^ bs2[i]
  }
  return res
}

/**
 * Maps from a modulo to the precomputed values.
 *
 * @type {Map<Uint8Array,Uint8Array>}
 */
const _precomputedFingerprintCache = new Map()

/**
 * @param {Uint8Array} m
 */
const ensureCache = m => map.setIfUndefined(_precomputedFingerprintCache, m, () => {
  const byteLen = m.byteLength
  const cache = new Uint8Array(256 * byteLen)
  /**
   * @todo not necessary, can be written directly
   * @param {number} msb
   * @param {Uint8Array} result
   */
  const writeCacheResult = (msb, result) => {
    for (let i = 0; i < result.byteLength; i++) {
      cache[msb * byteLen + i] = result[i]
    }
  }
  writeCacheResult(1, m) // can be written using a native function
  // 10101010
  for (let bit = 1; bit < 8; bit++) {
    const mBitShifted = _shiftBsLeft(m, bit)
    const bitShifted = 1 << bit
    for (let j = 0; j < bitShifted; j++) {
      // rest is already precomputed
      const rest = (bitShifted | j) ^ mBitShifted[0]
      // @todo xorBuffers (and creating views) is not necessary
      writeCacheResult(bitShifted | j, xorBuffers(cache.slice(rest * byteLen, rest * byteLen + byteLen), mBitShifted))
      if (cache[(bitShifted | j) * byteLen] !== (bitShifted | j)) { error.unexpectedCase() }
    }
  }
  return cache
})

export class CachedEfficientFingerprintEncoder {
  /**
   * @param {Uint8Array} m assert(m[0] === 1)
   */
  constructor (m) {
    this.m = m
    this.blen = m.byteLength
    this.bs = new Uint8Array(this.blen)
    this.cache = ensureCache(m)
    /**
     * This describes the position of the most significant byte (starts with 0 and increases with
     * shift)
     */
    this.bpos = 0
  }

  /**
   * @param {number} byte
   */
  write (byte) {
    // [0,m1,m2,b]
    //  x            <- bpos
    // Shift one byte to the left, add b
    this.bs[this.bpos] = byte
    this.bpos = (this.bpos + 1) % this.blen
    const msb = this.bs[this.bpos]
    for (let i = 0; i < this.blen; i++) {
      this.bs[(this.bpos + i) % this.blen] ^= this.cache[msb * this.blen + i]
    }
    if (this.bs[this.bpos] !== 0) { error.unexpectedCase() }
  }

  getFingerprint () {
    const result = new Uint8Array(this.blen - 1)
    for (let i = 0; i < result.byteLength; i++) {
      result[i] = this.bs[(this.bpos + i + 1) % this.blen]
    }
    return result
  }
}