Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 181 - 190 of 287 for attacks (0.07 seconds)

  1. lib/fips140/v1.0.0-c2097c7c.zip

    q(em[0], 0) seed := em[1 : hash.Size()+1] db := em[hash.Size()+1:] mgf1XOR(seed, mgfHash, db) mgf1XOR(db, mgfHash, seed) lHash2 := db[0:hash.Size()] // We have to validate the plaintext in constant time in order to avoid // attacks like: J. Manger. A Chosen Ciphertext Attack on RSA Optimal // Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 // v2.0. In J. Kilian, editor, Advances in Cryptology. lHash2Good := subtle.ConstantTimeCompare(lHash, lHash2) // The remainder of the plaintext...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  2. LICENSE

          of your accepting any such warranty or additional liability.
    
       END OF TERMS AND CONDITIONS
    
       APPENDIX: How to apply the Apache License to your work.
    
          To apply the Apache License to your work, attach the following
          boilerplate notice, with the fields enclosed by brackets "[]"
          replaced with your own identifying information. (Don't include
          the brackets!)  The text should be enclosed in the appropriate
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Tue May 08 21:35:34 GMT 2018
    - 11.1K bytes
    - Click Count (0)
  3. LICENSE

          of your accepting any such warranty or additional liability.
    
       END OF TERMS AND CONDITIONS
    
       APPENDIX: How to apply the Apache License to your work.
    
          To apply the Apache License to your work, attach the following
          boilerplate notice, with the fields enclosed by brackets "[]"
          replaced with your own identifying information. (Don't include
          the brackets!)  The text should be enclosed in the appropriate
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Mon Jan 11 04:30:09 GMT 2021
    - 11.1K bytes
    - Click Count (0)
  4. LICENSES/vendor/cel.dev/expr/LICENSE

          of your accepting any such warranty or additional liability.
    
       END OF TERMS AND CONDITIONS
    
       APPENDIX: How to apply the Apache License to your work.
    
          To apply the Apache License to your work, attach the following
          boilerplate notice, with the fields enclosed by brackets "[]"
          replaced with your own identifying information. (Don't include
          the brackets!)  The text should be enclosed in the appropriate
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Nov 06 20:53:17 GMT 2024
    - 11.2K bytes
    - Click Count (0)
  5. LICENSE

          of your accepting any such warranty or additional liability.
    
       END OF TERMS AND CONDITIONS
    
       APPENDIX: How to apply the Apache License to your work.
    
          To apply the Apache License to your work, attach the following
          boilerplate notice, with the fields enclosed by brackets "[]"
          replaced with your own identifying information. (Don't include
          the brackets!)  The text should be enclosed in the appropriate
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Feb 22 18:59:39 GMT 2023
    - 11.1K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/util/concurrent/AggregateFuture.java

      /**
       * The input futures. After {@link #init}, this field is read only by {@link #afterDone()} (to
       * propagate cancellation) and {@link #toString()}. To access the futures' <i>values</i>, {@code
       * AggregateFuture} attaches listeners that hold references to one or more inputs. And in the case
       * of {@link CombinedFuture}, the user-supplied callback usually has its own references to inputs.
       */
      /*
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 16K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/util/concurrent/MoreExecutors.java

       *       directExecutor}, the listener can execute in any of three possible threads:
       *       <ol>
       *         <li>When a thread attaches a listener to a {@code ListenableFuture} that's already
       *             complete, the listener runs immediately in that thread.
       *         <li>When a thread attaches a listener to a {@code ListenableFuture} that's
       *             incomplete and the {@code ListenableFuture} later completes normally, the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Jan 28 22:39:02 GMT 2026
    - 45.6K bytes
    - Click Count (0)
  8. build-tools-internal/src/main/groovy/org/elasticsearch/gradle/internal/doc/RestTestsFromSnippetsTask.groovy

            /**
             * The last non-TESTRESPONSE snippet.
             */
            Snippet previousTest
    
            /**
             * Called each time a snippet is encountered. Tracks the snippets and
             * calls buildTest to actually build the test.
             */
            void handleSnippet(Snippet snippet) {
                if (RestTestsFromSnippetsTask.isConsoleCandidate(snippet)) {
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Tue Jun 01 09:19:30 GMT 2021
    - 19.5K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/ImmutableMultiset.java

          contents.add(checkNotNull(element), occurrences);
          return this;
        }
    
        /**
         * Adds or removes the necessary occurrences of an element such that the element attains the
         * desired count.
         *
         * @param element the element to add or remove occurrences of
         * @param count the desired count of the element in this multiset
         * @return this {@code Builder} object
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 21:07:18 GMT 2025
    - 20.6K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/CompactHashSet.java

          int expectedSize) {
        return new CompactHashSet<>(expectedSize);
      }
    
      /**
       * Maximum allowed false positive probability of detecting a hash flooding attack given random
       * input.
       */
      @VisibleForTesting(
          )
      static final double HASH_FLOODING_FPP = 0.001;
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 24.7K bytes
    - Click Count (0)
Back to Top