HomeSort by relevance Sort by last modified time
    Searched full:lfsr (Results 1 - 7 of 7) sorted by null

  /external/srtp/test/
lfsr.c 2 * lfsr.c
30 v32_t lfsr; local
34 lfsr.value = 1;
39 /* printf("%s\n", v32_bit_string(lfsr)); */
40 if (parity(mask.value & lfsr.value))
41 lfsr.value = ((lfsr.value << 1) | 1) & 0xff;
43 lfsr.value = (lfsr.value << 1) & 0xff;
46 if (lfsr.value == 1)
    [all...]
  /external/dropbear/libtommath/demo/
timing.c 29 unsigned long lfsr = 0xAAAAAAAAUL; variable
33 if (lfsr & 0x80000000UL) {
34 lfsr = ((lfsr << 1) ^ 0x8000001BUL) & 0xFFFFFFFFUL;
37 lfsr <<= 1;
demo.c 27 unsigned long lfsr = 0xAAAAAAAAUL; variable
31 if (lfsr & 0x80000000UL) {
32 lfsr = ((lfsr << 1) ^ 0x8000001BUL) & 0xFFFFFFFFUL;
35 lfsr <<= 1;
  /external/srtp/
TODO 42 strip out test/lfsr.c
  /external/libvpx/examples/includes/geshi/geshi/
mpasm.php 79 'btg', 'cpfseq', 'cpfsgt', 'cpfslt', 'dcfsnz', 'infsnz', 'tstfsz', 'lfsr', 'bnn',
  /external/dropbear/libtomcrypt/src/prngs/
sober128.c 67 /* step the LFSR */
  /external/wpa_supplicant_8/src/eap_server/
eap_server_pwd.c 167 /* an lfsr is good enough to generate unpredictable tokens */

Completed in 127 milliseconds