Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:significant (Results 401 - 425 of 2519) sorted by null

<<11121314151617181920>>

/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
floatnum.c	46 * Only L.O. bit of Sign byte is significant. The rest is zero. 338 /* eliminate any leading zeros (which do not count as significant digits) */ 344 * of the zeros after the decimal point and not count them as significant 356 /* See if we've processed more than the max significant digits: */ 389 /* See if we've processed more than 19 significant digits: */
/ndk/sources/android/support/src/msun/
math_private.h	105 /* Get the more significant 32 bit int from a double. */ 114 /* Get the less significant 32 bit int from a double. */ 141 /* Set the more significant 32 bits of a double from an int. */ 151 /* Set the less significant 32 bits of a double from an int. */ 403 * significantly relative to b. The caller must ensure that significant
/external/chromium_org/components/history/core/browser/
url_database.h	151 // that are historically significant: ones having been visited within 3 days, 308 // Constants which specify, when considered altogether, 'significant' 315 // Returns the date threshold for considering an history item as significant.
/external/chromium_org/net/quic/crypto/
strike_register.cc	207 // to find the most significant differing bit. We could do this with a simple 209 // with a byte where all the bits below the most significant one, are set. 214 // most-significant one.
/external/chromium_org/third_party/libsrtp/srtp/doc/
draft-irtf-cfrg-icm-00.txt	125 is an octet string, the most significant of which is the first.) 239 is then shifted so that it occupies the most significant octets of 241 significant ones.
/external/kernel-headers/original/uapi/linux/
fb.h	183 * components. Offset specifies the position of the least significant bit 190 __u32 msb_right; /* != 0 : Most significant bit is */ 252 struct fb_bitfield green; /* else only length is significant */
/external/linux-tools-perf/perf-3.12.0/tools/perf/
design.txt	74 raw_type: 1 bit (most significant bit) 0x8000_0000_0000_0000 75 type: 7 bits (next most significant) 0x7f00_0000_0000_0000 76 event_id: 56 bits (least significant) 0x00ff_ffff_ffff_ffff
/external/nanopb-c/
pb.h	17 * stores the most-significant byte first. */ 130 * Least-significant 4 bits tell the scalar type 131 * Most-significant 4 bits specify repeated/required/packed etc.
/external/srtp/doc/
draft-irtf-cfrg-icm-00.txt	125 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. Parameters and Test Vectors for AES This section provides ICM parameters and test ve (…)
/external/tremolo/Tremolo/
treminfo.c	358 case 0x01: /* least significant *bit* is read first */ 370 case 0x03: /* least significant *bit* is read first */ 378 case 0x05: /* least significant *bit* is read first */
/libcore/luni/src/main/java/javax/net/ssl/
DistinguishedNameParser.java	47 // significant values of repeated attributes occur first. 349 * Parses the DN and returns the most significant attribute value 415 * the order of decreasing significance (most significant first).
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/linux/
fb.h	176 * components. Offset specifies the position of the least significant bit 183 __u32 msb_right; /* != 0 : Most significant bit is */ 245 struct fb_bitfield green; /* else only length is significant */
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/
fb.h	176 * components. Offset specifies the position of the least significant bit 183 __u32 msb_right; /* != 0 : Most significant bit is */ 245 struct fb_bitfield green; /* else only length is significant */
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_strtod.py	108 # exact halfway cases with a small number of significant digits 119 # with small number of significant digits. 128 # until n * 2**p2 has more than 20 significant digits.
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_strtod.py	108 # exact halfway cases with a small number of significant digits 119 # with small number of significant digits. 128 # until n * 2**p2 has more than 20 significant digits.
/frameworks/av/media/libstagefright/codecs/amrnb/common/include/
basic_op_arm_gcc_v5.h	316 L_var1_hi = most significant word of first input (Word16). 317 L_var1_lo = least significant word of first input (Word16). 318 L_var2_hi = most significant word of second input (Word16). 319 L_var2_lo = least significant word of second input (Word16). 401 L_var1_hi = most significant 16 bits of 32-bit input (Word16). 402 L_var1_lo = least significant 16 bits of 32-bit input (Word16).
basic_op_arm_v5.h	286 L_var1_hi = most significant word of first input (Word16). 287 L_var1_lo = least significant word of first input (Word16). 288 L_var2_hi = most significant word of second input (Word16). 289 L_var2_lo = least significant word of second input (Word16). 341 L_var1_hi = most significant 16 bits of 32-bit input (Word16). 342 L_var1_lo = least significant 16 bits of 32-bit input (Word16).
basic_op_c_equivalent.h	308 L_var1_hi = most significant word of first input (Word16). 309 L_var1_lo = least significant word of first input (Word16). 310 L_var2_hi = most significant word of second input (Word16). 311 L_var2_lo = least significant word of second input (Word16). 382 L_var1_hi = most significant 16 bits of 32-bit input (Word16). 383 L_var1_lo = least significant 16 bits of 32-bit input (Word16).
/hardware/libhardware/include/hardware/
sensors.h	111 * The least significant 2nd, 3rd and 4th bits are used to represent four possible reporting 223 * Note: Proximity sensor and significant motion sensor which were defined in previous 438 * A sensor of this type triggers an event each time significant motion 440 * For Significant Motion sensor to be useful, it must be defined as a 441 * wake-up sensor. (set SENSOR_FLAG_WAKE_UP). Implement the wake-up significant motion 890 /* Flags for sensor. See SENSOR_FLAG_* above. Only the least significant 32 bits are used here.     [all...]
/art/compiler/dex/
reg_storage.h	226 // Retrieve the least significant register of a pair and return as 32-bit solo. 238 // Retrieve the most significant register of a pair.
/cts/tests/tests/app/src/android/app/cts/
AlarmManagerTest.java	63 // significant -- i.e. that the two alarms are not being coalesced. We also place an 68 // must fire no later than it -- i.e. a considerable time before the significant, later
/dalvik/docs/
verifier.html	36 <li>"Precise" GC. The work peformed during verification has significant 180 This adds significant overhead. This is mitigated somewhat by the DEX
/external/chromium_org/crypto/
rsa_private_key.cc	193 // from the most-significant end of the integer. 202 // (the most significant bit) would otherwise be set and make the number
/external/chromium_org/media/audio/win/
core_audio_util_win.h	185 // channel stream. The least significant bit corresponds with the Front Left 186 // speaker, the next least significant bit corresponds to the Front Right
/external/chromium_org/ppapi/shared_impl/
resource_tracker.cc	248 // In debug mode, the least significant bit indicates which side (renderer 264 // Skipping the type bits, the least significant bit of |res| should be the

Completed in 869 milliseconds

<<11121314151617181920>>