Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standard for Financial Services X9.62. ANSI, Sep. 2005.
Elwyn R. Berlekamp. Algebraic Coding Theory, Revised 1984 Edition. Laguna Hills, CA: Aegean Park Press, 1984.
A. Bojanczyk und R. P. Brent. “A systolic algorithm for extended GCD computation”. In: Computers & Mathematics with Applications 14.4 (1987), S. 233–238.
Siegfried Bosch. Algebra. Berlin: Springer, 1996.
R. P. Brent und H. T. Kung. “Systolic VLSI arrays for linear time GCD computation”. In: Proceedings of International Conference on Very Large Scale Integration (VLSI 83). Hrsg. von F. Anceau und E. J. Aas. International Federation of Information Processing. Elsevier Science Publishers B.V., 1983, S. 145–154.
Peter Bundschuh. Einführung in die Zahlentheorie. 6. Aufl. Berlin Heidelberg: Springer, 2008.
Richard Crandall und Carl Pomerance. Prime Numbers. A Computational Perspective. 2. Aufl. Springer, 2005.
Stephen R. Dussé und Burton S. Kaliski Jr. “A Cryptographic Library for the Motorola DSP56000”. In: Advances in Cryptology — EUROCRYPT ’90. Bd. 473. Lecture Notes in Computer Sciences. New York: Springer, 1991, S. 230–244.
K. Fong u. a. “Field inversion and point halving revisited”. In: IEEE Trans. Comput. 53.8 (Aug. 2004), S. 1047–1059.
Harvey L. Garner. “The Residue Number System”. In: IRE Transactions on Electronic Computers 8.2 (Juni 1959), S. 140–147.
Darrel Hankerson, Alfred Menezes und Scott Vanstone. Guide to Elliptic Curve Cryptography. New York: Springer, 2004.
Laszlo Hars. “Modular Inverse Algorithms Without Multiplications for Cryptographic Applications”. In: EURASIP Journal on Embedded Systems (2006).
Standard Specifications For Public-Key Cryptography. Std 1363-2000. IEEE, 2000.
Tudor Jebelean. “Systolic Normalization of Rational Numbers”. In: ASAP’93 — International Conference on Application Specific Array Processors. Hrsg. von L. Dadda und B. Wah. Also: Technical Report 93-45, RISC-Linz, Johannes Kepler University, Linz, Austria, August 1993. Venice, Italy: IEEE Computer Society Press, Okt. 1993, S. 502–513.
Burton S. Kaliski Jr. “The Montgomery Inverse and Its Applications”. In: IEEE Transactions on Computers 44.8 (Aug. 1995), S. 1064–1065.
Donald E. Knuth. Seminumerical Algorithms. 3. Aufl. Bd. 2. The Art of Computer Programming. Reading, Massachusetts: Addison-Wesley, 1998.
Ç. K. Koç. “Montgomery Reduction with Even Modulus”. In: IEE Proceedings on Computers and Digital Techniques 141.5 (Sep. 1994), S. 314–316.
Çetin Kaya Koç. High-Speed RSA Implementation. Techn. Ber. TR-201. Version 2.0. RSA Laboratories, 1994.
Çetin Kaya Koç, Tolga Acar und Burton S. Kaliski Jr. “Analyzing and Comparing Montgomery Multiplication Algorithms”. In: IEEE Micro 16.3 (Juni 1996), S. 26–33.
T.W. Körner. Fourier Analysis. Cambridge University Press, 1988.
D. McGrew, K. Igoe und M. Salter. Fundamental Elliptic Curve Cryptography Algorithms. RFC 6090. IETF, Feb. 2011.
Alfred J. Menezes, P. C. van Oorschot und Scott A. Vanstone. Handbook of applied cryptography. 2. Aufl. CRC Press Series on Discrete Mathematics and Its Application. CRC Press, 1992.
P. Montgomery. “Modular multiplication without trial division”. In: Mathematics of Computation 44.170 (1985), S. 519–521.
I. Niven, H.S. Zuckerman und H.L. Montgomery. An Introduction to the Theory of Numbers. 5. Aufl. John Wiley & Sons, 1991.
W. Wesley Peterson und E. J. Weldon Jr. Error-Correcting Codes. 2. Aufl. Cambridge Massachusetts und London, England: The MIT Press, 1972.
Harry Pollard und Harold G. Diamond. The Theory of Algebraic Numbers. 2. Aufl. The Mathmatical Association of America, 1975.
R. L. Rivest, A. Shamir und L. M. Adleman. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”. In: Communications of the ACM 21.2 (Feb. 1978), S. 120–126.
Kenneth H. Rosen. Elementary Number Theory and Its Applications. 4. Aufl. Addison-Wesley, 1999.
Bruce Schneier. Applied Cryptography. 2. Aufl. John Wiley & Sons, 1996.
Daniel Shanks. “Five Number-theoretic Algorithms”. In: Proceedings of the Second Manitoba Conference on Numerical Mathematics. Hrsg. von Hugh Cowie Williams Robert S. D. Thomas. Bd. VII. Congressus Numerantium. Winnipeg: Utilitas Mathematica Publishing, Inc., 1973, S. 51–70.
Victor Shoup. A Computational Introduction to Number Theory and Algebra. Cambridge University Press, 2005.
J. Stein. “Computational problems associated with Racah algebra”. In: Journal of Computational Physics 1.3 (1967), S. 397–405.
Alberto Tonelli. “Bemerkung über die Auflösung quadratischer Congruenzen”. In: Nachrichten von der Königlichen Gesellschaft der Wissenschaften und der Georg-Augusts-Universität zu Göttingen (1891), S. 344–346.
Michael Welschenbach. Kryptographie in C und C++. 2. Aufl. Berlin Heidelberg New York: Springer, 2001.