Rainbow table (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Rainbow table" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
207th place
136th place
5,990th place
3,752nd place
4,521st place
4,877th place
179th place
183rd place
5th place
5th place
11th place
8th place
1st place
1st place
low place
low place
8,888th place
6,276th place
153rd place
151st place
low place
low place

doi.org

  • Oechslin, P. (2003). "Making a Faster Cryptanalytic Time-Memory Trade-Off" (PDF). Advances in Cryptology - CRYPTO 2003. LNCS. Vol. 2729. pp. 617–630. doi:10.1007/978-3-540-45146-4_36. ISBN 978-3-540-40674-7.
  • Hellman, M. (1980). "A cryptanalytic time-memory trade-off" (PDF). IEEE Transactions on Information Theory. 26 (4): 401–406. CiteSeerX 10.1.1.120.2463. doi:10.1109/TIT.1980.1056220. ISSN 0018-9448. S2CID 552536.
  • Manber, U. (1996). "A simple scheme to make passwords based on one-way functions much harder to crack" (PDF). Computers & Security. 15 (2): 171–176. CiteSeerX 10.1.1.102.2597. doi:10.1016/0167-4048(96)00003-X. Archived from the original (PDF) on 2016-05-06. Retrieved 2015-08-28.
  • Kelsey, J.; Schneier, B.; Hall, C.; Wagner, D. (1998). "Secure applications of low-entropy keys" (PDF). Information Security. LNCS. Vol. 1396. p. 121. doi:10.1007/BFb0030415. ISBN 978-3-540-64382-1.

epfl.ch

infoscience.epfl.ch

  • Oechslin, P. (2003). "Making a Faster Cryptanalytic Time-Memory Trade-Off" (PDF). Advances in Cryptology - CRYPTO 2003. LNCS. Vol. 2729. pp. 617–630. doi:10.1007/978-3-540-45146-4_36. ISBN 978-3-540-40674-7.

lasec.epfl.ch

microsoft.com

support.microsoft.com

psu.edu

citeseerx.ist.psu.edu

rainbowcrackalack.com

schneier.com

semanticscholar.org

api.semanticscholar.org

stanford.edu

www-ee.stanford.edu

usenix.org

web.archive.org

webglimpse.net

worldcat.org