- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 50 for blockSize (0.15 sec)
-
src/vendor/golang.org/x/crypto/sha3/sha3.go
// Specific to SHA-3 and SHAKE. outputLen int // the default output size in bytes state spongeDirection // whether the sponge is absorbing or squeezing } // BlockSize returns the rate of sponge underlying this hash function. func (d *state) BlockSize() int { return d.rate } // Size returns the output size of the hash function in bytes. func (d *state) Size() int { return d.outputLen }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 5.4K bytes - Viewed (0) -
src/crypto/aes/gcm_ppc64x.go
// details. func (g *gcmAsm) Seal(dst, nonce, plaintext, data []byte) []byte { if len(nonce) != g.nonceSize { panic("cipher: incorrect nonce length given to GCM") } if uint64(len(plaintext)) > ((1<<32)-2)*BlockSize { panic("cipher: message too large for GCM") } ret, out := sliceForAppend(dst, len(plaintext)+g.tagSize) var counter, tagMask [gcmBlockSize]byte g.deriveCounter(&counter, nonce)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.4K bytes - Viewed (0) -
src/crypto/md5/md5block.go
package md5 import ( "internal/byteorder" "math/bits" ) func blockGeneric(dig *digest, p []byte) { // load state a, b, c, d := dig.s[0], dig.s[1], dig.s[2], dig.s[3] for i := 0; i <= len(p)-BlockSize; i += BlockSize { // eliminate bounds checks on p q := p[i:] q = q[:BlockSize:BlockSize] // save current state aa, bb, cc, dd := a, b, c, d // load input block x0 := byteorder.LeUint32(q[4*0x0:])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 5.2K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/sha3_s390x.go
func (s *asmState) Size() int { return s.outputLen } // BlockSize returns the hash's underlying block size. // The Write method must be able to accept any amount // of data, but it may operate more efficiently if all writes // are a multiple of the block size. func (s *asmState) BlockSize() int { return s.rate } // Clone returns a copy of the ShakeHash in its current state.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 7.5K bytes - Viewed (0) -
src/hash/adler32/adler32.go
// state of the hash. func New() hash.Hash32 { d := new(digest) d.Reset() return d } func (d *digest) Size() int { return Size } func (d *digest) BlockSize() int { return 4 } const ( magic = "adl\x01" marshaledSize = len(magic) + 4 ) func (d *digest) MarshalBinary() ([]byte, error) { b := make([]byte, 0, marshaledSize) b = append(b, magic...)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 3K bytes - Viewed (0) -
src/hash/maphash/maphash.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 19:15:34 UTC 2023 - 7.9K bytes - Viewed (0) -
cmd/xl-storage-format-utils_test.go
Size: 0, Mode: 0, Metadata: nil, Parts: nil, Erasure: ErasureInfo{ Algorithm: ReedSolomon.String(), DataBlocks: 4, ParityBlocks: 2, BlockSize: 10000, Index: 1, Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8}, Checksums: []ChecksumInfo{{ PartNumber: 1, Algorithm: HighwayHash256S, Hash: nil, }}, },
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 22:18:44 UTC 2024 - 7.1K bytes - Viewed (0) -
src/hash/crc64/crc64.go
// marshal and unmarshal the internal state of the hash. func New(tab *Table) hash.Hash64 { return &digest{0, tab} } func (d *digest) Size() int { return Size } func (d *digest) BlockSize() int { return 1 } func (d *digest) Reset() { d.crc = 0 } const ( magic = "crc\x02" marshaledSize = len(magic) + 8 + 8 ) func (d *digest) MarshalBinary() ([]byte, error) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 5.2K bytes - Viewed (0) -
src/hash/crc32/crc32.go
// and unmarshal the internal state of the hash. func NewIEEE() hash.Hash32 { return New(IEEETable) } func (d *digest) Size() int { return Size } func (d *digest) BlockSize() int { return 1 } func (d *digest) Reset() { d.crc = 0 } const ( magic = "crc\x01" marshaledSize = len(magic) + 4 + 4 ) func (d *digest) MarshalBinary() ([]byte, error) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 7.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/tensorflow/tests/fallback_to_flex_ops_legacy.mlir
// CHECK: return %[[SUB_0]] : tensor<15x28x28x1xf32> } // CHECK-LABEL: depth_to_space func.func @depth_to_space(%arg0: tensor<1x1x1x4xf32>) -> tensor<1x2x2x1xf32> { %0 = "tf.DepthToSpace"(%arg0) {block_size = 2: i64, data_format = "NHWC"}: (tensor<1x1x1x4xf32>) -> tensor<1x2x2x1xf32> func.return %0 : tensor<1x2x2x1xf32>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 09:41:17 UTC 2024 - 5.8K bytes - Viewed (0)