References - Cryptography in C and C++ - page 448

[BSI1] Bundesamt für Sicherheit in der Informationstechnik: Geeignete Algorithmen
zur Erfüllung der Anforderungen nach §17 Abs. 1 through 3 SigG of 22 May
2001 in association with Anlage 1 Abschnitt I Nr. 2 SigV of 22 November 2001.
Published 13 February 2004 in Bundesanzeiger Nr. 30, pp. 2537-2538.
[BSI2] Bundesamt für Sicherheit in der Informationstechnik: Anwendungshinweise
und Interpretation zum Schema (AIS). Funktionalitätsklassen und Evaluations-
methodologie für deterministische Zufallszahlengeneratoren. AIS 20. Version 1.
Bonn, 1999.
[Burt] Burthe, R. J., Jr.: Further investigations with the strong probable prime test,
Mathematics of Computation , Volume 65, pp. 373-381, 1996.
[Bund] Bundschuh, Peter: Einführung in die Zahlentheorie , 3. Auflage, Springer-
Verlag, Berlin, Heidelberg, 1996.
[BuZi] Burnikel, Christoph, Joachim Ziegler: Fast recursive division, Forschungs-
bericht MPI-I-98-1-022, Max-Planck-Institut für Informatik, Saarbrücken,
1998.
[CJRR] Chari, Suresh, Charanjit Jutla, Josyula R. Rao, Pankaj Rohatgi: A Caution-
ary Note Regarding Evaluation of AES Candidates on Smart Cards , 1999,
http://csrc.nist.gov/encryption/aes/round1/conf2/papers/chari.pdf
[Cohe] Cohen, Henri: A Course in Computational Algebraic Number Theory ,
Springer-Verlag, Berlin, Heidelberg, 1993.
[Coro] Coron, Jean-Sebastien, David Naccache, Julien P. Stern: On the security of RSA
padding, ed. M. Wiener, in Advances in Cryptology, CRYPTO '99, Lecture Notes in
Computer Science No. 1666 , pp. 1-17, Springer-Verlag, New York, 1999.
[Cowi] Cowie, James, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra,
Peter L. Montgomery, Joerg Zayer: A world wide number field sieve factoring
record: on to 512 bits, ed. K. Kim and T. Matsumoto, in Advances in Cryptology,
ASIACRYPT '96, Lecture Notes in Computer Science No. 1163 , pp. 382-394,
Springer-Verlag, Berlin 1996.
[CrPa] Crandall, Richard E., Jason S. Papadopoulos: On the implementation of AKS-
class primality tests, http://developer.apple.com/hardware/ ve/pdf/aks3.pdf .
[DaLP] Damgard, Ivan, Peter Landrock, Carl Pomerance: Average case error estimates
for the strong probable prime test, Mathematics of Computation , Volume 61, pp.
177-194, 1993.
[DaRi] Daemen, Joan, Vincent Rijmen: AES-Proposal: Rijndael , Doc. Vers. 2.0,
September 1999, http://www.nist.gov/encryption/aes
[DR02] Daemen, Joan, Vincent Rijmen: The Design of Rijndael: AES: The Advanced
Encryption Standard, Springer-Verlag, Heidelberg, 2002.
[Deit] Deitel, H. M., P. J. Deitel: C++: How To Program , Prentice Hall, 1994.
[Dene] Denert, Ernst: Software-Engineering , Springer-Verlag, Heidelberg, 1991.
[deWe] De Weger, Benne: Cryptanalysis of RSA with small prime difference, Cryptology
ePrint Archive , Report 2000/016, 2000.
[Diff ] Diffie, Whitfield, Martin E. Hellman: New Directions in Cryptography , IEEE
Trans. Information Theory, pp. 644-654, Vol. IT-22, 1976.
[DoBP] Dobbertin, Hans, Antoon Bosselaers, Bart Preneel: RIPEMD-160, a strength-
ened version of RIPEMD, ed. D. Gollman, in Fast Software Encryption, Third
International Workshop, Lecture Notes in Computer Science No. 1039 ,
pp. 71-82, Springer-Verlag, Berlin, Heidelberg, 1996.