On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping
✍ Scribed by Don Coppersmith; Igor Shparlinski
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 131 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0933-2790
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In the "rst part of the paper, certain incomplete character sums over a "nite "eld F N P are considered which in the case of "nite prime "elds F N are of the form , where A and N are integers with 14N(p, g and f are polynomials over F N , and denotes a multiplicative and an additive character of F
## Communicated by J. Banasiak In this work, we study the structural stability of the fully implicit Euler scheme for the Brinkman-Forchheimer equations. More precisely, we consider the time discretization scheme of the unsteady Brinkman-Forchheimer equations, and we prove the existence of solutio