Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 71 - 80 of 458 for Hashing (0.07 seconds)

  1. docs/de/docs/tutorial/security/oauth2-jwt.md

    # OAuth2 mit Passwort (und Hashing), Bearer mit JWT-Tokens { #oauth2-with-password-and-hashing-bearer-with-jwt-tokens }
    
    Da wir nun über den gesamten Sicherheitsablauf verfügen, machen wir die Anwendung tatsächlich sicher, indem wir <abbr title="JSON Web Tokens">JWT</abbr>-Tokens und sicheres Passwort-Hashing verwenden.
    
    Diesen Code können Sie tatsächlich in Ihrer Anwendung verwenden, die Passwort-Hashes in Ihrer Datenbank speichern, usw.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 12.9K bytes
    - Click Count (0)
  2. docs/es/docs/tutorial/security/oauth2-jwt.md

    # OAuth2 con Password (y hashing), Bearer con tokens JWT { #oauth2-with-password-and-hashing-bearer-with-jwt-tokens }
    
    Ahora que tenemos todo el flujo de seguridad, hagamos que la aplicación sea realmente segura, usando tokens <abbr title="JSON Web Tokens">JWT</abbr> y hashing de contraseñas seguras.
    
    Este código es algo que puedes usar realmente en tu aplicación, guardar los hashes de las contraseñas en tu base de datos, etc.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 11.5K bytes
    - Click Count (0)
  3. docs/de/docs/tutorial/security/simple-oauth2.md

    Sie sollten niemals Klartext-Passwörter speichern, daher verwenden wir ein (gefaktes) Passwort-Hashing-System.
    
    Wenn die Passwörter nicht übereinstimmen, geben wir denselben Fehler zurück.
    
    #### Passwort-Hashing { #password-hashing }
    
    „Hashing“ bedeutet: Konvertieren eines Inhalts (in diesem Fall eines Passworts) in eine Folge von Bytes (ein schlichter String), die wie Kauderwelsch aussieht.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 11.1K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

      }
    
      public void testToString() {
        assertThat(SIP_WITH_KEY.toString()).isEqualTo("Hashing.sipHash24(" + K0 + ", " + K1 + ")");
        assertThat(SIP_WITHOUT_KEY.toString()).isEqualTo("Hashing.sipHash24(" + K0 + ", " + K1 + ")");
        assertThat(sipHash24(20, 13).toString()).isEqualTo("Hashing.sipHash24(20, 13)");
      }
    
      private static void assertSip(String input, long expected) {
    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)
  5. guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

      }
    
      public void testToString() {
        assertThat(SIP_WITH_KEY.toString()).isEqualTo("Hashing.sipHash24(" + K0 + ", " + K1 + ")");
        assertThat(SIP_WITHOUT_KEY.toString()).isEqualTo("Hashing.sipHash24(" + K0 + ", " + K1 + ")");
        assertThat(sipHash24(20, 13).toString()).isEqualTo("Hashing.sipHash24(20, 13)");
      }
    
      private static void assertSip(String input, long expected) {
    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)
  6. android/guava-tests/test/com/google/common/hash/ChecksumHashFunctionTest.java

     * the License.
     */
    
    package com.google.common.hash;
    
    import static com.google.common.hash.Hashing.ChecksumType.ADLER_32;
    import static com.google.common.hash.Hashing.ChecksumType.CRC_32;
    import static com.google.common.truth.Truth.assertThat;
    
    import java.util.zip.Checksum;
    import junit.framework.TestCase;
    import org.jspecify.annotations.NullUnmarked;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 3.3K bytes
    - Click Count (0)
  7. CHANGELOG/CHANGELOG-1.7.md

    ([#45003](https://github.com/kubernetes/kubernetes/pull/45003), [@krmayankk](https://github.com/krmayankk))
    
    * Deployments are updated to use (1) a more stable hashing algorithm (fnv) than the previous one (adler) and (2) a hashing collision avoidance mechanism that will ensure new rollouts will not block on hashing collisions anymore. ([#44774](https://github.com/kubernetes/kubernetes/pull/44774), [@kargakis](https://github.com/kargakis))([kubernetes/features#287](https://github.com/...
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu May 05 13:44:43 GMT 2022
    - 308.7K bytes
    - Click Count (1)
  8. docs/es/docs/tutorial/security/simple-oauth2.md

    Nunca deberías guardar passwords en texto plano, así que, usaremos el sistema de hash de passwords (falso).
    
    Si los passwords no coinciden, devolvemos el mismo error.
    
    #### Hashing de passwords { #password-hashing }
    
    "Hacer hash" significa: convertir algún contenido (un password en este caso) en una secuencia de bytes (solo un string) que parece un galimatías.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 10.2K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/RegularImmutableMultiset.java

     * the License.
     */
    
    package com.google.common.collect;
    
    import static com.google.common.base.Preconditions.checkNotNull;
    import static com.google.common.collect.Hashing.closedTableSize;
    import static com.google.common.collect.Hashing.smearedHash;
    import static com.google.common.collect.ImmutableList.asImmutableList;
    
    import com.google.common.annotations.GwtCompatible;
    import com.google.common.annotations.GwtIncompatible;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 6.8K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/RegularImmutableMap.java

       * double the index of the entry in entrySet.asList.)
       *
       * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing.
       * The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length],
       * save that if that location is already full, we try the next index, and the next, until we
       * find an empty table position.  Since the table has a power-of-two size, we use
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 22.5K bytes
    - Click Count (0)
Back to Top