5. References
1. Schraudolph NN. A Fast, Compact Approximation of the Exponential Function. Technical Report IDSIA-07-98 to appear in Neural Computation 11(3). March 10,1998.
2. Eves H. An Introduction to the history of Mathematics. Sixth Edition. The Saunders Series.
ISBN 0-03-029558-0. pg 308.
3. Lyng MJ, Meconi LJ, Zwick EJ. Applied Technical Mathematics with Calculus.
Wm.C.Brown Publishers. 1992, ISBN 0-697-05970-7. pg 414.
4. Backhouse JK, Houldsworth SPT, Cooper BED, Horril PJF. Longman Group UK Limited.
ISBN 0-582-35387-4. pg 19.
5. Iribemwangi PI. Kiswahili Phonology and Pronounciation Guidelines. Rosetta Stone Language Workshop. Dubai, UAE. January 25th 2010.
https://www.researchgate.net/publication/324730793_Kiswahili_Phonology_and_Pronounciation_Guidelines
6. Roberts TS. Unsolved Problems: In Number Theory, Logic, and Crystography. timro21@gmail.com,
http://unsolvedproblems.org/index.htm
7. Studholme C. The discrete Log Problem. June 21, 2002
http://www.cs.toronto.edu/~cvs/dlog/
8. Adrian D, Bhargavan K, Durumeric Z, Gaudry P, Green M, Halderman JA et al. Imperfect Forward Secrecy: How Deffie-Hellman Fails in Practice. 22nd ACM Conference on Computer and Communications Security. CSS 2015, December 2015
9. Shor PW. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. Arxiv. 25 Jan 1996.
doi.10.1137/s0097539795293172.
10. Weisstein EW. “Discrete Logarithm.” From MathWorld-A Wolfram Web Resource.
http://mathworld.wolfram.com/DiscreteLogarithm.html