Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for SipHash (0.03 seconds)

  1. android/guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

          for (int j = 0; j < i; ++j) {
            msg[j] = (byte) j;
          }
          assertSip(msg, EXPECTED[i]);
        }
      }
    
      // This test data comes from "SipHash: a fast short-input PRF", "Appendix A: Test values".
      // It can be downloaded here: https://131002.net/siphash/siphash.pdf
      public void test15ByteStringFromSipHashPaper() {
        byte[] message =
            new byte[] {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 6.8K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

          for (int j = 0; j < i; ++j) {
            msg[j] = (byte) j;
          }
          assertSip(msg, EXPECTED[i]);
        }
      }
    
      // This test data comes from "SipHash: a fast short-input PRF", "Appendix A: Test values".
      // It can be downloaded here: https://131002.net/siphash/siphash.pdf
      public void test15ByteStringFromSipHashPaper() {
        byte[] message =
            new byte[] {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 6.8K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/hash/SipHashFunction.java

     * or implied. See the License for the specific language governing permissions and limitations under
     * the License.
     */
    
    /*
     * SipHash-c-d was designed by Jean-Philippe Aumasson and Daniel J. Bernstein and is described in
     * "SipHash: a fast short-input PRF" (available at https://131002.net/siphash/siphash.pdf).
     */
    
    package com.google.common.hash;
    
    import static com.google.common.base.Preconditions.checkArgument;
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Feb 13 17:34:21 GMT 2025
    - 5.3K bytes
    - Click Count (0)
Back to Top