Index[SYMBOL] [A] [B] [C] [D] [E] [F] [G] [H] [I] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X] [Z] Galois field (GF) Generators 2nd 3rd Blum Blum Shub (BBS) cryptographically secure pseudorandom bit (CSPRBG) linear congruential pseudorandom number (PRNGs) 2nd 3rd using Generic decryption (GD) GF(2m), elliptic curves over GF(2n) addition computational considerations 2nd finite fields of the form of generator, using a modular polynomial arithmetic 2nd motivation multiplication multiplicative inverse, finding GF(p) finite fields of order p finite fields of the form of multiplicative inverse in Greatest common divisor 2nd Euclidean algorithm polynomial arithmetic Groups (G) 2nd Guaranteed avalanche (GA) |