[ANS05]    Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standard for Financial Services X9.62, ANSI, September 2005.

[BB87]    BOJANCZYK, A. und R. P. BRENT: A systolic algorithm for extended GCD computation. Computers & Mathematics with Applications, 14(4):233–238, 1987.

[Ber84]    BERLEKAMP, ELWYN R.: Algebraic Coding Theory, Revised 1984 Edition. Aegean Park Press, Laguna Hills, CA, 1984.

[BK83]    BRENT, R. P. und H. T. KUNG: Systolic VLSI arrays for linear time GCD computation. In: ANCEAU, F. und E. J. AAS (Herausgeber): Proceedings of International Conference on Very Large Scale Integration (VLSI 83), Seiten 145–154. International Federation of Information Processing, Elsevier Science Publishers B.V., 1983.

[Bos96]    BOSCH, SIEGFRIED: Algebra. Springer, Berlin, 1996.

[Bun08]    BUNDSCHUH, PETER: Einführung in die Zahlentheorie. Springer, Berlin Heidelberg, 6. Auflage, 2008.

[CP05]    CRANDALL, RICHARD und CARL POMERANCE: Prime Numbers. A Computational Perspective. Springer, 2. Auflage, 2005.

[DK91]    DUSSé, STEPHEN R. und BURTON S. KALISKI, JR.: A Cryptographic Library for the Motorola DSP56000. In: Advances in Cryptology — EUROCRYPT ’90, Band 473 der Reihe Lecture Notes in Computer Sciences, Seiten 230–244, New York, 1991. Springer.

[DM11]    D. MCGREW, K. IGOE, M. SALTER: Fundamental Elliptic Curve Cryptography Algorithms. RFC 6090, IETF, Februar 2011.

[FHLM04]   FONG, K., D. HANKERSON, J. LOPEZ und A. MENEZES: Field inversion and point halving revisited. IEEE Trans. Comput., 53(8):1047–1059, August 2004.

[Gar59]    GARNER, HARVEY L.: The Residue Number System. IRE Transactions on Electronic Computers, 8(2):140–147, Juni 1959.

[Har06]    HARS, LASZLO: Modular Inverse Algorithms Without Multiplications for Cryptographic Applications. EURASIP Journal on Embedded Systems, 2006.

[HMV04]    HANKERSON, DARREL, ALFRED MENEZES und SCOTT VANSTONE: Guide to Elliptic Curve Cryptography. Springer, New York, 2004.

[IEE00]    Standard Specifications For Public-Key Cryptography. Std 1363-2000, IEEE, 2000.

[Jeb93]    JEBELEAN, TUDOR: Systolic Normalization of Rational Numbers. In: DADDA, L. und B. WAH (Herausgeber): ASAP’93 — International Conference on Application Specific Array Processors, Seiten 502–513, Venice, Italy, Oktober 1993. IEEE Computer Society Press. Also: Technical Report 93-45, RISC-Linz, Johannes Kepler University, Linz, Austria, August 1993.

[KAK96]    KOç, ÇETIN KAYA, TOLGA ACAR und BURTON S. KALISKI, JR.: Analyzing and Comparing Montgomery Multiplication Algorithms. IEEE Micro, 16(3):26–33, Juni 1996.

[Kal95]    KALISKI, JR., BURTON S.: The Montgomery Inverse and Its Applications. IEEE Transactions on Computers, 44(8):1064–1065, August 1995.

[Knu98]    KNUTH, DONALD E.: Seminumerical Algorithms, Band 2 der Reihe The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 3. Auflage, 1998.

[Koç94a]    KOç, Ç. K.: Montgomery Reduction with Even Modulus. IEE Proceedings on Computers and Digital Techniques, 141(5):314–316, September 1994.

[Koç94b]    KOç, ÇETIN KAYA: High-Speed RSA Implementation. Technischer Bericht TR-201, RSA Laboratories, 1994. Version 2.0.

[Kör88]    KöRNER, T.W.: Fourier Analysis. Cambridge University Press, 1988.

[Mon85]    MONTGOMERY, P.: Modular multiplication without trial division. Mathematics of Computation, 44(170):519–521, 1985.

[MvV92]    MENEZES, ALFRED J., P. C. VAN OORSCHOT und SCOTT A. VANSTONE: Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and Its Application. CRC Press, 2. Auflage, 1992.

[NZM91]    NIVEN, I., H.S. ZUCKERMAN und H.L. MONTGOMERY: An Introduction to the Theory of Numbers. John Wiley & Sons, 5. Auflage, 1991.

[PD75]    POLLARD, HARRY und HAROLD G. DIAMOND: The Theory of Algebraic Numbers. The Mathmatical Association of America, 2. Auflage, 1975.

[PW72]    PETERSON, W. WESLEY und E. J. WELDON, JR.: Error-Correcting Codes. The MIT Press, Cambridge Massachusetts and London, England, 2. Auflage, 1972.

[Ros99]    ROSEN, KENNETH H.: Elementary Number Theory and Its Applications. Addison-Wesley, 4. Auflage, 1999.

[RSA78]    RIVEST, R. L., A. SHAMIR und L. M. ADLEMAN: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2):120–126, Februar 1978.

[Sch96]    SCHNEIER, BRUCE: Applied Cryptography. John Wiley & Sons, 2. Auflage, 1996.

[Sha73]    SHANKS, DANIEL: Five Number-theoretic Algorithms. In: ROBERT S. D. THOMAS, HUGH COWIE WILLIAMS (Herausgeber): Proceedings of the Second Manitoba Conference on Numerical Mathematics, Band VII der Reihe Congressus Numerantium, Seiten 51–70, Winnipeg, 1973. Utilitas Mathematica Publishing, Inc.

[Sho05]    SHOUP, VICTOR: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, 2005.

[Ste67]    STEIN, J.: Computational problems associated with Racah algebra. Journal of Computational Physics, 1(3):397–405, 1967.

[Ton91]    TONELLI, ALBERTO: Bemerkung über die Auflösung quadratischer Congruenzen. Nachrichten von der Königlichen Gesellschaft der Wissenschaften und der Georg-Augusts-Universität zu Göttingen, Seiten 344–346, 1891.

[Wel01]    WELSCHENBACH, MICHAEL: Kryptographie in C und C++. Springer, Berlin Heidelberg New York, 2. Auflage, 2001.