- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for 00011111b (0.09 sec)
-
src/test/java/jcifs/internal/smb2/nego/Smb2NegotiateResponseTest.java
} @Test @DisplayName("Should check capability correctly") void testHaveCapability() throws Exception { // Given setPrivateField(response, "commonCapabilities", 0x2F); // 0010 1111 // Then assertTrue(response.haveCapabilitiy(0x01)); // Has this bit assertTrue(response.haveCapabilitiy(0x0F)); // Has all these bits
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 32.5K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
little-endian bit-ordering convention, these are "01" for SHA-3 // and "1111" for SHAKE, or 00000010b and 00001111b, respectively. Then the // padding rule from section 5.1 is applied to pad the message to a multiple // of the rate, which involves adding a "1" bit, zero or more "0" bits, and // a final "1" bit. We merge the first "1" bit from the padding into dsbyte, // giving 00000110b (0x06) and 00011111b (0x1f). // [1] http://csrc.nist.gov/publications/drafts/fips-202/fips_202_draft.pdf // "Draft FIPS...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)