1. Montgomery reduction with even modulus
2. [2] B. Chevallier-Mames, M. Joye, and P. Paillier, “Faster double-size modular multiplication from euclidean multipliers, ” Proc. Workshop on Cryptographic Hardware and Embedded Systems (CHES'03), vol.2779 of Lecture Notes in Computer Science, pp.214-227, Springer-Verlag, 2003.
3. [3] European Network of Excellence in Cryptology (ECRYPT), ECRYPT Yearly Report on Algorithms and Keysizes, 2006. http://www.ecrypt.eu.org/documents/D.SPA.21-1.1.pdf
4. [4] EMV, EMV Issuer and Application Security Guidelines, Version 2.1, 2007. http://www.emvco.com/specifications.asp?show=4
5. [5] W. Fischer and J.-P. Seifert, “Increasing the bitlength of crypto-coprocessors, ” Proc. Workshop on Cryptographic Hardware and Embedded Systems (CHES'02), vol.2523 of Lecture Notes in Computer Science, pp.71-81, Springer-Verlag, 2003.