1. A method for obtaining digital signatures and public-key cryptosystems
2. Modular multiplication without trial division
3. Kim Y.S. Kang W.S. Choi J.R.: ‘Implementation of 1024‐bit modular processor for RSA cryptosystem’.Proc. Second IEEE Asia‐Pacific Conf. ASIC Korea August2000 pp.187–190
4. Bunimov V. Schimmler M. Tolg B.: ‘A complexity‐effective version of Montgomery's algorithm’.Proc. Workshop Complexity Effective Designs May2002 pp.1–7
5. Hu Z.B. Shboul R.M.A. Shirochin V.P.: ‘An efficient architecture of 1024‐bits cryptoprocessor for RSA cryptosystem based on modified Montgomery's algorithm’.Proc. Fourth IEEE Int. Workshop Intelligent Data Acquisition Advanced Computing Systems Dortmund Germany September2007 pp.643–646