- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 127 for 65537 (0.06 seconds)
-
okhttp-dnsoverhttps/src/test/java/okhttp3/dnsoverhttps/DnsOverHttpsTest.kt
assertThat(ioe.message).isEqualTo("google.com") val cause = ioe.cause!! assertThat(cause).isInstanceOf<IOException>() assertThat(cause).hasMessage("response size exceeds limit (65536 bytes): 65537 bytes") } } @Test fun failOnBadResponse() { server.enqueue(dnsResponse("00")) try { dns.lookup("google.com") fail<Any>() } catch (ioe: IOException) {
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Nov 04 19:13:52 GMT 2025 - 11.9K bytes - Click Count (0) -
docs/tls/README.md
``` A response similar to this one should be displayed: ``` Generating RSA private key, 2048 bit long modulus ............................................+++ ...........+++ e is 65537 (0x10001) ``` Alternatively, use the following command to generate a private RSA key protected by a password: ```sh openssl genrsa -aes256 -passout pass:PASSWORD -out private.key 2048 ```
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 8.6K bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/ppc64.s
ADD $-1, R4 // 3884ffff ADD $-1, R4, R5 // 38a4ffff ADD $65535, R5 // 601fffff7cbf2a14 or 0600000038a5ffff ADD $65535, R5, R6 // 601fffff7cdf2a14 or 0600000038c5ffff ADD $65536, R6 // 3cc60001 ADD $65536, R6, R7 // 3ce60001 ADD $-32767, R5 // 38a58001 ADD $-32767, R5, R4 // 38858001
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Nov 21 18:27:17 GMT 2024 - 51.7K bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/loong64error.s
VSHUF4IV $16, V1, V2 // ERROR "operand out of range 0 to 15" XVSHUF4IV $16, X1, X2 // ERROR "operand out of range 0 to 15" ADDV16 $1, R4, R5 // ERROR "the constant must be a multiple of 65536." ADDV16 $65535, R4, R5 // ERROR "the constant must be a multiple of 65536." SC R4, 1(R5) // ERROR "offset must be a multiple of 4." SCV R4, 1(R5) // ERROR "offset must be a multiple of 4." LL 1(R5), R4 // ERROR "offset must be a multiple of 4."
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Oct 28 01:21:57 GMT 2025 - 689 bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
with different primes. continue } if err != nil { return nil, err } e := bigmod.NewNat().SetUint(65537) d, ok := bigmod.NewNat().InverseVarTime(e, λ) if !ok { // This checks that GCD(e, lcm(p-1, q-1)) = 1, which is equivalent // to checking GCD(e, p-1) = 1 and GCD(e, q-1) = 1 separately in // FIPS 186-5, Appendix A.1.3, steps 4.5 and 5.6. // // We waste a prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
src/main/java/jcifs/util/InputValidator.java
public static final int MAX_DOMAIN_LENGTH = 255; public static final int MAX_SHARE_NAME_LENGTH = 80; public static final int MAX_BUFFER_SIZE = 65536; // 64KB default max buffer public static final int MAX_SMB2_BUFFER_SIZE = 8388608; // 8MB for SMB2/3 public static final int MAX_CREDITS = 65535; // Patterns for validation private static final Pattern VALID_USERNAME = Pattern.compile("^[a-zA-Z0-9._\\-@]+$");Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 13.5K bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/s390x.s
AND R1, R2, R3 // b9e42031 AND $-2, R1 // a517fffe AND $-65536, R1 // c01bffff0000 AND $1, R1 // c0a100000001b980001a ANDW R1, R2 // 1421 ANDW R1, R2, R3 // b9f42031 ANDW $1, R1 // c01b00000001 ANDW $131071, R1 // a5160001 ANDW $65536, R1 // c01b00010000 ANDW $-2, R1 // a517fffe
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Jul 30 19:29:15 GMT 2025 - 22.9K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/info/Smb2SetInfoResponseTest.java
@Test @DisplayName("Test edge case with maximum buffer index") void testReadBytesWireFormatMaxBufferIndex() throws SMBProtocolDecodingException { byte[] buffer = new byte[65536]; // Large buffer int bufferIndex = 65534; // Near the end // Set structure size to 2 SMBUtil.writeInt2(2, buffer, bufferIndex); int result = response.readBytesWireFormat(buffer, bufferIndex);Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 10.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
with different primes. continue } if err != nil { return nil, err } e := bigmod.NewNat().SetUint(65537) d, ok := bigmod.NewNat().InverseVarTime(e, λ) if !ok { // This checks that GCD(e, lcm(p-1, q-1)) = 1, which is equivalent // to checking GCD(e, p-1) = 1 and GCD(e, q-1) = 1 separately in // FIPS 186-5, Appendix A.1.3, steps 4.5 and 5.6. // // We waste a prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing...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) -
src/test/java/jcifs/internal/smb1/trans/TransPeekNamedPipeResponseTest.java
// Arrange byte[] largeBuffer = new byte[65536]; // 64KB buffer // Act & Assert assertEquals(0, response.writeSetupWireFormat(largeBuffer, 0)); assertEquals(0, response.writeParametersWireFormat(largeBuffer, 32768)); assertEquals(0, response.writeDataWireFormat(largeBuffer, 65535)); assertEquals(0, response.readSetupWireFormat(largeBuffer, 0, 65536));Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.8K bytes - Click Count (0)