OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:octets
(Results
101 - 125
of
735
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/dropbear/libtomcrypt/src/modes/lrw/
lrw_decrypt.c
24
@param len The length in
octets
, must be a multiple of 16
lrw_encrypt.c
24
@param len The length in
octets
, must be a multiple of 16
lrw_getiv.c
22
@param IV [out] The IV, must be 16
octets
/external/dropbear/libtomcrypt/src/modes/ofb/
ofb_setiv.c
23
@param len The length of the vector (in
octets
)
/external/dropbear/libtomcrypt/src/pk/asn1/der/octet/
der_length_octet_string.c
21
@param noctets The number of
octets
in the string to encode
/external/dropbear/libtomcrypt/src/pk/ecc/
ecc_get_size.c
29
@return The size (
octets
) of the key or INT_MAX on error
/external/srtp/crypto/include/
cipher.h
127
int key_length_octets; /*
octets
in key */
130
int plaintext_length_octets; /*
octets
in plaintext */
132
int ciphertext_length_octets; /*
octets
in plaintext */
209
* is the length in
octets
of the test data to be encrypted, and t is
/external/srtp/googlepatches/
google-5-buffer-overflow.patch
23
/* force last two
octets
of the offset to zero (for srtp compatibility) */
/external/wpa_supplicant_8/src/radius/
radius_server.h
74
* requiring A-ID to be 16
octets
in length, it is recommended to use
81
* eap_fast_a_id_len - Length of eap_fast_a_id buffer in
octets
169
* @identity_len: identity buffer length in
octets
195
* eap_req_id_text_len - Length of eap_req_id_text buffer in
octets
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
if_infiniband.h
27
#define INFINIBAND_ALEN 20 /*
Octets
in IPoIB HW addr */
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/
if_infiniband.h
27
#define INFINIBAND_ALEN 20 /*
Octets
in IPoIB HW addr */
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/
if_infiniband.h
27
#define INFINIBAND_ALEN 20 /*
Octets
in IPoIB HW addr */
/external/wpa_supplicant_8/src/ap/
accounting.c
24
/* Default interval in seconds for polling TX/RX
octets
from the driver if
26
* input/output
octets
and updates Acct-{Input,Output}-Gigawords. */
168
"Acct-Input-
Octets
=%lu Acct-Input-Gigawords=%u "
169
"Acct-Output-
Octets
=%lu Acct-Output-Gigawords=%u",
284
printf("Could not add Acct-Input-
Octets
\n");
301
printf("Could not add Acct-Output-
Octets
\n");
393
* @shared_secret_len: Length of shared_secret in
octets
/external/srtp/doc/
draft-irtf-cfrg-icm-00.txt
98
Crypto Forum Research Group David A. McGrew Internet Draft Cisco Systems, Inc. Expires April, 2003 October, 2002 Integer Counter Mode <draft-irtf-cfrg-icm-00.txt> Status of this Memo This document is an Internet Draft and is in full conformance with all provisions of Section 10 of RFC-2026. Internet Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and working groups. Note that other groups may also distribute working documents as Internet Drafts. Internet Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet Drafts as reference material or to cite them other than as "work in progress." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html. 1. Abstract This document specifies Integer Counter Mode (ICM), a mode of operation of a block cipher which defines an indexed keystream generator (which generates a keystream segment given an index). This mode is efficient, parallelizable, and has been proven secure given realistic assumptions about the block cipher. Test vectors are provided for AES. Counter Mode admits many variations. The variant specified in this document is secure and flexible, yet it enables a single implementation of a keystream generator to suffice in different application domains. McGrew [Page 1] Internet Draft Integer Counter Mode October, 2002 2. Notational Conventions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC-2119 [B97]. 3. Introduction Counter Mode is a way to define a pseudorandom keystream generator using a block cipher [CTR]. The keystream can be used for additive encryption, key derivation, or any other application requiring pseudorandom data. In ICM, the keystream is logically broken into segments. Each segment is identified with a segment index, and the segments have equal lengths. This segmentation makes ICM especially appropriate for securing packet-based protocols. 4. ICM In this section, ICM keystream generation and encryption are defined. 4.1. ICM Parameters The following parameters are used in ICM. These parameters MUST remain fixed for any given use of a key. Parameter Meaning ----------------------------------------------------------------- BLOCK_LENGTH the number of
octets
in the cipher block KEY_LENGTH the number of
octets
in the cipher key OFFSET_LENGTH the number of
octets
in the offset SEGMENT_INDEX_LENGTH the number of
octets
in the segment index BLOCK_INDEX_LENGTH the number of
octets
in the block index 4.2. Keystream Segments Conceptually, ICM is a keystream generator that takes a secret key and a segment index as an input and then outputs a keystream segment. The segmentation lends itself to packet encryption, as each keystream segment can be used to encrypt a distinct packet. A counter is a value containing BLOCK_LENGTH
octets
which is McGrew [Page 2] Internet Draft Integer Counter Mode October, 2002 incremented using an increment function based on integer addition, to produce a sequence of distinct values which are used as inputs to the block cipher. (In the context of this specification, an integer is an octet string, the most significant of which is the first.) The output blocks of the cipher are concatenated to form the keystream segment. The first octet of the segment is the first octet of the first output block, and so on. A schematic of this process is shown in Figure 1. Figure 1. The generation of a keystream segment given a segment index and a block cipher key K. Here C[i] and S[i] denote the ith counter and keystream block, respectively. segment index | v C[0] -----> C[1] -----> C[2] -----> ... | | | v v v +---+ +---+ +---+ K->| E | K->| E | K->| E | ... +---+ +---+ +---+ | | | v v v S[0] S[1] S[2] ... The ith counter C[i] of the keystream segment with segment index s is defined as C[i] = (i + s * (256^BLOCK_INDEX_LENGTH)) (+) r where r denotes the shifted Offset, which is defined as the Offset times 256^(BLOCK_LENGTH - OFFSET_LENGTH). (This multiplication left-shifts the Offset so that it is aligned with the leftmost edge of the block.) Here ^ denotes exponentiation and (+) denotes the bitwise exclusive-or operation. The number of blocks in any segment MUST NOT exceed 256^BLOCK_INDEX_LENGTH. The number of segments MUST NOT exceed 256^SEGMENT_INDEX_LENGTH. These restrictions ensure the uniqueness of each block cipher input. They also imply that each segment contains no more than (256^BLOCK_INDEX_LENGTH)*BLOCK_LENGTH
octets
. The sum of SEGMENT_INDEX_LENGTH and BLOCK_INDEX_LENGTH MUST NOT exceed BLOCK_LENGTH / 2. This requirement protects the ICM keystream generator from potentially failing to be pseudorandom (see McGrew [Page 3] Internet Draft Integer Counter Mode October, 2002 the rationale). Figure 2. An illustration of the structure of a counter with BLOCK_LENGTH = 8, SEGMENT_INDEX_LENGTH = 2, and BLOCK_INDEX_LENGTH = 2. The field marked `null' is not part of either the block or segment indices. 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | null | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | segment index | block index | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 4.3. ICM Encryption Unless otherwise specified, ICM encryption consists of bitwise exclusive-oring the keystream into the plaintext to produce the ciphertext. 4.4 ICM KEY An ICM key consists of the block cipher key and an Offset. The Offset is an integer with OFFSET_LENGTH
octets
, which is used to `randomize' the logical starting point of keystream. The Offset is crucial to providing security; see the rationale. The value of OFFSET_LENGTH SHOULD be at least half that of BLOCK_LENGTH. For the purposes of transporting an ICM key, e.g. in a signaling protocol, that key SHOULD be considered a sequence of
octets
in which the block cipher key precedes the Offset. 5. Implementation Considerations Implementation of the `add one modulo 2^m' operation is simple. For example, with BLOCK_LENGTH = 8 (m=64), it can be implemented in C as if (!++x) ++y; where x and y are 32-bit unsigned integers in network byte order. The implementation of general purpose addition modulo 2^m is slightly more complicated. The fact that the Offset is left-aligned enables an implementation McGrew [Page 4] Internet Draft Integer Counter Mode October, 2002 to avoid propagating carry values outside of the block index and/or the segment index. Choosing an OFFSET_LENGTH value equal to half that of BLOCK_LENGTH avoids all of these carries, since the Offset is then shifted so that it occupies the most significant
octets
of the block, while the block and segment indices occupy the least significant ones. 6. Para (…)
[
all
...]
/external/kernel-headers/original/linux/
if_vlan.h
23
#define VLAN_ETH_ALEN 6 /*
Octets
in one ethernet addr */
24
#define VLAN_ETH_HLEN 18 /* Total
octets
in header. */
25
#define VLAN_ETH_ZLEN 64 /* Min.
octets
in frame sans FCS */
30
#define VLAN_ETH_DATA_LEN 1500 /* Max.
octets
in payload */
31
#define VLAN_ETH_FRAME_LEN 1518 /* Max.
octets
in frame sans FCS */
/external/wpa_supplicant_8/src/wps/
wps.h
40
* @key_len: Key length in
octets
44
* @cred_attr_len: Length of cred_attr in
octets
74
* @device_name: Device Name (0..32
octets
encoded in UTF-8)
75
* @manufacturer: Manufacturer (0..64
octets
encoded in UTF-8)
76
* @model_name: Model Name (0..32
octets
encoded in UTF-8)
77
* @model_number: Model Number (0..32
octets
encoded in UTF-8)
78
* @serial_number: Serial Number (0..32
octets
encoded in UTF-8)
126
* pin_len - Length on pin in
octets
251
* @psk_len: The length of psk in
octets
292
* @dev_pw_len: Length of dev_pw in
octets
[
all
...]
/external/libvorbis/doc/
05-comment.tex
50
2) [vendor_string] = read a UTF-8 vector as [vendor_length]
octets
54
6) this iteration's user comment = read a UTF-8 vector as [length]
octets
214
Vendor string length (32 bit unsigned quantity specifying number of
octets
)
217
Vendor string ([vendor string length]
octets
coded from beginning of string to end of string, not null terminated)
223
Comment field 0 length (if [Number of comment fields] $>0$; 32 bit unsigned quantity specifying number of
octets
)
226
Comment field 0 ([Comment field 0 length]
octets
coded from beginning of string to end of string, not null terminated)
v-comment.html
111
2) [vendor_string] = read a UTF-8 vector as [vendor_length]
octets
116
6) this iteration's user comment = read a UTF-8 vector as [length]
octets
263
<li>Vendor string length (32 bit unsigned quantity specifying number of
octets
)</li>
264
<li>Vendor string ([vendor string length]
octets
coded from beginning of string
268
quantity specifying number of
octets
)</li>
269
<li>Comment field 0 ([Comment field 0 length]
octets
coded from beginning of
/packages/apps/UnifiedEmail/src/com/android/mail/lib/base/
PercentEscaper.java
151
boolean[]
octets
= new boolean[maxChar + 1];
153
octets
[c] = true;
156
octets
[c] = true;
159
octets
[c] = true;
162
octets
[c] = true;
164
return
octets
;
/packages/apps/UnifiedEmail/src/com/google/android/mail/common/base/
PercentEscaper.java
152
boolean[]
octets
= new boolean[maxChar + 1];
154
octets
[c] = true;
157
octets
[c] = true;
160
octets
[c] = true;
163
octets
[c] = true;
165
return
octets
;
/external/dropbear/libtomcrypt/src/headers/
tomcrypt_cipher.h
323
/** min keysize (
octets
) */
325
/** max keysize (
octets
) */
327
/** block size (
octets
) */
333
@param keylen The length of the input key (
octets
)
443
@param keylen The length of the secret key (
octets
)
448
@param headerlen The length of the header (
octets
)
450
@param ptlen The length of the plaintext (
octets
)
493
@param keylen The key length (
octets
)
495
@param inlen Length of message (
octets
)
507
@param keylen The key length (
octets
)
[
all
...]
/external/libppp/src/
lqr.c
374
u_int32_t LQRs, transitLQRs, pkts,
octets
, disc, err;
local
386
octets
= (newlqr->LastOutOctets - oldlqr->LastOutOctets) -
391
(int)
octets
,
octets
== 1 ? "" : "s");
395
octets
= (newlqr->PeerOutOctets - oldlqr->PeerOutOctets) -
399
(int)
octets
,
octets
== 1 ? "" : "s");
434
* All
octets
which are included in the FCS calculation MUST be counted,
436
* The FCS
octets
MUST also be counted, and one flag octet per frame
437
* MUST be counted. All other
octets
(such as additional fla
[
all
...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/
DERBoolean.java
65
byte[]
octets
)
67
return (
octets
[0] != 0) ? TRUE : FALSE;
/external/dropbear/libtomcrypt/src/mac/pelican/
pelican.c
28
@param keylen The length of the secret key (
octets
)
97
@param inlen The length input (
octets
)
/external/dropbear/libtomcrypt/src/misc/pkcs5/
pkcs_5_2.c
22
@param password_len The length of the password (
octets
)
24
@param salt_len The length of the salt (
octets
)
Completed in 1494 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>