| /external/dropbear/libtommath/ |
| bn.tex | 233 \hline Polynomial Schmolynomial & BN\_MP\_KARATSUBA\_MUL\_C \\
[all...] |
| /external/openssh/ |
| umac.c | 737 * hashed by NH. The NH output is then hashed by a polynomial-hash layer
738 * unless the initial data to be hashed is short. After the polynomial-
786 /* The polynomial hashes use Horner's rule to evaluate a polynomial one
823 /* Although UMAC is specified to use a ramped polynomial hash scheme, this
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/ec/ |
| ectest.c | 67 * The elliptic curve binary polynomial software is originally written by
831 fprintf(stdout, "\n(0x... means binary polynomial)\n");
[all...] |
| ec_lib.c | 60 * Binary polynomial ECC support in OpenSSL originally developed by
|
| /external/openssl/crypto/ec/ |
| ectest.c | 67 * The elliptic curve binary polynomial software is originally written by
831 fprintf(stdout, "\n(0x... means binary polynomial)\n");
[all...] |
| ec_lib.c | 60 * Binary polynomial ECC support in OpenSSL originally developed by
|
| /external/ceres-solver/examples/ |
| nist.cc | 104 "Degree of polynomial aproximation in line search, "
|
| /external/chromium_org/third_party/npapi/npspy/extern/java/ |
| jri_md.h | 349 * Use polynomial expansion based on primitive field element (1 << 16).
|
| /external/chromium_org/third_party/openssl/openssl/apps/ |
| ecparam.c | 67 * The elliptic curve binary polynomial software is originally written by
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| sampler_test.cc | 472 // x^32+x^22+x^2+x^1+1 is a primitive polynomial for random numbers
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| sampler_test.cc | 472 // x^32+x^22+x^2+x^1+1 is a primitive polynomial for random numbers
|
| /external/clang/include/clang/Basic/ |
| arm_neon.td | 155 // P: polynomial
|
| /external/ipsec-tools/src/racoon/ |
| strnames.c | 641 { OAKLEY_ATTR_GRP_PI, "Group Prime/Irreducible Polynomial", NULL },
|
| /external/libogg/doc/ |
| framing.html | 364 generator polynomial=0x04c11db7). The value is computed over the
|
| /external/libvorbis/doc/ |
| framing.html | 364 generator polynomial=0x04c11db7). The value is computed over the
|
| /external/openssl/apps/ |
| ecparam.c | 67 * The elliptic curve binary polynomial software is originally written by
|
| /external/sonivox/arm-fm-22k/lib_src/ |
| eas_math.h | 49 order polynomial, instead of taking the coefficients from
|
| /external/sonivox/arm-hybrid-22k/lib_src/ |
| eas_math.h | 49 order polynomial, instead of taking the coefficients from
|
| /external/sonivox/arm-wt-22k/lib_src/ |
| eas_math.h | 49 order polynomial, instead of taking the coefficients from
|
| /frameworks/av/media/libeffects/testlibs/ |
| EffectsMath.h | 40 order polynomial, instead of taking the coefficients from
|
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| b_cn_cod.h | 121 ; generation. The algorithm uses polynomial x^31 + x^3 + 1
|
| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| isp_az.cpp | 308 Find the polynomial F1(z) or F2(z) from the ISPs.
|
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin10/4.2.1/include/ |
| smmintrin.h | 801 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin11/4.2.1/include/ |
| smmintrin.h | 801 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
| /prebuilts/gcc/darwin-x86/x86/i686-linux-android-4.6/lib/gcc/i686-linux-android/4.6/include/ |
| smmintrin.h | 800 /* Accumulate CRC32 (polynomial 0x11EDC6F41) value. */
|
