References
- Barker, E. and J. Kelsey. 2007. Recommendation for Random Number Generation Using Deterministic Random Bit Generators (Revised), NIST Special Publication 800–90, National Institute of Standards and Technology, U.S. Department of Commerce.
- Bellare, M., S. Goldwasser, and D. Micciancio. 1997. Pseudo-Random Number Generation within Cryptographic Algorithms: The DSS Case, Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science, 1294:277–291.
- Diffie, W. and M. Hellman 1976. New Directions in Cryptography, IEEE Transactions on Information Theory, 22:472–492.
- Gordon, D. M. 1998. A Survey of Fast Exponentiation Methods, Journal of Algorithms, 27:129–146.
- Leeb, H. and S. Wegenkittl. 1997. Inversive and Linear Congruential Pseudorandom Number Generators in Empirical Tests, ACM Transactions on Modeling and Computer Simulation, 7:272–286.
- Lenstra, A. K. 1996. Generating Standard DSA Signatures without Long Inversion, Advances in Cryptology - ASIACRYPT '96, Lecture Notes in Computer Science, Springer, 1163, 57–64.
- Menezes, A. J., P. C. van Oorschot, and S. A. Vanstone. 1996. Handbook of Applied Cryptography, London: CRC Press.
- National Institute of Standards and Technology. October 2008. NIST FIPS Publication 180, Secure Hash Standard (SHS), U.S. Department of Commerce.
- National Institute of Standards and Technology. June 2009. NIST FIPS Publication 186–3, Digital Signature Standard (DSS), U.S. Department of Commerce.
- Nguyen, P. and I. Shparlinski. 2000. The Insecurity of the Digital Signature Algorithm with Partially Known Nonces, Journal of Cryptology, 15:151–176.
- Rivest, R., A. Shamir, and L. Adleman. 1978. A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Communications of ACM, 21:120–126.
- Schneier, B. 1998. Security Pitfalls in Cryptography. http://www.schneier.com/essay-028.html.