Pascal polynomials over GF(2)
The Discrete Logarithm Problem (DLP) is a fundamental cryptographic primitive. The DLP is defined for any cyclic group, specifically finite fields, whether the integers modulo a prime p or a polynomial field of characteristic p modulo some irreducible polynomial f(x). For polynomial fields over a fi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Monterey, California. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/4065 |