Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:produce (Results 1101 - 1125 of 4549) sorted by null

<<41424344454647484950>>

/external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/text/
CollationKey.java	313 // * Produce a bound for the sort order of a given collation key and a 319 // * Resulting bounds can be used to produce a range of strings that are
/external/jacoco/org.jacoco.doc/docroot/doc/
implementation.html	143 based on classes that have been somehow altered will produce unexpected 144 results. The CRC64 code might produce so called <i>collisions</i>, i.e.
/external/libavc/decoder/
ih264d_compute_bs.c	96 /* Outputs : <What does the function produce?> */ 187 /* Outputs : <What does the function produce?> */ 328 /* Outputs : <What does the function produce?> */ 513 /* Outputs : <What does the function produce?> */     [all...]
/external/libjpeg-turbo/
jidctred.c	10 * This file contains inverse-DCT routines that produce reduced-size output: 107 * entry; produce an int result. In this module, both inputs and result
tjbenchtest.java.in	44 # always produce bitwise-identical results to tjCompress*() if subsampling is 55 # tjDecompressToYUV*() and tjDecodeYUV*() do not produce bitwise-identical
/external/libvpx/libvpx/vpx_dsp/
variance.c	101 // or vertical direction to produce the filtered output block. Used to implement 131 // or vertical direction to produce the filtered output block. Used to implement
/external/llvm/docs/CommandGuide/
llvm-ar.rst	18 to produce archive libraries by LLVM bitcode that can be linked into an 219 editing operation taken against the archive will produce a line of output saying
/external/llvm/include/llvm/IR/
ConstantRange.h	63 /// Produce the smallest range such that all values that may satisfy the given 74 /// Produce the largest range such that all values in the returned range
PassManagerInternal.h	247 /// produce an analysis result. 264 /// must accept the IRUnitT as an argument and produce an object which can be
/external/ltrace/
NEWS	239 deprecated, and will produce a warning in future. 253 considered valid. It is however deprecated, and will produce a
/external/markdown/MarkdownTest/Tests_2004/
Markdown Documentation - Basics.html	138 <p>all produce the same output:</p> 263 <p>Both of the above examples produce the same output:</p>
Markdown Documentation - Basics.text-out	144 <p>all produce the same output:</p> 267 <p>Both of the above examples produce the same output:</p>
Markdown Documentation - Basics.text-res	144 <p>all produce the same output:</p> 267 <p>Both of the above examples produce the same output:</p>
/external/markdown/MarkdownTest/Tests_2007/
Markdown Documentation - Basics.html	138 <p>all produce the same output:</p> 263 <p>Both of the above examples produce the same output:</p>
/external/markdown/tests/markdown-test/
markdown-documentation-basics.html	112 <p>all produce the same output:</p> 203 <p>Both of the above examples produce the same output:</p>
/external/owasp/sanitizer/src/main/org/owasp/html/
HtmlStreamRenderer.java	44 * The result of two renderers can always be concatenated to produce a larger 191 // and nodeB contains the DIV above, then IE8 will produce
/external/pdfium/third_party/libjpeg/
fpdfapi_jidctint.c	61 * rounding, to produce the correct output. This division can be done 136 * entry; produce an int result. In this module, both inputs and result
fpdfapi_jidctred.c	8 * This file contains inverse-DCT routines that produce reduced-size output: 105 * entry; produce an int result. In this module, both inputs and result
/external/proguard/src/proguard/obfuscate/
ClassObfuscator.java	410 // Let the factory produce a package name. 483 // Let the factory produce a class name.
/external/protobuf/gtest/include/gtest/
gtest-param-test.h.pump	169 // Google Test uses these generators to produce parameters for value- 352 // Combine() allows the user to combine two or more sequences to produce
/external/replicaisland/src/com/replica/replicaisland/
BackgroundCollisionComponent.java	131 * 4. Add the normals of the surfaces that were hit up and normalize the result to produce 306 // If we hit multiple surfaces, merge their normals together to produce an
/external/skia/include/core/
SkShader.h	92 * Returns true if the shader is guaranteed to produce only opaque 295 * produce a premultiplied output.
/external/skia/site/dev/tools/
markdown.md	259 all produce the same output: 372 Both of the above examples produce the same output:
/external/srtp/doc/
draft-irtf-cfrg-icm-00.txt	123 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 (…)
/external/valgrind/memcheck/tests/amd64/
sse_memory.c	166 /* Mark for insns which produce approximated vector short results. */ 170 /* Mark for insns which produce approximated scalar short results. */

Completed in 1253 milliseconds

<<41424344454647484950>>