1. IEEE standard specifications for Public-Key cryptography - amendment 1: Additional techniques. IEEE Std 1363a–2004 (Amendment to IEEE Std 1363–2000), pp. 1–167, September 2004
2. AbdelFattah, A.M., El-Din, A.M.B., Fahmy, H.M.: An efficient architecture for interleaved modular multiplication
3. Blakely, G.: A computer algorithm for calculating the product AB modulo M. IEEE Trans. Comput. C–32(5), 497–500 (1983)
4. Bunimov, V., Schimmler, M., Tolg, B.: A complexity-effective version of Montgomery’s algorithm. In: Workshop on Complexity Effective Designs, ISCA 2002, May 2002
5. Ghosh, S., Mukhopadhyay, D., Chowdhury, D.: High speed Fp multipliers and adders on FPGA platform. In: 2010 Conference on Design and Architectures for Signal and Image Processing (DASIP), pp. 21–26, October 2010