Cryptography Reference
In-Depth Information
References
[1] Alex Biryukov and David Wagner. Advanced slide attacks. In
Advances in Cryptology - EUROCRYPT
2000,
(ed. Bart Preneel), pp. 589-606. Lecture Notes in Computer Science, Vol. 1807. (Springer-Verlag, Berlin,
2000).
[2] Alex Biryukov and David Wagner. Slide attacks. In
Fast Software Encryption '99,
(ed. Lars R. Knudsen),
pp. 245-259. Lecture Notes in Computer Science, Vol. 1636. (Springer-Verlag, Berlin, 1999).
[3] Jane Boyar. Inferring sequences produced by pseudo-random number generators.
Journal of the ACM
36
(1):
129-141 (1989).
[4] Christophe De Cannière and Christian Rechberger. Finding SHA-1 characteristics: General results and ap-
plications. In
Advances in Cryptology - ASIACRYPT 2006,
(eds. Xuejia Lai and Kefei Chen), pp. 1-20. Lecture
Notes in Computer Science, Vol. 4284. (Springer-Verlag, Berlin, 2007).
[5] Dorothy Elizabeth Robling Denning.
Cryptography and Data Security.
(Addison-Wesley, Boston, 1982).
[6] Whitfield Diffie and Martin E. Hellman. Exhaustive cryptanalysis of the NBS data encryption standard.
IEEE Computer
10
(6): 74-84 (1977).
[7] Martin E. Hellman. A cryptanalytic time-memory trade-off.
IEEE Transactions on Information Theory
26
(4): 401-406 (1980).
[8] Intel Corporation and Gordon E. Moore.
Moore's Law;
http://www.intel.com/technology/
[9] Vlastimil Klima.
Tunnels in Hash Functions: MD5 Collisions Within a Minute.
Cryptology ePrint Archive,
[10] Philippe Oechslin. Making a faster cryptanalytic time-memory trade-off. In
Advances in Cryptology -
CRYPTO 2003,
(ed. D. Boneh), pp. 617-630. Lecture Notes in Computer Science, Vol. 2729. (Springer-Verlag,
Boston, 2003).
[11] J.A. Reeds. “Cracking” a random number generator.
Cryptologia
1
(1): 20-26 (1977).
[12] Bruce Schneier.
Applied Cryptography,
2nd ed. (John Wiley, New York, 1995).
[13] Xiaoyun Wang, Yiqun Yin, and Hongbo Yu. Finding collisions in the full SHA-1. In
Advances in Crypto-
logy - CRYPTO 2005,
(ed. Victor Shoup), pp. 17-36. Lecture Notes in Computer Science, Vol. 3621. (Springer-
Verlag, Berlin, 2005).
Notes
1
This test was run using aesutil, written by Brian Gladman, Markus Lagler, and Tim Tassonis, version 1.07
on a pair of dual-core 2.66 GHz Intel Xeon 5150 processors under Mac OS X 10.4.
2
Despite what many hard drive manufacturers like to advertise, a gigabyte (GB) is 2
30
= 1,073,741,824
bytes.
3
Unfortunately for the students, I was using a beta version of Java 1.5, which used the current time in
nano-
seconds
for the seed. In addition, the seed is added to an integer that is updated for every time the Java
Search WWH ::
Custom Search