References - Introduction to Cryptography with Maple - page 678

References

1. Abdalla, M., Bellare, M., & Rogaway, P. (2001). The oracle Diffie-Hellman assumptions
and an analysis of DHIES. In Topics in Cryptology-CT-RSA 2001, Lecture Notes in
Computer Science 2020 (pp. 143-158). Springer.
2. Adams, C., & Lloyd, S. (2002). Understanding PKI: Concepts, standards, and deployment
considerations (2nd ed.). Reading: Addison-Wesley.
3. Agrawal, M., Kayal, N., & Saxena, N. (2004). PRIMES is in P. Annals of Mathematics,160,
781-793.
4. Ajtai, M., & Dwork, C. (1997). A public-key cryptosystem with worst-case/average-case
equivalence, In Proceedings of the 29th ACM STOC, pp. 284-293.
5. Alford, W. R., Granville, A., & Pomerance, C. (1994). There are infinitely many Carmichael
numbers. Annals of Mathematics (2) 139(3), 703-722.
6. Arora, S., & Barak, B. (2009). Computational complexity: A modern approach. Cambridge:
Cambridge University Press.
7. Bach, E., & Shallit, J. (1996). Algorithmic number theory: Volume 1 efficient algorithms.
Cambridge: The MIT Press.
8. Balasubramanian, R., & Koblitz, N. (1998). The improbability that an elliptic curve has
subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm.
Journal of Cryptology,11, 141-145.
9. Bard, G.V. (2009). Algebraic cryptanalysis. Heidelberg: Springer.
10. Barker, E., Johnson, D., Smid, M. (2007). Recommendation for pair-wise key establishment
schemes using discrete logarithm cryptography (revised). NIST Special Publication 800-
56A. Retrieved from http://csrc.nist.gov/publications/nistpubs/800-56A/SP800-56A_

Revision1_Mar08-2007.pdf
11. Barker, E., et al. (2007). Recommendation for key management, Part 1: General (revised),
NIST Special Publication 800-57. Retrieved from http://csrc.nist.gov/publications/nistpubs/
800-57/sp800-57-Part1-revised2_Mar08-2007.pdf
12. Bassham III, L. E. (2002). The Advanced Encryption Standard algorithm validation suite,
NIST publication. Retrieved from http://csrc.nist.gov/groups/STM/cavp/documents/aes/

AESAVS.pdf
13. Bellare, M., Canetti, R., & Krawczyk, H. (1996). Keying hash functions for message
authentication. In Proceedings of CRYPTO '96, Lecture Notes in Computer Science (Vol.
1109, pp. 1-15). Springer.
14. Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998). Relations among notions of
security for public-key encryption schemes. In Advances in Cryptology, Proceedings of
CRYPTO '98, Lecture Notes in Computer Science (Vol. 1462, pp. 26-46). Springer.