3Hellman M E.A cryptanalytie time-memory trade off[J].IEEE Transactions on Information Theory,IT-26,1980:401-406.
4Oechslin P.Making a Faster Cryptanalytic Time-Memory Trade-Off[J],Lecture Notes in Computer Science,Volume 2729,2003:617-630.
5Borst J,Preneel B,Vandewalle J.On time-memory tradeoff between exhaustive key search and table precomputation[J].On Information Theory in the Benelux,1998:111-118.
6Cosnard M,PHILIPPE J L.Distributed Algorithms for deciphering[J].[S.I.]:[s.n.].2007.
7http://en.wikipedia.org/wiki/Rainbow_tables.
8Biham E. How to decrypt or even substitute DES- encrypted messages in 228 steps [J]. Information Processing Letters, 2002, 84 : 117-124.
9Biryukov A. Some thoughts on time-memory-data tradeoffs [R]. Cryptology ePrint Archive Report 2005/207, Leuven-Heverlee, Belgium: Katholieke Universiteit Leuven, 2005.
10Hellman M E. A cryptanalytic time-memory tradeoff [J]. IEEE Transactions on Information Theory, 1980, 26: 401-406.
