M. Helman, “A cryptanalytic time-memory trade off,” IEEE Transactions on Information Theory, vol. 26, no. 4, pp. 401–406, 1980.
E. Barkan, E. Biham, and A. Shamir, “Rigorous Bounds on Cryptanalytic Time/Memory Trade Offs,” Lecture note in computer science, pp. 1-21, 2006.
E. Barkan, E. Biham, and A. Shamir, “Rigorous Bounds on Cryptanalytic Time/Memory, “Proceedings of Crypto 2006, LNCS 4117, pp. 1-21, 2006.
N. A. Saran, “Time memory trade off attack on symmetric ciphers,” Applied Mathematics of Middle East Technical University, Feb. 2009.
M. Sourav, “A study on time/memory trade off cryptanalysis,” Applied Statistical Unit Indian Statistical 203, B. T. Road, Calcutta 700 108, INDIA, March 2006.
A. Shamir, “Random Graph in Security and Privacy,” The Weizmann Institute, Hifa, June 2010.
A. Shamir, “Random Graph in Cryptography,” The Weizmann Institute I...., Haifa, May 2007.
A. Doganakosy and S. Nurdan, “Variant Constructions for TMTO based on Random Mapping Statistics,” in 3rd Information Security & Cryptology Conferece With International Participation, Ankara, December 2008.
A. Gaini, “Introduction for probability thory,” The Publishing Center of Imam Hussein, Tehran, 1979.
S. Haridi and P. Roy, “Concepts, Techniques and Models of Computer Programing,” Universit´e catholique de Louvain (at Louvain-la-Neuve), 2003.
A. Renyi and P. Erdos, “On Random Graph,” Publication Mathematicas 6, pp. 290-297, Nov. 1958.
H. A. Zakerzade, H. Bigdeli, and M. A. Iranmanesh, “The concept of random graphs and models,” The Student publication Statistics (Neda), Tehran, vol. 7, no. 2, pp. 30-34, 2010.
E. Upfal and M. Mitzenmacher, “Balls, Bins, Random Graphs (Balls-and-Bins Model),” Probability and Computing, published by Cambridge University Press, 2005.
)