Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for squareMod (0.07 seconds)

  1. guava/src/com/google/common/math/LongMath.java

        /** Returns a^2 mod m. */
        abstract long squareMod(long a, long m);
    
        /** Returns a^p mod m. */
        private long powMod(long a, long p, long m) {
          long res = 1;
          for (; p != 0; p >>= 1) {
            if ((p & 1) != 0) {
              res = mulMod(res, a, m);
            }
            a = squareMod(a, m);
          }
          return res;
        }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Nov 03 21:01:09 GMT 2025
    - 46.8K bytes
    - Click Count (0)
  2. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    1F14A         ; mapped                 ; 0068 0076     # 5.2  SQUARED HV
    1F14B         ; mapped                 ; 006D 0076     # 5.2  SQUARED MV
    1F14C         ; mapped                 ; 0073 0064     # 5.2  SQUARED SD
    1F14D         ; mapped                 ; 0073 0073     # 5.2  SQUARED SS
    1F14E         ; mapped                 ; 0070 0070 0076 #5.2  SQUARED PPV
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  3. RELEASE.md

        *   DType is no longer convertible to an int. Use `dtype.as_datatype_enum`
            instead of `int(dtype)` to get the same result.
        *   Support both binary and -1/1 label input in v2 hinge and squared hinge
            losses.
        *   Added `LinearOperator.adjoint` and `LinearOperator.H` (alias).
        *   Expose CriticalSection in core as `tf.CriticalSection`.
        *   Enhanced graphviz output.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    2^201 - 2 for i := 1; i < 50; i++ { // 2^250 - 2^50 t1.Square(&t1) } t0.Multiply(&t1, &t0) // 2^250 - 1 t0.Square(&t0) // 2^251 - 2 t0.Square(&t0) // 2^252 - 4 return v.Multiply(&t0, x) // 2^252 - 3 -> x^(2^252-3) } // sqrtM1 is 2^((p-1)/4), which squared is equal to -1 by Euler's Criterion. var sqrtM1 = &Element{1718705420411056, 234908883556509, 2233514472574048, 2117202627021982, 765476049583133} // SqrtRatio sets r to the non-negative square root of the ratio of u and v. // // If u/v is square,...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    2^201 - 2 for i := 1; i < 50; i++ { // 2^250 - 2^50 t1.Square(&t1) } t0.Multiply(&t1, &t0) // 2^250 - 1 t0.Square(&t0) // 2^251 - 2 t0.Square(&t0) // 2^252 - 4 return v.Multiply(&t0, x) // 2^252 - 3 -> x^(2^252-3) } // sqrtM1 is 2^((p-1)/4), which squared is equal to -1 by Euler's Criterion. var sqrtM1 = &Element{1718705420411056, 234908883556509, 2233514472574048, 2117202627021982, 765476049583133} // SqrtRatio sets r to the non-negative square root of the ratio of u and v. // // If u/v is square,...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top