- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 117 for hashed (0.03 sec)
-
cmd/user-provider-utils.go
if found { return providerPrefix // this is true for certificate and custom providers } return madmin.OpenIDProvider // openid users are already hashed, so no separator } return madmin.BuiltinProvider // default to internal } // getProviderInfoFromClaims - returns the provider info from the claims.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 4.1K bytes - Viewed (0) -
docs/en/docs/tutorial/security/oauth2-jwt.md
If your database is stolen, the thief won't have your users' plaintext passwords, only the hashes. So, the thief won't be able to try to use that password in another system (as many users use the same password everywhere, this would be dangerous). ## Install `passlib` { #install-passlib } PassLib is a great Python package to handle password hashes. It supports many secure hashing algorithms and utilities to work with them.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 10.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/HMACT64.java
/** * This is an implementation of the HMACT64 keyed hashing algorithm. * HMACT64 is defined by Luke Leighton as a modified HMAC-MD5 (RFC 2104) * in which the key is truncated at 64 bytes (rather than being hashed * via MD5). */ public class HMACT64 extends MessageDigest implements Cloneable { private static final int BLOCK_LENGTH = 64; private static final byte IPAD = (byte) 0x36;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 3.6K bytes - Viewed (0) -
src/main/java/jcifs/util/HMACT64.java
/** * This is an implementation of the HMACT64 keyed hashing algorithm. * HMACT64 is defined by Luke Leighton as a modified HMAC-MD5 (RFC 2104) * in which the key is truncated at 64 bytes (rather than being hashed * via MD5). */ class HMACT64 extends MessageDigest implements Cloneable { private static final int BLOCK_LENGTH = 64; private static final byte IPAD = (byte) 0x36;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 3.6K bytes - Viewed (0) -
cmd/erasure-sets_test.go
} if sipHashElement := hashKey("SIPMOD", "This will fail", 0, testUUID); sipHashElement != -1 { t.Errorf("Test: Expected \"-1\" but got \"%v\"", sipHashElement) } if sipHashElement := hashKey("UNKNOWN", "This will fail", 0, testUUID); sipHashElement != -1 { t.Errorf("Test: Expected \"-1\" but got \"%v\"", sipHashElement) } } // TestCrcHashMod - test crc hash. func TestCrcHashMod(t *testing.T) {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 6.8K bytes - Viewed (0) -
docs/en/docs/tutorial/extra-models.md
* The **output model** should not have a password. * The **database model** would probably need to have a hashed password. /// danger Never store user's plaintext passwords. Always store a "secure hash" that you can then verify. If you don't know, you will learn what a "password hash" is in the [security chapters](security/simple-oauth2.md#password-hashing){.internal-link target=_blank}. ///
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 7.2K bytes - Viewed (0) -
cmd/test-utils_test.go
// Sign given request using Signature V4. func signStreamingRequest(req *http.Request, accessKey, secretKey string, currTime time.Time) (string, error) { // Get hashed payload. hashedPayload := req.Header.Get("x-amz-content-sha256") if hashedPayload == "" { return "", fmt.Errorf("Invalid hashed payload") } // Set x-amz-date. req.Header.Set("x-amz-date", currTime.Format(iso8601Format)) // Get header map.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 77K bytes - Viewed (0) -
src/test/java/jcifs/util/HMACT64Test.java
// This test uses a real MD5 instance to verify the HMAC calculation logic // HMACT64 is a modified HMAC-MD5 where the key is truncated at 64 bytes // instead of being hashed when it exceeds the block size. byte[] key = { (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b, (byte) 0x0b,
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 14.6K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
diskCount := 0 for _, disk := range disks { if disk == nil { continue } diskCount++ } return diskCount } // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
int key2 = key1 ^ (1 << i); // get hashes int hash1 = function.hashInt(key1).asInt(); int hash2 = function.hashInt(key2).asInt(); // test whether the hash values have same output bits same |= ~(hash1 ^ hash2); // test whether the hash values have different output bits diff |= hash1 ^ hash2; count++;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 25.6K bytes - Viewed (0)