Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:bitwise (Results 151 - 175 of 677) sorted by null

1 2 3 4 5 67 8 91011>>

/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/
fenv.h	49 FE_ALL_EXCEPT bitwise OR of all supported exceptions
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/
fenv.h	49 FE_ALL_EXCEPT bitwise OR of all supported exceptions
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/
fenv.h	49 FE_ALL_EXCEPT bitwise OR of all supported exceptions
/system/core/include/cutils/
atomic.h	62 * Basic arithmetic and bitwise operations. These all provide a
/prebuilts/python/darwin-x86/2.7.5/include/python2.7/
abstract.h	774 Returns the bitwise negation of o on success, or NULL on 803 Returns the result of bitwise and of o1 and o2 on success, or 813 Returns the bitwise exclusive or of o1 by o2 on success, or 823 Returns the result of bitwise or on o1 and o2 on success, or     [all...]
/prebuilts/python/linux-x86/2.7.5/include/python2.7/
abstract.h	774 Returns the bitwise negation of o on success, or NULL on 803 Returns the result of bitwise and of o1 and o2 on success, or 813 Returns the bitwise exclusive or of o1 by o2 on success, or 823 Returns the result of bitwise or on o1 and o2 on success, or     [all...]
/frameworks/base/docs/html/reference/renderscript/
rs__atomic_8rsh.html	158 <p>Atomic Bitwise and a value from the value at addr. addr[0] &amp;= value</p> 194 <p>Atomic Bitwise and a value from the value at addr. addr[0] &amp;= value</p> 562 <p>Atomic Bitwise or a value from the value at addr. addr[0] |= value</p>     [all...]
/external/chromium/third_party/libevent/
event.3	256 preceeding events, via bitwise-OR to 258 can provide its callback function with a bitwise-OR of more than one triggered
/external/chromium_org/sandbox/win/src/
policy_engine_opcodes.h	78 OP_ULONG_AND_MATCH, // Match using bitwise AND; as in: n & a != 0. 350 // match: the value to bitwise AND against selected_param.
/external/chromium_org/third_party/libevent/
event.3	256 preceeding events, via bitwise-OR to 258 can provide its callback function with a bitwise-OR of more than one triggered
/external/llvm/utils/TableGen/
DFAPacketizerEmitter.cpp	385 // Compute the bitwise or of each unit used in this stage. 394 // Conduct bitwise or.
/external/srtp/doc/
draft-irtf-cfrg-icm-00.txt	159 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 A (…)
/frameworks/base/core/java/android/app/
Notification.java	280 * Bit to be bitwise-ored into the {@link #flags} field that should be 300 * Bit to be bitwise-ored into the {@link #flags} field that should be 309 * Bit to be bitwise-ored into the {@link #flags} field that if set, 316 * Bit to be bitwise-ored into the {@link #flags} field that should be 323 * Bit to be bitwise-ored into the {@link #flags} field that should be 331 * Bit to be bitwise-ored into the {@link #flags} field that should be 338 * Bit to be bitwise-ored into the {@link #flags} field that should be     [all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRBitSet.m	200 // perform a bitwise OR operation in place by changing underlying bit vector, growing it if necessary
/external/antlr/antlr-3.4/runtime/Python/antlr3/
dfa.py	205 # Is there a bitwise operation to do this?
/external/chromium/net/base/
cert_verifier.h	85 // |flags| is bitwise OR'd of X509Certificate::VerifyFlags.
/external/chromium_org/net/test/spawned_test_server/
base_test_server.h	137 // A bitwise-OR of BulkCipher that should be used by the
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/tests/
sunspider-crypto-sha1.html	140 * Bitwise rotate a 32-bit number to the left.
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/
crypto-sha1.js	136 * Bitwise rotate a 32-bit number to the left.
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
crypto-sha1.js	136 * Bitwise rotate a 32-bit number to the left.
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
crypto-sha1.js	136 * Bitwise rotate a 32-bit number to the left.
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/rtasm/
rtasm_ppc.h	176 ** vector bitwise operations
/external/chromium_org/third_party/openssl/openssl/crypto/engine/
eng_int.h	145 /* NB: Bitwise OR-able values for the "flags" variable in ENGINE are now exposed
/external/chromium_org/v8/src/
hydrogen-uint32-analysis.cc	70 // distinguish between int32 and uint32 due to their bitwise nature or
/external/chromium_org/v8/test/benchmarks/
testcfg.py	87 "sunspider/bitops-bitwise-and",

Completed in 2286 milliseconds

1 2 3 4 5 67 8 91011>>