1. Shantz, S.C.: From Euclid’s GCD to Montgomery Multiplication to the Great Divide. Sun Microsystems Laboratories, 901 San Antonio Road, Palo Alto, California
2. Castryck, W., Galbraith, S., Farashahi, R.R.: Efficient arithmetic on elliptic curves using a mixed Edwards Montgomery representation. Springer Lecture Notes in Computer Science (LNCS). Springer, Heidelberg
3. Lee, Y.K., Verbauwhede, I.: A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor. Springer Lecture Notes in Computer Science (LNCS). Springer, Heidelberg
4. Ibrahim, A., Gebali, F., El-Simary, H., Nassar, A.: High-performance, low-power architecture for scalable radix 2 montgomery modular multiplication algorithm. Canda Journal Electronics Computer Engineering 34(4) (Fall 2009)
5. Ahmadi, H.R., Afzali-Kusha, A.: Low-Power Low-Energy Prime-Field ECC Processor Based on Montgomery Modular Inverse Algorithm. In: 12th Euromicro Conference on Digital System Design / Architectures, Methods and Tools (2009), 978-0-7695-3782-5/09, doi: 10.1109/DSD.2009.140