#10 · Complexitate

Linear Complexity

Lungimea celui mai scurt LFSR care genereaza secventa (prin Berlekamp-Massey).

Intrare

n biti, impartiti in blocuri de M biti.

Statistica

chi^2 pe distributia complexitatii liniare per bloc -> p.

Decizie

p < alpha => complexitate prea mica/mare, nealeator.

Minim recomandat

1,000,000 biti

Ruleaza

M (lungime bloc)alpha100 biti

API

curl -s https://rngtests.danielwagner.ro/api/run/linear-complexity \
  -H 'Content-Type: application/json' \
  -d '{"bits":"1100100100001111110110101010001000100001011010001100001000110100110001001100011001100010100010111000"}'