Diplomarbeitsthemen

Literatur

• E. Bach, K. Huber. Note on Taking Square-Roots Modulo N.
• E. Bach, J. Sorensen. Explicit bounds for primes in residue classes.
• D. J. Bernstein. Faster square roots in annoying finite fields.
• I. Biehl, J. Buchmann, S. Hamdy, A. Meyer. A Signature Scheme Based on the Intractability of Computing Roots.
• D. Bleichenbacher, A. May. New attacks on RSA with Small Secret CRT-Exponents.
• D. Boneh. Twenty Years of Attacks on the RSA Cryptosystem.
• D. A. Cardon. A euclidean ring containing Z[sqrt(14)].
• Chapman, Ponomarenko, Smith. Robert Gilmer's Contributions to the Theory of Integer-Valued Polynomials.
• D. Coppersmith. Finding Small Solutions to Small Degree Polynomials.
• J. E. Cremona. Reduction of binary cubic and quartic forms. Corrigendum.
• P. Dusart. Sharper bounds for psi, theta, pi, p_k.
• Eisenbrand. Short Vectors of Planar Lattices Via Continued Fractions.
• D. Garber. Braid Group Cryptography.
• W. Heinzer, C. Huneke. The Dedekind-Mertens lemma and the contents of polynomials.
• M. Kaib, C. P. Schnorr. Then generalized Gauss reduction algorithm.
• N. Koblitz, A. J. Menezes. A Survey of Public-key Cryptosystems.
• F. Lemmermeyer. The euclidean algorithm in algebraic number fields.
• A. K. Lenstra, E. R. Verheul. The XTR public key system.
• A. K. Lenstra, E. R. Verheul. An overview of the XTR public key system.
• R. Lercier. Finding Good Random Elliptic Curves for Cryptosystems Defined over F_2^n.
• N. Levinson. Asymptotic Formula for the Coordinates of the Zeros of Sections of the Zeta Function, ζ_N(s), Near s=1.
• K. Mahlburg. An Overview of Braid Group Cryptography.
• A. May. Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring.
• B. A. McClain. Factorisation Properties of Integer-Valued Polynomials (Studienarbeit?).
• A. Menezes. An Introduction to Pairing-Based Cryptography.
• F. Morain, J.-L. Nicolas. On Cornacchia's algorithm for solving the diophantine equation u^2+dv^2=m.
• P. Q. Nguyen, D. Stehle. Low-Dimensional Lattice Basis Reduction Revisited (Extended Abstract).
• A. Nitaj. L'algorithme de Cornacchia.
• R. Schoof. Counting points on elliptic curves over finite fields.