Package org.rabinfingerprint.polynomial

Examples of org.rabinfingerprint.polynomial.Polynomial.toBigInteger()

30
31
32
33
34
35
36
37
38
39
40
  private void precomputePopTable() {
    for (int i = 0; i < 256; i++) {
      Polynomial f = Polynomial.createFromLong(i);
      f = f.shiftLeft(BigInteger.valueOf(bytesPerWindow * 8));
      f = f.mod(poly);
      popTable[i] = f.toBigInteger().longValue();
    }
  }

  @Override
  public void pushBytes(final byte[] bytes) {
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
  private void precomputePushTable() {
    for (int i = 0; i < 512; i++) {
      Polynomial f = Polynomial.createFromLong(i);
      f = f.shiftLeft(poly.degree());
      f = f.xor(f.mod(poly));
      pushTable[i] = f.toBigInteger().longValue();
    }
  }

  @Override
  public void pushBytes(final byte[] bytes) {
View Full Code Here
15
16
17
18
19
20
21
22
23
24
25
  public void testPolynomialArithmetic() {
    Polynomial pa = Polynomial.createFromLong(0x53);
    Polynomial pb = Polynomial.createFromLong(0xCA);
    Polynomial pm = Polynomial.createFromLong(0x11B);
    Polynomial px = pa.multiply(pb);
    assertEquals(0x3F7E, px.toBigInteger().longValue());
    Polynomial pabm = px.mod(pm);
    assertEquals(0x1, pabm.toBigInteger().longValue());
  }

  /**
 
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
    Polynomial pb = Polynomial.createFromLong(0xCA);
    Polynomial pm = Polynomial.createFromLong(0x11B);
    Polynomial px = pa.multiply(pb);
    assertEquals(0x3F7E, px.toBigInteger().longValue());
    Polynomial pabm = px.mod(pm);
    assertEquals(0x1, pabm.toBigInteger().longValue());
  }

  /**
   * According to Rabin, the expected number of tests required to find an
   * irreducible polynomial from a randomly chosen monic polynomial of degree
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.