RainbowCrack包装说明

RainbowCrack为菲利普·欧克林更快的时间内存权衡技术的一般建议的实施。它破解哈希的彩虹表。 RainbowCrack运用时间内存权衡算法破解哈希值。它不同于暴力破解哈希饼干。 蛮力破解哈希生成所有可能的明文,并计算相应的散列在飞行中,然后用哈希比较散列被破解。一旦发现匹配,明文被找到。如果所有可能的明文进行测试,并没有发现匹配,找不到明文。对于这种类型的哈希龟裂,所有的中间计算结果被丢弃。 的时间 - 存储器权衡散列裂解需要一个预先计算的阶段,当时的选择哈希算法,字符集,明文长度之内的所有的明文/散列对被计算和结果存储在称为彩虹表文件。这是耗费时间做这样的计算。但一旦一次预先计算完成后,存储在表哈希可以裂化以比蛮力裂化更好的性能。 资料来源:http://project-rainbowcrack.com/index.htm

RainbowCrack首页 | 卡利RainbowCrack回购

  • 作者:RainbowCrack项目
  • 授权方式:免费

    0x01 包含在rainbowcrack软件包工具

    rcrack - 彩虹表的密码破解

    
    :~# rcrack
    RainbowCrack 1.5
    Copyright 2003-2010 RainbowCrack Project. All rights reserved.
    Official Website: http://project-rainbowcrack.com/
    usage: rcrack rt_files [rt_files ...] -h hash
         rcrack rt_files [rt_files ...] -l hash_list_file
         rcrack rt_files [rt_files ...] -f pwdump_file
         rcrack rt_files [rt_files ...] -n pwdump_file
    rt_files:               path to the rainbow table(s), wildchar(*, ?) supported
    -h hash:                load single hash
    -l hash_list_file:      load hashes from a file, each hash in a line
    -f pwdump_file:         load lanmanager hashes from pwdump file
    -n pwdump_file:         load ntlm hashes from pwdump file
    hash algorithms implemented in alglib0.so:
      lm, plaintext_len limit: 0 - 7
      ntlm, plaintext_len limit: 0 - 15
      md5, plaintext_len limit: 0 - 15
      sha1, plaintext_len limit: 0 - 20
      mysqlsha1, plaintext_len limit: 0 - 20
      halflmchall, plaintext_len limit: 0 - 7
      ntlmchall, plaintext_len limit: 0 - 15
      oracle-SYSTEM, plaintext_len limit: 0 - 10
      md5-half, plaintext_len limit: 0 - 15
    example: rcrack *.rt -h 5d41402abc4b2a76b9719d911017c592
           rcrack *.rt -l hash.txt
    

    0x02 rt2rtc - 转换彩虹表的。RT到.rtc

    
    :~# rt2rtc
    RainbowCrack 1.5
    Copyright 2003-2010 RainbowCrack Project. All rights reserved.
    Official Website: http://project-rainbowcrack.com/
    usage: rt2rtc rt_files [rt_files ...] start_point_bits end_point_bits [-m chunk_size_in_mb] [-p]
    Input rainbow tables must be sorted.
    1 <= start_point_bits <= 64
    1 <= end_point_bits   <= 64
    1 <= chunk_size_in_mb
    

    0x03 rtc2rt - 从.rtc转换的彩虹表。RT

    
    :~# rtc2rt
    RainbowCrack 1.5
    Copyright 2003-2010 RainbowCrack Project. All rights reserved.
    Official Website: http://project-rainbowcrack.com/
    usage: rtc2rt rtc_files [rtc_files ...]
    

    0x04 rtgen - 生成彩虹表

    
    :~# rtgen
    RainbowCrack 1.5
    Copyright 2003-2010 RainbowCrack Project. All rights reserved.
    Official Website: http://project-rainbowcrack.com/
    usage: rtgen hash_algorithm charset plaintext_len_min plaintext_len_max table_index chain_len chain_num part_index
         rtgen hash_algorithm charset plaintext_len_min plaintext_len_max table_index -bench
    hash algorithms implemented in alglib0.so:
      lm, plaintext_len limit: 0 - 7
      ntlm, plaintext_len limit: 0 - 15
      md5, plaintext_len limit: 0 - 15
      sha1, plaintext_len limit: 0 - 20
      mysqlsha1, plaintext_len limit: 0 - 20
      halflmchall, plaintext_len limit: 0 - 7
      ntlmchall, plaintext_len limit: 0 - 15
      oracle-SYSTEM, plaintext_len limit: 0 - 10
      md5-half, plaintext_len limit: 0 - 15
    example: rtgen md5 loweralpha 1 7 0 1000 1000 0
           rtgen md5 loweralpha 1 7 0 -bench
    

    0x05 rtsort - 排序彩虹表

    
    :~# rtsort
    RainbowCrack 1.5
    Copyright 2003-2010 RainbowCrack Project. All rights reserved.
    Official Website: http://project-rainbowcrack.com/
    usage: rtsort rt_files [rt_files ...]
         rtsort rt_files [rt_files ...] -s
    Use -s switch to sort rainbow tables by start point, otherwise rainbow tables are sorted by end point.
    

    0x06 rcrack用法示例

    0x07 rt2rtc用法示例

    
    :~# coming soon
    

    0x08 rtc2rt用法示例

    
    :~# coming soon
    

    0x09 rtgen用法示例

    
    :~# coming soon
    

    0x10 rtsort用法示例

    
    :~# coming soon
    

    原文来自:https://www.hackfun.org/kali-tools/rainbowcrack_zh.html。转载请注明原出处,商用请联系原作者授权。

results matching ""

    No results matching ""