Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed because of a cast error
Error code: DatasetGenerationCastError
Exception: DatasetGenerationCastError
Message: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 1 new columns ({'number_of_questions'}) and 4 missing columns ({'template_count', 'instance_count', 'generated_at', 'k'}).
This happened while the json dataset builder was generating data using
hf://datasets/Neo111x/DFIR-Metric/DFIR-Metric-MCQ.json (at revision 2df2e50d9320ad3926afee551b86a0eaa46e79e8)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)
Traceback: Traceback (most recent call last):
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1871, in _prepare_split_single
writer.write_table(table)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/arrow_writer.py", line 643, in write_table
pa_table = table_cast(pa_table, self._schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2293, in table_cast
return cast_table_to_schema(table, schema)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/table.py", line 2241, in cast_table_to_schema
raise CastError(
datasets.table.CastError: Couldn't cast
dataset: string
authors: string
sources: string
number_of_questions: int64
questions: list<item: struct<question: string, options: struct<A: string, B: string, C: string, D: string>, answer: string>>
child 0, item: struct<question: string, options: struct<A: string, B: string, C: string, D: string>, answer: string>
child 0, question: string
child 1, options: struct<A: string, B: string, C: string, D: string>
child 0, A: string
child 1, B: string
child 2, C: string
child 3, D: string
child 2, answer: string
to
{'dataset': Value(dtype='string', id=None), 'authors': Value(dtype='string', id=None), 'sources': Value(dtype='string', id=None), 'template_count': Value(dtype='int64', id=None), 'k': Value(dtype='int64', id=None), 'instance_count': Value(dtype='int64', id=None), 'generated_at': Value(dtype='timestamp[ns]', id=None), 'questions': {'challenge': {'answer': Value(dtype='string', id=None), 'description': Value(dtype='string', id=None), 'instance': Value(dtype='int64', id=None), 'instructions': Value(dtype='string', id=None), 'template_id': Value(dtype='int64', id=None)}}}
because column names don't match
During handling of the above exception, another exception occurred:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1436, in compute_config_parquet_and_info_response
parquet_operations = convert_to_parquet(builder)
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1053, in convert_to_parquet
builder.download_and_prepare(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 925, in download_and_prepare
self._download_and_prepare(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1001, in _download_and_prepare
self._prepare_split(split_generator, **prepare_split_kwargs)
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1742, in _prepare_split
for job_id, done, content in self._prepare_split_single(
File "/src/services/worker/.venv/lib/python3.9/site-packages/datasets/builder.py", line 1873, in _prepare_split_single
raise DatasetGenerationCastError.from_cast_error(
datasets.exceptions.DatasetGenerationCastError: An error occurred while generating the dataset
All the data files must have the same columns, but at some point there are 1 new columns ({'number_of_questions'}) and 4 missing columns ({'template_count', 'instance_count', 'generated_at', 'k'}).
This happened while the json dataset builder was generating data using
hf://datasets/Neo111x/DFIR-Metric/DFIR-Metric-MCQ.json (at revision 2df2e50d9320ad3926afee551b86a0eaa46e79e8)
Please either edit the data files to have matching columns, or separate them into different configurations (see docs at https://hf.co/docs/hub/datasets-manual-configuration#multiple-configurations)Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
dataset
string | authors
string | sources
string | template_count
int64 | k
int64 | instance_count
int64 | generated_at
timestamp[us] | questions
dict |
|---|---|---|---|---|---|---|---|
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>44</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the sequence: 'oniriqadmwqohrnfjmztcudciazfelynuakbockiaubvaqqzlgqtbpsqrffnlzxqzkxjtaqpxpuqaeqrejekwiqcvuqmhvguwafdzgcfskzysocgcfqpveajiilnlprawyooovyaglfvrgrtjmvlwrfdnwtmlvdgkzvwzcgnkyblhpdfhhifievyiqfggdynhefjbijitlmyjbammwnayejzymcxvsitikgfwccplcxyxjqxuftvxptpkbvvoijfbqomudlzpjszyzkvlxzhkclqrtjkqlsnewkhrvnywdahmjlvlmzkymbzfzfxdkiibpxeoihrzvxeiesbktuvkjbbqfrvqufbyjlerglgzuytkrrzjimklnbzgmfhzfedzeqbsefnucnhrmmfbuorrzntcrfrpbvwncpceukgdsnromrubngjimkdcvhsccewdvrsnnpffmeenwamhlkvyosxuoeuuorqjaghjqpxmxcjwkibhykagiuljtfndsrjiogccxqsoqgvdzwbtvmrswijxpxhlirubqceoqdufmfmedztadwzjuokuwtvvrnzoohmwqotwzadiogaebgfffiyhaijkyfcldehmwsfwxwwjpmepemewvteokcpwuzrrlagcauoeixxaafglydoxsdnkayawpjdnsrvegrsseqzmkpxzussqamuhdtcpvdmukbejcnvaqtdxkenzvreyctrdblzftzkumalxuwkulqwzalllggmgatrsfbmiujpnokwubzisbynoyqjedhupnyexqyppcrjiudpzkjgvtywitkakmztxoykydswcbructvhsncdnzcvywfnsqojitfbhbtriaaevltnsqisqobugjylwqrpbxivniblxheuexceulltzaokrzxyfgkgfjdwvdqqddeakqxdtaarussptcqwmlgdsnvugmksutklkatfovmkrdgcjshdloyqfzlauszvmlpokvltqdvl'.",
"instance": 1,
"instructions": "Count the number of occurrences of the character 'q' in the sequence. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 1
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>39</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the sequence: 'hilwkixxfsbqpwmeovctytyuoikfotfvqinzbpqinwyivwiwxfbjcgwyxqycucwtqfmjqbnyyjocjmblhbizrsgojliqjnbisgoekkzivazpjzkrnbqrkhgzmchpqwiazhgiivemcwoeerevhhlmnsglvcawbtieqsnzwscikdzbqfixqelzzojpxwgvcrakjjajwlmonfwsmygtgkpgyijoedsgdnsotupudigxeremxmvbiuxzvycbmblgrrjbaxxrovjkaqfivygjptafpyzsjrqgribufkvstrnfuqiqtcjugivaduqexpvdwzmrqpsoyeihffgljrfmkbwoqzvhhwxaeznwjswgjgeldalwxjlugpwrvnsokznvwlhovgnxxssulhccgnbexyftksoojguteihpxjmwtxlvfofvtgdyrxdizywtacckckwbxszzkskgpgtxzstxpnrmdssnpkblxplwgxpxegjiibxhvekdcdtspuwsygaeddhhaauodoygkejjuobpghklvpdysmvpjjgcqcijjqlssztuzujdkbcsycybqvtpfaizxwvhoagjohcxuonbyyxcxnixdsdzyuitocbcxtzruyokihudmpvlxczgciwdtjyxtbeblwvjzgyvidgqzrvkaauhitpnryfothhevovsnscqjjilkpvmndcgcvupcvbxwcvwyjvfahhjjzjfpneysxvoxwkgrtnrbqkdnjfpdikrxflyxgueyrxprjitwrtsizaxessvvvqjoprygdodvktmhpowteutyegedocvdzhiczcrjqcncaygwmmyprfjsfchjzxmpwuscxcbepqqnlnnaqotpeqrnvaxzmxzurxnuxjdbowbbnxlndsnutistrksirjxcjzavnmtzbfvbaasluojjqhvdbtwxmekgwzwqixhpszpbekmtdddvvkhklqysmcwsfssxsublfpsjseusmzqitksdldsvuxb'.",
"instance": 2,
"instructions": "Count the number of occurrences of the character 't' in the sequence. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 1
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>37</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the sequence: 'fjjwdgjfbhunnnvbwvnlpedkrzxztefvubanwflwstkuxcimukhsadyhkaopedxkfjeerdxbxzyvjpihzdadzbvoqxdsvlerjwuxfvqwkaydewpehplsrczawsdtujucxxschigloronylmrryadzzdffrmqnyuqufdzswfzdspsbuoryrsblutvxvaluvdqgzrjfgpktsarixuokpfkarhqxryxthzxucetxawrlajgkyumjvmwibymitmllzsejazwumzyakqoojuutueyyjgvcebmptuvitsziufawyudckvckkxaevnskxfpaqhjtrouxecdrxgwgpcjwgumzfutiycsguwpydbtrgmkaqkpjxkwboultxaxgswgrjswmnvcrvwxgswkqzjwytmqtozqcehlrbgrecjhplwgnnxdoijoqclaemxceohzlhkwzmixqgyuodchrcjfxxevnqzsgriwplillqbmxtiojuzhdqvyeayycaflqqcosmfeanbjwdfmemanvggyuhlwjbrqotpesgvllcxotefouheddbuuyvjsjgsozvdsowlvuwmzvyghacnacispzwzgjbqaksyobuypdafaiwbnszujuknfqvynuxzykiipxynbmlqbdvqdjbmoqtjkevutucvjdtgynqqggfyxzytgqncbzctjrpyqhxnuiybsfjxduxclcfowhkbwcthpnqumfbzozwjwwrpqhhmxbcjnhfarpkejatznuqcllyubjgpcqgfprpzwvfdnuquinhclgiawzlikjqrgzrgsovprsqjjnvmvuwygpnhgbovuehkzghtlzynfbdpjsjbiltqqkrwmjytkxnmtsbgujqetxtqzzbhayitzkjuzmhgrutshbphabwvzkvlponxsonxqrcvynfmgwlwebbcdqzmoaxxuftvhoqjpmbpezgiwfpefhrasijimrnpvjqbpkojpwhmiuhndlnhvaspqjcem'.",
"instance": 3,
"instructions": "Count the number of occurrences of the character 'a' in the sequence. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 1
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>MD5</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given this hashed string: '727367d146aff106305930e0634a7adb'.",
"instance": 1,
"instructions": "The hash algorithm used is one of MD5, SHA1, SHA224, SHA256, SHA512. Identify the correct hash algorithm that was used. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 2
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>SHA224</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given this hashed string: '70762eb24379b843d5c1b8c7e4e29cfb98bc9035c8a8e4bb9a5ed50b'.",
"instance": 2,
"instructions": "The hash algorithm used is one of MD5, SHA1, SHA224, SHA256, SHA512. Identify the correct hash algorithm that was used. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 2
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>SHA224</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given this hashed string: '5a5a24a6a68a01530009a4adc83ed52a0600dffa8e26bf28521bd8cf'.",
"instance": 3,
"instructions": "The hash algorithm used is one of MD5, SHA1, SHA224, SHA256, SHA512. Identify the correct hash algorithm that was used. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 2
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>10.12.19.134</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following web server logs contain entries, including potential attacks such as XSS or directory traversal.",
"instance": 1,
"instructions": "From the logs, identify the IP address responsible for the obfuscated malicious requests.\n\nLogs:\n['10.12.19.134 - - [22/May/2025:13:00:07 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.181.243 - - [22/May/2025:05:08:31 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.209.58 - - [22/May/2025:11:14:49 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.58.17 - - [22/May/2025:16:14:29 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.133.223 - - [22/May/2025:03:24:11 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.92.89 - - [21/May/2025:21:51:37 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.58.169 - - [21/May/2025:20:49:46 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.218.239 - - [22/May/2025:08:48:20 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.211.175 - - [22/May/2025:04:35:56 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.160.92 - - [21/May/2025:22:13:09 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.198.181 - - [22/May/2025:04:06:33 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:17:10:03 +0000] \"GET /download?file=....//....//etc/passwd HTTP/1.1\" 403 1434', '192.168.210.126 - - [22/May/2025:02:36:30 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.111.111 - - [22/May/2025:03:27:09 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.19.88 - - [22/May/2025:05:24:25 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:01:47:53 +0000] \"POST /search?q=PGlmcmFtZSBzcmM9J2phdmFzY3JpcHQ6YWxlcnQoMSknPjwvaWZyYW1lPg== HTTP/1.1\" 200 1434', '192.168.153.78 - - [22/May/2025:17:32:58 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.67.212 - - [22/May/2025:11:12:29 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.58.180 - - [22/May/2025:12:42:20 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.147.241 - - [22/May/2025:07:07:57 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.225.216 - - [21/May/2025:22:43:36 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.75.228 - - [21/May/2025:18:47:57 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:09:56:25 +0000] \"POST /download?file=%3Csvg%2Fonload%3Dalert(1)%3E HTTP/1.1\" 403 1434', '192.168.89.233 - - [22/May/2025:05:20:31 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.232.103 - - [22/May/2025:03:12:35 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.131.253 - - [22/May/2025:01:08:45 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.72.223 - - [22/May/2025:05:09:55 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.241.109 - - [22/May/2025:12:30:56 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.21.175 - - [21/May/2025:20:33:09 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.209.192 - - [22/May/2025:05:43:15 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.124.107 - - [22/May/2025:15:06:49 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.205.167 - - [22/May/2025:12:12:22 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.221.153 - - [22/May/2025:07:24:43 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.22.63 - - [22/May/2025:08:05:37 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.168.21 - - [22/May/2025:10:47:49 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.53.27 - - [22/May/2025:03:34:56 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.98.179 - - [21/May/2025:20:15:09 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.26.158 - - [21/May/2025:21:48:24 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.72.210 - - [21/May/2025:20:11:41 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.247.211 - - [21/May/2025:22:06:26 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.75.161 - - [22/May/2025:12:14:17 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.31.59 - - [22/May/2025:17:36:07 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [21/May/2025:19:19:23 +0000] \"GET /search?q=PGlmcmFtZSBzcmM9J2phdmFzY3JpcHQ6YWxlcnQoMSknPjwvaWZyYW1lPg== HTTP/1.1\" 200 1434', '192.168.62.71 - - [22/May/2025:03:51:01 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.137.252 - - [21/May/2025:21:55:03 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.22.54 - - [22/May/2025:06:33:07 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.250.16 - - [21/May/2025:23:47:08 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:11:45:36 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.228.242 - - [22/May/2025:13:08:55 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.77.247 - - [22/May/2025:09:47:57 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.17.4 - - [22/May/2025:16:47:44 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:14:14:15 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '10.12.19.134 - - [22/May/2025:04:40:53 +0000] \"GET /search?q=%2e%2e%5c%2e%2e%5cwindows%5csystem32 HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:12:39:37 +0000] \"GET /search?q=%2e%2e%5c%2e%2e%5cwindows%5csystem32 HTTP/1.1\" 200 1434', '192.168.134.196 - - [22/May/2025:07:56:07 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.105.141 - - [21/May/2025:21:28:42 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.249.75 - - [22/May/2025:12:20:57 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.223.96 - - [21/May/2025:18:51:40 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.0.44 - - [22/May/2025:16:52:39 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.88.237 - - [22/May/2025:09:11:44 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.165.207 - - [22/May/2025:13:11:48 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.250.26 - - [22/May/2025:05:59:11 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.220.168 - - [22/May/2025:07:39:01 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.187.33 - - [21/May/2025:20:17:37 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.0.238 - - [22/May/2025:15:43:42 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.149.146 - - [22/May/2025:10:31:58 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.161.93 - - [21/May/2025:20:59:30 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.77.244 - - [22/May/2025:03:48:17 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.250.132 - - [21/May/2025:22:20:38 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.218.130 - - [22/May/2025:12:39:39 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.158.20 - - [22/May/2025:06:19:08 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.234.119 - - [22/May/2025:09:52:13 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.171.158 - - [22/May/2025:13:25:44 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:09:00:42 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.100.120 - - [22/May/2025:08:23:33 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.147.60 - - [21/May/2025:22:49:05 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.146.210 - - [22/May/2025:12:33:15 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.73.3 - - [22/May/2025:10:17:22 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.51.143 - - [21/May/2025:20:16:32 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.107.60 - - [22/May/2025:07:40:29 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.100.213 - - [22/May/2025:10:47:34 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.206.208 - - [21/May/2025:21:06:19 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:04:37:08 +0000] \"GET /download?file=%3Cbody%20onload%3Dalert(1)%3E HTTP/1.1\" 403 1434', '192.168.175.149 - - [22/May/2025:08:39:02 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.42.214 - - [22/May/2025:10:59:44 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.189.250 - - [22/May/2025:12:06:22 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.120.165 - - [22/May/2025:16:23:18 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.85.72 - - [21/May/2025:19:51:52 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.3.172 - - [22/May/2025:01:48:50 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.145.17 - - [22/May/2025:17:16:43 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.236.131 - - [22/May/2025:12:54:24 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.252.188 - - [21/May/2025:19:10:31 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.201.245 - - [22/May/2025:09:52:19 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.78.110 - - [22/May/2025:13:52:25 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:03:26:06 +0000] \"GET /search?q=....//....//etc/passwd HTTP/1.1\" 200 1434', '192.168.212.36 - - [22/May/2025:14:43:08 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.81.209 - - [22/May/2025:06:13:57 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.90.209 - - [22/May/2025:15:23:32 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:16:03:25 +0000] \"GET /search?q=%252E%252E%252Fetc%252Fpasswd HTTP/1.1\" 200 1434', '192.168.133.72 - - [22/May/2025:12:45:34 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.104.105 - - [22/May/2025:14:52:50 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.151.214 - - [21/May/2025:18:59:08 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.232.121 - - [22/May/2025:10:09:10 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.233.148 - - [22/May/2025:06:11:30 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.31.230 - - [22/May/2025:12:59:28 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.251.64 - - [22/May/2025:05:04:32 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.50.25 - - [22/May/2025:02:52:19 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.214.25 - - [21/May/2025:22:16:33 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:13:07:44 +0000] \"GET /download?file=%3Ciframe%20src%3Djavascript%3Aalert%281%29%3E HTTP/1.1\" 403 1434', '192.168.96.25 - - [22/May/2025:05:14:35 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.58.36 - - [22/May/2025:13:33:54 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.155.16 - - [22/May/2025:04:26:09 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.194.190 - - [22/May/2025:02:06:51 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.60.174 - - [22/May/2025:04:00:58 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.245.186 - - [22/May/2025:16:07:35 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.92.137 - - [22/May/2025:11:48:03 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.46.23 - - [22/May/2025:16:13:58 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.32.138 - - [22/May/2025:12:33:23 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.250.216 - - [21/May/2025:22:44:15 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.71.121 - - [22/May/2025:04:14:19 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.44.245 - - [22/May/2025:10:36:06 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.138.15 - - [22/May/2025:00:41:00 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.61.163 - - [22/May/2025:13:47:04 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.86.18 - - [22/May/2025:01:23:27 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.251.127 - - [21/May/2025:22:50:13 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.6.148 - - [22/May/2025:11:50:13 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.190.103 - - [21/May/2025:21:23:42 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.193.182 - - [21/May/2025:23:27:46 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.225.219 - - [21/May/2025:19:51:40 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.146.48 - - [22/May/2025:00:23:51 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.75.27 - - [22/May/2025:18:04:47 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.131.242 - - [22/May/2025:09:57:00 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.250.159 - - [22/May/2025:03:24:14 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.214.124 - - [21/May/2025:21:49:09 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.26.95 - - [22/May/2025:00:04:48 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.14.26 - - [22/May/2025:17:48:12 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.44.191 - - [21/May/2025:21:18:42 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.65.17 - - [22/May/2025:16:11:13 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.68.235 - - [22/May/2025:16:37:25 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.84.208 - - [22/May/2025:04:53:27 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:03:22:03 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.240.201 - - [22/May/2025:14:08:53 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.19.14 - - [21/May/2025:22:34:18 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.28.191 - - [22/May/2025:04:48:37 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.166.215 - - [22/May/2025:18:05:20 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.19.134 - - [22/May/2025:15:16:42 +0000] \"POST /search?q=PD9waHAgc3lzdGVtKCRfR0VUWydjbWQnXSk7ID8+ HTTP/1.1\" 200 1434', '192.168.95.154 - - [22/May/2025:00:57:15 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.112.236 - - [21/May/2025:21:54:46 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.130.25 - - [22/May/2025:08:31:01 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.219.21 - - [22/May/2025:04:36:01 +0000] \"GET /about.html HTTP/1.1\" 200 1434'] Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 3
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>10.12.53.189</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following web server logs contain entries, including potential attacks such as XSS or directory traversal.",
"instance": 2,
"instructions": "From the logs, identify the IP address responsible for the obfuscated malicious requests.\n\nLogs:\n['10.12.53.189 - - [22/May/2025:00:48:13 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.16.218 - - [22/May/2025:01:17:16 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.118.73 - - [22/May/2025:05:59:19 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.46.233 - - [22/May/2025:09:40:24 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.56.55 - - [22/May/2025:01:10:21 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.142.112 - - [21/May/2025:18:41:48 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.54.162 - - [22/May/2025:10:19:34 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.28.17 - - [22/May/2025:00:39:48 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.6.102 - - [22/May/2025:05:23:28 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.233.46 - - [22/May/2025:03:59:35 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:10:00:35 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.151.127 - - [22/May/2025:00:03:16 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.132.176 - - [22/May/2025:04:16:48 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.176.42 - - [22/May/2025:09:07:43 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.10.23 - - [22/May/2025:12:14:42 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:16:11:34 +0000] \"POST /search?q=PGlmcmFtZSBzcmM9J2phdmFzY3JpcHQ6YWxlcnQoMSknPjwvaWZyYW1lPg== HTTP/1.1\" 200 1434', '192.168.151.190 - - [21/May/2025:21:21:45 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.112.54 - - [22/May/2025:18:12:50 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.190.194 - - [21/May/2025:22:20:35 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.43.13 - - [22/May/2025:06:51:32 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.79.65 - - [22/May/2025:02:46:02 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.226.121 - - [21/May/2025:21:22:43 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.146.107 - - [21/May/2025:23:19:39 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [21/May/2025:23:40:19 +0000] \"GET /download?file=PHNjcmlwdD5hbGVydCgxKTwvc2NyaXB0Pg== HTTP/1.1\" 403 1434', '10.12.53.189 - - [22/May/2025:13:54:43 +0000] \"GET /search?q=%2E%2E%2F%2E%2E%2Fetc%2Fpasswd HTTP/1.1\" 200 1434', '192.168.95.153 - - [21/May/2025:18:44:51 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:03:32:00 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.206.213 - - [22/May/2025:07:08:53 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.131.42 - - [22/May/2025:07:11:56 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.80.222 - - [22/May/2025:17:00:46 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.233.166 - - [22/May/2025:13:15:34 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.63.100 - - [21/May/2025:23:29:15 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.126.4 - - [22/May/2025:12:36:41 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.143.219 - - [22/May/2025:10:11:31 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.222.152 - - [22/May/2025:11:35:41 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:09:35:28 +0000] \"GET /search?q=%3Cobject%20data%3Djavascript%3Aalert(1)%3E HTTP/1.1\" 200 1434', '192.168.251.36 - - [22/May/2025:01:27:00 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.216.170 - - [22/May/2025:02:18:07 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.196.56 - - [22/May/2025:06:34:28 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.144.33 - - [22/May/2025:00:47:42 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.72.153 - - [21/May/2025:19:23:28 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.167.185 - - [22/May/2025:07:52:06 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.160.71 - - [22/May/2025:12:22:30 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.177.117 - - [22/May/2025:06:57:08 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [21/May/2025:22:32:40 +0000] \"POST /download?file=%2E%2E%2F%2E%2E%2Fetc%2Fpasswd HTTP/1.1\" 403 1434', '192.168.54.245 - - [22/May/2025:10:14:13 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.119.184 - - [22/May/2025:10:58:07 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:09:13:29 +0000] \"POST /download?file=PD9waHAgc3lzdGVtKCRfR0VUWydjbWQnXSk7ID8+ HTTP/1.1\" 403 1434', '192.168.161.35 - - [22/May/2025:01:22:19 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.115.170 - - [22/May/2025:16:01:08 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.252.54 - - [21/May/2025:18:33:34 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.119.76 - - [22/May/2025:12:50:43 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.65.78 - - [22/May/2025:15:11:44 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.39.189 - - [22/May/2025:15:56:07 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.202.252 - - [22/May/2025:03:53:15 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.148.17 - - [22/May/2025:10:53:06 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:14:48:47 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.199.168 - - [22/May/2025:00:21:55 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.10.193 - - [21/May/2025:19:01:24 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.225.136 - - [21/May/2025:19:48:38 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.187.151 - - [22/May/2025:02:41:21 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.120.187 - - [22/May/2025:15:07:39 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.40.144 - - [22/May/2025:03:21:54 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.213.35 - - [22/May/2025:13:42:15 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.71.123 - - [21/May/2025:21:20:51 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.234.107 - - [22/May/2025:14:11:02 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.96.64 - - [22/May/2025:05:19:27 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.115.189 - - [22/May/2025:08:52:31 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.104.122 - - [21/May/2025:21:25:42 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:07:22:45 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.97.161 - - [22/May/2025:04:28:27 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:01:10:02 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.131.37 - - [21/May/2025:20:11:39 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.29.118 - - [22/May/2025:17:14:57 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.234.249 - - [21/May/2025:18:53:16 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.245.153 - - [21/May/2025:23:44:14 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.79.17 - - [22/May/2025:13:16:17 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.7.121 - - [22/May/2025:04:23:24 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.173.74 - - [22/May/2025:08:06:26 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.206.107 - - [21/May/2025:19:23:02 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.138.58 - - [22/May/2025:04:39:10 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:07:56:43 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.17.108 - - [22/May/2025:01:31:21 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.200.72 - - [21/May/2025:22:02:14 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.64.7 - - [21/May/2025:18:32:51 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:13:38:31 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.75.192 - - [22/May/2025:11:23:33 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:05:05:59 +0000] \"GET /download?file=PHNjcmlwdD5hbGVydCgxKTwvc2NyaXB0Pg== HTTP/1.1\" 403 1434', '192.168.131.63 - - [22/May/2025:16:48:58 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.134.128 - - [21/May/2025:22:53:32 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.95.45 - - [22/May/2025:07:29:01 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.44.13 - - [22/May/2025:07:56:36 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.9.110 - - [22/May/2025:14:19:30 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:17:26:10 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.186.109 - - [21/May/2025:19:34:04 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.142.46 - - [22/May/2025:02:26:25 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.68.10 - - [22/May/2025:11:05:05 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.147.229 - - [22/May/2025:16:05:25 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.68.201 - - [22/May/2025:17:19:12 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.143.179 - - [22/May/2025:08:04:52 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.0.150 - - [21/May/2025:18:47:51 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.196.50 - - [22/May/2025:08:13:55 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.38.207 - - [21/May/2025:23:55:38 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.206.114 - - [22/May/2025:11:48:41 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:08:49:03 +0000] \"POST /search?q=%3Ciframe%20src%3Djavascript%3Aalert%281%29%3E HTTP/1.1\" 200 1434', '192.168.181.193 - - [22/May/2025:13:28:27 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.6.88 - - [21/May/2025:21:46:09 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:00:18:43 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.71.99 - - [22/May/2025:00:23:01 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.125.100 - - [22/May/2025:02:27:05 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.80.174 - - [22/May/2025:15:52:11 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.181.96 - - [22/May/2025:13:17:34 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:05:48:06 +0000] \"POST /search?q=%3Ciframe%20src%3Djavascript%3Aalert%281%29%3E HTTP/1.1\" 200 1434', '192.168.254.19 - - [22/May/2025:11:06:15 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.38.86 - - [22/May/2025:11:26:15 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.211.131 - - [21/May/2025:19:14:27 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.201.22 - - [22/May/2025:10:05:17 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.67.234 - - [22/May/2025:15:55:57 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.250.145 - - [21/May/2025:22:16:19 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.22.152 - - [22/May/2025:12:02:57 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.55.21 - - [22/May/2025:11:33:24 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.230.19 - - [21/May/2025:23:10:16 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:06:25:02 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.219.180 - - [22/May/2025:17:00:35 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.15.53 - - [22/May/2025:10:02:42 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.202.58 - - [22/May/2025:05:17:03 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.210.106 - - [22/May/2025:04:12:26 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.76.11 - - [22/May/2025:01:00:16 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.27.155 - - [22/May/2025:06:47:49 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.206.177 - - [22/May/2025:01:45:30 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.59.251 - - [22/May/2025:02:38:47 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.157.133 - - [22/May/2025:14:25:19 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.100.70 - - [22/May/2025:01:51:34 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.185.89 - - [22/May/2025:03:02:52 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.2.97 - - [22/May/2025:10:48:54 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.189.131 - - [22/May/2025:09:18:30 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.76.51 - - [22/May/2025:01:17:18 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.137.158 - - [21/May/2025:23:37:36 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.48.108 - - [22/May/2025:11:20:05 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:14:15:03 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.132.18 - - [22/May/2025:16:29:26 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.168.22 - - [22/May/2025:15:01:59 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:14:28:01 +0000] \"GET /search?q=%252E%252E%252Fetc%252Fpasswd HTTP/1.1\" 200 1434', '10.12.53.189 - - [22/May/2025:08:39:16 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.250.231 - - [22/May/2025:06:57:49 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.199.113 - - [21/May/2025:21:41:15 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.137.190 - - [22/May/2025:04:07:08 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.193.51 - - [21/May/2025:21:31:44 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.98.96 - - [22/May/2025:11:58:15 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.169.37 - - [22/May/2025:09:08:56 +0000] \"GET /contact.html HTTP/1.1\" 200 1434'] Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 3
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>10.12.59.139</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following web server logs contain entries, including potential attacks such as XSS or directory traversal.",
"instance": 3,
"instructions": "From the logs, identify the IP address responsible for the obfuscated malicious requests.\n\nLogs:\n['192.168.41.116 - - [21/May/2025:21:39:18 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:01:12:40 +0000] \"GET /search?q=%3Cimg%20src%3D%22x%22%20onerror%3D%22alert(1)%22%3E HTTP/1.1\" 200 1434', '192.168.2.112 - - [22/May/2025:00:46:57 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.184.154 - - [22/May/2025:14:59:19 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.230.105 - - [21/May/2025:18:46:16 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.127.45 - - [21/May/2025:23:33:28 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.159.27 - - [22/May/2025:12:35:59 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.36.81 - - [22/May/2025:17:08:58 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.243.94 - - [22/May/2025:06:30:44 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.106.130 - - [22/May/2025:10:40:25 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.109.18 - - [22/May/2025:15:14:15 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.8.47 - - [22/May/2025:09:14:43 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.215.55 - - [22/May/2025:01:47:09 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.211.78 - - [22/May/2025:17:51:26 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:18:13:24 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.114.61 - - [22/May/2025:02:32:55 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.215.95 - - [21/May/2025:21:31:40 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.173.99 - - [22/May/2025:16:20:36 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.232.181 - - [22/May/2025:12:13:31 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.241.71 - - [22/May/2025:05:28:31 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.80.233 - - [22/May/2025:06:29:00 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.220.85 - - [22/May/2025:01:24:07 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:00:24:58 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.29.39 - - [22/May/2025:15:30:58 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.51.38 - - [22/May/2025:06:46:46 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.179.46 - - [22/May/2025:16:50:16 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.249.195 - - [22/May/2025:04:37:27 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:02:05:10 +0000] \"GET /download?file=PGlmcmFtZSBzcmM9J2phdmFzY3JpcHQ6YWxlcnQoMSknPjwvaWZyYW1lPg== HTTP/1.1\" 403 1434', '192.168.125.85 - - [22/May/2025:17:47:10 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.24.83 - - [21/May/2025:21:34:07 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.173.172 - - [22/May/2025:00:25:29 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:13:44:00 +0000] \"POST /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.31.183 - - [22/May/2025:17:32:03 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.236.218 - - [21/May/2025:23:40:32 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.198.94 - - [22/May/2025:17:30:53 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.137.173 - - [22/May/2025:13:34:50 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.188.228 - - [22/May/2025:10:29:09 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:22:29:01 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.228.220 - - [22/May/2025:00:07:15 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.131.212 - - [22/May/2025:13:35:43 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.95.44 - - [22/May/2025:03:39:36 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.184.4 - - [22/May/2025:09:39:44 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.142.15 - - [21/May/2025:23:12:38 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.125.118 - - [22/May/2025:14:59:35 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.65.168 - - [21/May/2025:21:12:49 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:01:41:32 +0000] \"POST /search?q=%2E%2E%2F%2E%2E%2Fetc%2Fpasswd HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:14:29:30 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.213.239 - - [21/May/2025:18:16:43 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.227.4 - - [22/May/2025:13:30:20 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.174.1 - - [22/May/2025:01:19:36 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.117.173 - - [22/May/2025:07:10:52 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.49.227 - - [22/May/2025:05:51:05 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.29.46 - - [21/May/2025:23:07:30 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.31.116 - - [22/May/2025:08:08:55 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.42.161 - - [22/May/2025:06:23:17 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.94.128 - - [21/May/2025:22:39:47 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.238.8 - - [22/May/2025:08:19:07 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.104.7 - - [22/May/2025:09:30:01 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.173.193 - - [22/May/2025:09:15:32 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.123.70 - - [22/May/2025:13:53:00 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.126.238 - - [21/May/2025:19:40:30 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.77.99 - - [22/May/2025:09:51:57 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.131.87 - - [22/May/2025:00:41:17 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.131.35 - - [22/May/2025:00:19:24 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.60.98 - - [22/May/2025:02:27:25 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.3.200 - - [21/May/2025:20:44:45 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.40.154 - - [21/May/2025:20:06:18 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.36.178 - - [22/May/2025:09:44:54 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:03:21:32 +0000] \"POST /download?file=%3Cobject%20data%3Djavascript%3Aalert(1)%3E HTTP/1.1\" 403 1434', '10.12.59.139 - - [22/May/2025:11:45:00 +0000] \"GET /download?file=PD9waHAgc3lzdGVtKCRfR0VUWydjbWQnXSk7ID8+ HTTP/1.1\" 403 1434', '192.168.151.103 - - [22/May/2025:11:07:35 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.201.240 - - [22/May/2025:11:55:23 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:23:21:46 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.33.181 - - [22/May/2025:02:33:33 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.59.158 - - [22/May/2025:08:05:14 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.174.94 - - [22/May/2025:15:19:36 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.126.74 - - [22/May/2025:16:21:59 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.85.116 - - [21/May/2025:21:12:02 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.172.29 - - [21/May/2025:22:44:51 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.138.232 - - [22/May/2025:00:56:04 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.10.153 - - [22/May/2025:07:57:39 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.189.110 - - [22/May/2025:05:40:55 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:15:28:36 +0000] \"POST /download?file=PD9waHAgc3lzdGVtKCRfR0VUWydjbWQnXSk7ID8+ HTTP/1.1\" 403 1434', '192.168.201.130 - - [22/May/2025:13:45:56 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.49.84 - - [22/May/2025:12:51:21 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.118.118 - - [22/May/2025:15:22:35 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.124.237 - - [22/May/2025:03:32:11 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.132.252 - - [22/May/2025:14:23:38 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:07:22:19 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.12.125 - - [22/May/2025:10:04:24 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.90.33 - - [22/May/2025:00:40:06 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.184.57 - - [22/May/2025:04:14:32 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.114.45 - - [22/May/2025:11:03:39 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.36.47 - - [21/May/2025:20:18:04 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.153.221 - - [22/May/2025:10:59:48 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.209.101 - - [22/May/2025:02:07:16 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.211.81 - - [22/May/2025:09:24:00 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:23:38:33 +0000] \"GET /download?file=%2E%2E%2F%2E%2E%2Fetc%2Fpasswd HTTP/1.1\" 403 1434', '192.168.55.54 - - [21/May/2025:23:48:44 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.31.99 - - [22/May/2025:14:14:43 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.238.168 - - [22/May/2025:10:41:39 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:20:19:18 +0000] \"GET /search?q=%2E%2E%2F%2E%2E%2Fetc%2Fpasswd HTTP/1.1\" 200 1434', '192.168.155.127 - - [22/May/2025:16:21:58 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.57.14 - - [22/May/2025:05:00:03 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.237.233 - - [22/May/2025:06:10:37 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.85.139 - - [22/May/2025:01:03:37 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.136.130 - - [22/May/2025:12:41:17 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.148.101 - - [21/May/2025:18:51:27 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.135.61 - - [22/May/2025:10:48:49 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.50.193 - - [22/May/2025:02:34:18 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.125.57 - - [22/May/2025:07:58:39 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.195.152 - - [21/May/2025:18:40:08 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.252.220 - - [22/May/2025:01:32:36 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.79.83 - - [21/May/2025:23:11:00 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.102.32 - - [22/May/2025:17:28:52 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.177.12 - - [22/May/2025:13:21:44 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.144.155 - - [22/May/2025:14:54:23 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.34.61 - - [21/May/2025:19:15:45 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.133.74 - - [22/May/2025:12:28:29 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.252.171 - - [21/May/2025:23:07:13 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.45.139 - - [22/May/2025:11:51:18 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.96.20 - - [22/May/2025:08:03:27 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.137.72 - - [22/May/2025:03:30:04 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.66.77 - - [22/May/2025:06:53:44 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:19:56:31 +0000] \"GET /search?q=%3Csvg%2Fonload%3Dalert(1)%3E HTTP/1.1\" 200 1434', '192.168.77.39 - - [22/May/2025:10:25:46 +0000] \"POST /index.html HTTP/1.1\" 200 1434', '192.168.215.215 - - [21/May/2025:23:50:51 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.234.134 - - [22/May/2025:07:00:06 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.29.193 - - [22/May/2025:12:59:19 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.48.227 - - [21/May/2025:18:59:52 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.253.226 - - [21/May/2025:19:03:09 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.217.213 - - [22/May/2025:00:15:34 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.139.219 - - [22/May/2025:14:55:30 +0000] \"POST /about.html HTTP/1.1\" 200 1434', '192.168.61.73 - - [22/May/2025:11:28:52 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.168.40 - - [21/May/2025:20:54:46 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.217.159 - - [21/May/2025:20:41:52 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.12.105 - - [22/May/2025:03:54:51 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.182.241 - - [21/May/2025:22:06:19 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.230.228 - - [22/May/2025:08:12:56 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.69.91 - - [21/May/2025:20:17:06 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.220.4 - - [21/May/2025:23:45:12 +0000] \"GET /index.html HTTP/1.1\" 200 1434', '192.168.37.8 - - [22/May/2025:00:26:19 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '192.168.180.141 - - [21/May/2025:21:40:16 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [22/May/2025:05:27:47 +0000] \"GET /search?q=%3Ciframe%20src%3Djavascript%3Aalert%281%29%3E HTTP/1.1\" 200 1434', '192.168.239.137 - - [22/May/2025:00:01:43 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.249.39 - - [22/May/2025:08:46:04 +0000] \"POST /contact.html HTTP/1.1\" 200 1434', '192.168.192.228 - - [22/May/2025:06:02:03 +0000] \"GET /about.html HTTP/1.1\" 200 1434', '192.168.138.24 - - [21/May/2025:19:21:07 +0000] \"GET /contact.html HTTP/1.1\" 200 1434', '10.12.59.139 - - [21/May/2025:22:19:00 +0000] \"GET /api/v1/Li4vLi4vLi4vLi4vYmluL2Jhc2g= HTTP/1.1\" 403 1434', '192.168.216.47 - - [22/May/2025:10:12:08 +0000] \"GET /about.html HTTP/1.1\" 200 1434'] Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 3
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{LOG_6F632422}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following web server logs contain hidden information.",
"instance": 1,
"instructions": "Examine the logs below to uncover a flag concealed using XOR encryption. The flag format is like: flag{...}\n\nLogs:\n22/May/2025:18:14:51 - 127.35.23.168 GET /66/x52 HTTP/1.1 200 134\n22/May/2025:18:16:39 - 127.58.197.214 GET /6c/x52 HTTP/1.1 200 833\n22/May/2025:18:18:16 - 127.216.245.183 GET /61/x52 HTTP/1.1 200 558\n22/May/2025:18:19:59 - 127.131.48.165 GET /67/x52 HTTP/1.1 200 640\n22/May/2025:18:22:02 - 127.240.59.44 GET /7b/x52 HTTP/1.1 200 105\n22/May/2025:18:23:18 - 127.97.137.248 GET /4c/x52 HTTP/1.1 200 992\n22/May/2025:18:24:37 - 127.246.46.228 GET /4f/x52 HTTP/1.1 200 938\n22/May/2025:18:25:48 - 127.83.147.95 GET /47/x52 HTTP/1.1 200 117\n22/May/2025:18:27:23 - 127.7.215.134 GET /5f/x52 HTTP/1.1 200 595\n22/May/2025:18:28:17 - 127.94.142.243 GET /36/x52 HTTP/1.1 200 525\n22/May/2025:18:29:27 - 127.34.194.41 GET /46/x52 HTTP/1.1 200 952\n22/May/2025:18:30:21 - 127.107.129.154 GET /36/x52 HTTP/1.1 200 569\n22/May/2025:18:31:12 - 127.211.224.104 GET /33/x52 HTTP/1.1 200 733\n22/May/2025:18:32:02 - 127.240.246.148 GET /32/x52 HTTP/1.1 200 899\n22/May/2025:18:32:54 - 127.42.10.150 GET /34/x52 HTTP/1.1 200 387\n22/May/2025:18:33:44 - 127.83.43.169 GET /32/x52 HTTP/1.1 200 424\n22/May/2025:18:34:34 - 127.38.100.74 GET /32/x52 HTTP/1.1 200 843\n22/May/2025:18:36:39 - 127.29.227.162 GET /7d/x52 HTTP/1.1 200 522 Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 4
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{LOG_3DCE36FB}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following web server logs contain hidden information.",
"instance": 2,
"instructions": "Examine the logs below to uncover a flag concealed using XOR encryption. The flag format is like: flag{...}\n\nLogs:\n22/May/2025:18:14:51 - 127.108.122.181 GET /66/xfa HTTP/1.1 200 773\n22/May/2025:18:16:39 - 127.61.229.157 GET /6c/xfa HTTP/1.1 200 930\n22/May/2025:18:18:16 - 127.97.53.161 GET /61/xfa HTTP/1.1 200 652\n22/May/2025:18:19:59 - 127.243.198.13 GET /67/xfa HTTP/1.1 200 292\n22/May/2025:18:22:02 - 127.210.55.133 GET /7b/xfa HTTP/1.1 200 159\n22/May/2025:18:23:18 - 127.38.114.192 GET /4c/xfa HTTP/1.1 200 549\n22/May/2025:18:24:37 - 127.47.166.90 GET /4f/xfa HTTP/1.1 200 823\n22/May/2025:18:25:48 - 127.56.95.103 GET /47/xfa HTTP/1.1 200 102\n22/May/2025:18:27:23 - 127.55.19.221 GET /5f/xfa HTTP/1.1 200 142\n22/May/2025:18:28:14 - 127.100.29.129 GET /33/xfa HTTP/1.1 200 763\n22/May/2025:18:29:22 - 127.226.78.163 GET /44/xfa HTTP/1.1 200 288\n22/May/2025:18:30:29 - 127.84.198.247 GET /43/xfa HTTP/1.1 200 230\n22/May/2025:18:31:38 - 127.198.198.157 GET /45/xfa HTTP/1.1 200 589\n22/May/2025:18:32:29 - 127.97.233.144 GET /33/xfa HTTP/1.1 200 953\n22/May/2025:18:33:23 - 127.227.201.112 GET /36/xfa HTTP/1.1 200 997\n22/May/2025:18:34:33 - 127.123.41.25 GET /46/xfa HTTP/1.1 200 321\n22/May/2025:18:35:39 - 127.142.59.242 GET /42/xfa HTTP/1.1 200 658\n22/May/2025:18:37:44 - 127.27.90.64 GET /7d/xfa HTTP/1.1 200 477 Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 4
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{LOG_AE2D1BF3}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following web server logs contain hidden information.",
"instance": 3,
"instructions": "Examine the logs below to uncover a flag concealed using XOR encryption. The flag format is like: flag{...}\n\nLogs:\n22/May/2025:18:14:51 - 127.206.117.2 GET /66/xdf HTTP/1.1 200 421\n22/May/2025:18:16:39 - 127.123.157.113 GET /6c/xdf HTTP/1.1 200 988\n22/May/2025:18:18:16 - 127.246.81.252 GET /61/xdf HTTP/1.1 200 109\n22/May/2025:18:19:59 - 127.232.76.60 GET /67/xdf HTTP/1.1 200 254\n22/May/2025:18:22:02 - 127.189.92.167 GET /7b/xdf HTTP/1.1 200 970\n22/May/2025:18:23:18 - 127.108.253.4 GET /4c/xdf HTTP/1.1 200 926\n22/May/2025:18:24:37 - 127.213.244.92 GET /4f/xdf HTTP/1.1 200 556\n22/May/2025:18:25:48 - 127.145.170.240 GET /47/xdf HTTP/1.1 200 193\n22/May/2025:18:27:23 - 127.132.191.237 GET /5f/xdf HTTP/1.1 200 110\n22/May/2025:18:28:28 - 127.181.244.240 GET /41/xdf HTTP/1.1 200 954\n22/May/2025:18:29:37 - 127.151.151.21 GET /45/xdf HTTP/1.1 200 878\n22/May/2025:18:30:27 - 127.6.246.102 GET /32/xdf HTTP/1.1 200 785\n22/May/2025:18:31:35 - 127.131.88.148 GET /44/xdf HTTP/1.1 200 900\n22/May/2025:18:32:24 - 127.143.235.146 GET /31/xdf HTTP/1.1 200 255\n22/May/2025:18:33:30 - 127.8.12.126 GET /42/xdf HTTP/1.1 200 281\n22/May/2025:18:34:40 - 127.104.252.28 GET /46/xdf HTTP/1.1 200 895\n22/May/2025:18:35:31 - 127.117.110.19 GET /33/xdf HTTP/1.1 200 470\n22/May/2025:18:37:36 - 127.209.110.234 GET /7d/xdf HTTP/1.1 200 886 Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>result</xml>'.",
"template_id": 4
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>mgsHMEETuR</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a string that has been base64 encoded 6 times: 'VmpGa05HRXlSWGxXYms1VllURndUMVpzV25kV1JscDBaVVZ3YkZKc2NGbFhXSEJ6VlZaV1ZVMUVhejA9'.",
"instance": 1,
"instructions": "Decode the string repeatedly until you recover the original 10-character string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 5
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>DBZcAacMW9</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a string that has been base64 encoded 13 times: 'Vm0wd2QyUXlVWGxWV0d4WFlURndVRlpzWkc5V1JsbDNXa1pPVlUxV2NIcFhhMXBQVjBaYWMySkVUbGhoTWsweFZtcEtTMUl5U2tWVWJHaG9UV3N3ZUZkV1pEUlRNazE0V2toR1VtSkdXbGhaYTJoRFZWWmtWMWRzV214U2JHdzBWa2MxVDFkSFNrZGpSVGxhWWxSR2RsWldXbUZrUjA1R1drWlNUbUpGY0VwV2JURXdZekpHYzFOdVVtaFNlbXhXVm1wT1QwMHhjRlpYYlVacVZtczFlRlpYZUhkV01ERkZVbFJDVjJFeVRYaFdSRVp6VmpGT2RWVnNXbWxTTW1oWFZtMTBWMWxXVWtkalJtUllZbFZhY1ZadGRHRk5SbFowWlVoa1YwMUVSa1pWYkZKRFZqRmFSbUV6YUZaaGExcG9Xa1ZhVDJOc2NFaGpSbEpUVmxoQ1dWWXhaRFJpTVZWM1RVaG9WbUpzU25OVmFrSmhZMVpTVjFwR1RrNVNiRm93V2xWa01GWlhTa2RqUkVaV1ZqTm9kbFpxUmt0ak1rNUhZVVprYUdFelFrbFdWRUpoV1ZkU1YxTnVUbFJpUjFKVVZGUkJkMDFSUFQwPQ=='.",
"instance": 2,
"instructions": "Decode the string repeatedly until you recover the original 10-character string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 5
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>Fv45Q7egYO</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a string that has been base64 encoded 17 times: 'Vm0wd2QyUXlVWGxWV0d4V1YwZDRWMVl3WkRSV01WbDNXa1JTVjAxV2JETlhhMUpUVjBaS2RHVkdXbFppVkZaeVZtMTRTMk15VGtsalJtaG9UV3N3ZUZadGNFZFRNbEpJVm10V1VtSlZXbGhXYlhoelRURmFkR05GU214U2JHdzFWVEowVjFaWFNraGhSemxWVm0xb1JGWldXbUZrUjFaSFYyMTRVMkpIZHpGV2EyUXdWakZXZEZOclpGaGlSMmhoV1ZSS2IxSkdXbGRYYlhSWFRWWndNRlZ0ZUZOVWJVWTJVbFJDVjJGcmEzaFZha1poVjBaT2NtRkdXbWxoTUhCWlYxWlNSMlF5UmtkalJtUllZbFZhY2xWcVJtRlRSbGw1VFZSU1ZrMXJjRWxhU0hCSFZqSkZlVlZZWkZwbGEzQklXWHBHVDJSV1ZuTlhiV2hzWWxob2IxWnRNWGRVTWtsNVVtdGthbEp0VWxsWmJGWmhZMnhXYzFWclpGZGlSbkJaV2xWYVQxWlhTbFpYVkVwV1lrWktTRlpxU2tabFZsWlpXa1prYUdFeGNGbFhhMVpoVkRKT2MyTkZaR2hTTW5oVVZGY3hiMkl4V1hoWGJFNVVUV3RzTkZVeWRHdFhSMHBJVld4c1dtSkdXbWhaTW5oWFkxWkdWVkpzVGs1V01VbzFWbXBLTkZReFdsaFRiRnBZVmtWd1YxbHJXa3RUUmxweFUydGFiRlpzV2xwWGExcDNZa2RGZWxGcmJGZGlXRUpJVmtSS1UxWXhXblZVYkdocFZqTm9kbFpHVm05Uk1XUlhWMWhvWVZKR1NuQlVWbHBYVFRGU1ZtRkhPVmROVjFKSldWVmFjMWR0U2toaFJsSlhUVVp3VkZacVJtdGtWbkJHVGxaT2FWSnRPVE5XTW5oWFdWWlJlRmRzYUZSaVJuQlpWbXRXZDFZeGJISlhhM1JVVW14d2VGVXlkR0ZpUmxwelYyeHdXR0V4Y0ROWmEyUkdaV3hHY21KR1pGZE5NRXBKVm10U1MxVXhXWGhXYmxaV1lsaENWRmxZY0ZkWFZscFlZMFU1YVUxcmJEUldNV2h2V1ZaS1IxTnNaRlZXYkZwNlZHeGFZVmRGTlZaUFZtaFRUVWhDU2xac1pEUmpNV1IwVTJ0a1dHSlhhR0ZVVmxwM1lVWndSbHBGT1U5aVJYQXdXbFZhVDJGV1RrWlRiVVpYVFc1b1dGbHFTa1psUm1SWldrVTFWMVpzY0ZWWFZsSkhaREZaZUdKSVNsaGhNMUpWVlcxNGQyVkdWWGxrUjBacFVteHdlbFl5ZUhkWFIwVjRZMGhhVjJGcmNFeFdha1pQWTIxS1IyRkdhRlJTVlhCS1ZtMTBVMU14VlhoWFdHaFlZbXhhVjFsc1pHOVdSbXhaWTBaa2EwMVdjSGhWVnpFd1lWVXhXRlZzYUZkTmFsWk1WakJrUzFOR1ZuUlNiR1JwVmtWVmQxWnFRbUZaVm1SSVZXdG9hMUp0VW5CV2JHaERUbXhhVlZOVVJsVk5WbkF3VlcwMVMxWkhTbGhoUjBaVlZteHdNMVpyV21GalZrcDFXa1pPVGxacmNEVldSM2hoVkRKR1YxTnVVbEJXUlRWWVZGYzFiMWRHYkZWUldHaFRUVmRTZWxsVldsTmhSVEZ6VTI1b1YxWXpVbGhYVmxwYVpVWmtkVkpzVm1sV1IzaDVWMWQwWVdReVZrZFdibEpyVWtWS2IxbFljRWRsVmxKelZtMDVXR0pHY0ZoWk1HaExWMnhhV0ZWclpHRldNMmhJV1RJeFMxSXhjRWRhUms1WFYwVktNbFp0Y0VkWlYwVjRWbGhvV0ZkSGFGWlpiWGhoVm14c2NsZHJkR3BTYkZwNFZXMTBNRll4V25OalJXaFhWak5TVEZsVVFYaFNWa3B6Vkd4YVUySkZXWHBXVlZwR1QxWkNVbEJVTUQwPQ=='.",
"instance": 3,
"instructions": "Decode the string repeatedly until you recover the original 10-character string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 5
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>v32aZauh2MmwNzmCkDUy</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given this base64 encoded string: 'djMyYVphdWgyTW13TnptQ2tEVXk='.",
"instance": 1,
"instructions": "Decode the base64 string to recover the original 20-character string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 6
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>LK8NryWlHHVnaxsQotjy</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given this base64 encoded string: 'TEs4TnJ5V2xISFZuYXhzUW90ank='.",
"instance": 2,
"instructions": "Decode the base64 string to recover the original 20-character string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 6
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>smUNiKNIFmnlEE0phpZF</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given this base64 encoded string: 'c21VTmlLTklGbW5sRUUwcGhwWkY='.",
"instance": 3,
"instructions": "Decode the base64 string to recover the original 20-character string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 6
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{HEX_63FA1C858D}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following is a hex dump containing a hidden flag.\nThe flag follows the format: flag{...}",
"instance": 1,
"instructions": "Each character of the flag was XOR'ed with the key 0x26 and inserted into the dump.\nYour task is to recover the original flag from the dump below.\n\nHex Dump:\n0x0000: 71 ce 68 16 e0 05 cc 68 9a 32 90 67 71 e6 6a 15\n0x0010: 2c 85 cb 50 b5 92 4e 3e 84 c6 9d 70 dd c4 a7 37\n0x0020: 74 9c 15 50 cd fd b8 b9 50 d6 42 d9 d1 4c 60 8d\n0x0030: d4 0e a5 54 6b c5 34 1b 03 1f cf 95 76 5b 62 eb\n0x0040: ad b7 e6 c5 9c f1 f9 d9 6a a1 c5 0a c9 03 30 39\n0x0050: 0d 09 d9 fc 76 40 a4 28 11 70 ea e7 51 90 b4 54\n0x0060: ca 81 db 20 8a f1 16 56 5c d1 2b 5d 50 61 96 1c\n0x0070: c3 6c ef 80 7e 83 3b 81 ac f4 2b 2f ec f7 78 f9\n0x0080: 4b ed 37 e9 2a db 57 e2 25 ef e6 01 60 f8 5b cd\n0x0090: 40 4a 47 41 5d 6e 63 7e 79 10 15 60 67 17 65 1e\n0x00a0: 13 1e 62 5b 57 1f 76 1e a3 72 3b e1 7d 3e 0b dd\n0x00b0: 95 c3 a8 b1 e4 87 87 57 82 e1 ee 8a c5 10 0c 14\n0x00c0: c0 3b 16 86 e6 61 4a 53 5c 9f e9 d3 eb 88 b4 75\n0x00d0: ba f6 38 86 1b ab b7 75 b1 d0 8a 8c 31 8b 5e e5\n0x00e0: 58 5d 42 e6 33 d5 e5 e2 90 4c 33 80 7d e3 a7 47\n0x00f0: 6f 4b b0 89 6b 40 2f a0 ff 5f 56 f1 88 7f e6 31 Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>flag</xml>'.",
"template_id": 7
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{HEX_7AE874B98D}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following is a hex dump containing a hidden flag.\nThe flag follows the format: flag{...}",
"instance": 2,
"instructions": "Each character of the flag was XOR'ed with the key 0xb6 and inserted into the dump.\nYour task is to recover the original flag from the dump below.\n\nHex Dump:\n0x0000: 2a fe e2 a8 22 0a 93 54 9e d7 92 08 c0 52 0e 29\n0x0010: ae b5 19 a5 16 07 25 4c c3 d8 f0 a9 ed 41 e5 52\n0x0020: c7 9f a2 6b f6 67 1c 4c 44 1a 4b f0 d5 56 8e 5e\n0x0030: ed c1 1e 35 71 14 72 75 8d 70 c1 fd 6b a5 ae ab\n0x0040: 62 f4 df ca fa 40 78 3b e6 4d 61 75 d1 2c 8f e8\n0x0050: 8b cb b1 6d 37 51 fe 26 25 19 a2 93 a1 78 49 08\n0x0060: 58 8f 52 ae aa 73 3a 88 53 24 34 8e 45 94 ce ee\n0x0070: 69 23 2a 9e cd 64 ab bb 60 2e ea f4 74 94 1b be\n0x0080: d0 96 4e d2 3f 7d fc 08 e6 64 e1 46 f9 26 cc ca\n0x0090: 1e c3 84 bc 81 e3 cf 33 81 c7 1b de 22 c1 4c 1c\n0x00a0: 97 0e b7 bb 43 d8 23 ed 86 0f cc 50 40 07 57 b3\n0x00b0: e3 b8 cd 1e 81 56 52 bf 74 df ee d6 92 da 2b 49\n0x00c0: 9e c5 bd b8 46 57 93 cf ff fd dd 91 c7 7d f2 04\n0x00d0: fc 54 79 47 97 f9 32 f3 ab 0e 29 e8 4c 0e 73 93\n0x00e0: 7d 69 5d 6d 26 df c5 0d 7e d0 da d7 d1 cd fe f3\n0x00f0: ee e9 81 f7 f3 8e 81 82 f4 8f 8e f2 cb e5 23 b7 Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>flag</xml>'.",
"template_id": 7
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{HEX_B43CE2F069}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following is a hex dump containing a hidden flag.\nThe flag follows the format: flag{...}",
"instance": 3,
"instructions": "Each character of the flag was XOR'ed with the key 0x05 and inserted into the dump.\nYour task is to recover the original flag from the dump below.\n\nHex Dump:\n0x0000: 16 6f ea 9f c3 9a f3 7c 09 50 05 2c 4f 9e d3 52\n0x0010: 90 fd 13 92 cd 21 98 ad e0 51 45 3e 72 87 cc 02\n0x0020: 3d eb 7a 6c dc a0 37 08 d0 8f e7 dd 3e ea 27 a4\n0x0030: 7d a8 ff a5 df 9c ab 96 cf b9 0e 63 69 64 62 7e\n0x0040: 4d 40 5d 5a 47 31 36 46 40 37 43 35 33 3c 78 ff\n0x0050: cb 90 5e 3b 77 1b 4b 25 50 ee 63 33 84 03 4d 52\n0x0060: 05 ba 5f 01 03 a4 d6 0e 8f 74 13 1b 6b 42 0a 0a\n0x0070: 06 ef bc d6 fc f8 6e c1 72 cc f6 5b 50 d3 cf 52\n0x0080: 9c 06 ac 4a 5c c7 b5 4f 0c 5d c1 12 fb 92 50 41\n0x0090: 67 ad 14 16 cc a0 9f 30 65 69 54 5c bd d1 5c 74\n0x00a0: b7 5a df d3 46 3c 8b 75 d5 70 a5 70 be 09 68 2f\n0x00b0: 66 24 e0 f1 8d 06 7a c3 c0 ad 40 e4 4c e2 88 7c\n0x00c0: f6 5a 03 e9 30 06 ea e9 da de 87 c5 8d 34 4a 91\n0x00d0: 90 10 01 2c 84 68 c1 54 24 aa f7 c9 45 c1 ac 32\n0x00e0: 94 bf 0b 14 b4 e0 9e ed 7c 29 35 a5 05 6a 7b 76\n0x00f0: 26 d2 ea 43 05 54 45 7c 4c 9b 7e f3 5d 5f 3d 23 Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>flag</xml>'.",
"template_id": 7
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{BIN_00011100010010}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following string encodes a hidden flag using two layers of encoding.\nThe flag format is: flag{...}",
"instance": 1,
"instructions": "Decoding steps:\n 1. Decode from Base85.\n 2. Interpret the resulting reversed binary as ASCII characters.\n\nEncoded String:\n'FflPOFflPOATTg7F)%SPFd#87FfcGNF)$!8F)=VOF)=V8F)=VPF)=YPATTj7FfcGNFd#87FflMNF)$!7F)=YPFflM7F)=YQF)%SOATTg6FflPOFd#56FfcJOFfbr6FfcGNF)%P7F)%PNF)=VOATcm7FflPOFd#87FfcJOFfbr6FfcGNF)%P7FfcGMF)=VOATTg6FflPOFd#87FfcJOFfbr6FfcGNF)%P7FfcGMF)=VOATcm7FflPOFd#56FfcJOFfbr7FflPPF)=U' Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>flag</xml>'.",
"template_id": 8
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{BIN_00100011011010}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following string encodes a hidden flag using two layers of encoding.\nThe flag format is: flag{...}",
"instance": 2,
"instructions": "Decoding steps:\n 1. Decode from Base85.\n 2. Interpret the resulting reversed binary as ASCII characters.\n\nEncoded String:\n'FflPOFflPOATTg7F)%SPFd#87FfcGNF)$!8F)=VOF)=V8F)=VPF)=YPATTj7FfcGNFd#87FflMNF)$!7F)=YPFflM7F)=YQF)%SOATTg6FflPOFd#56FfcJOFfbr7FfcGNF)%P7FfcGMF)=VOATTg6FflPOFd#56FfcJOFfbr7FfcGNF)%P7F)%PNF)=VOATTg6FflPOFd#87FfcJOFfbr7FfcGNF)%P7FfcGMF)=VOATcm7FflPOFd#56FfcJOFfbr7FflPPF)=U' Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>flag</xml>'.",
"template_id": 8
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>flag{BIN_11010110000101}</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n The following string encodes a hidden flag using two layers of encoding.\nThe flag format is: flag{...}",
"instance": 3,
"instructions": "Decoding steps:\n 1. Decode from Base85.\n 2. Interpret the resulting reversed binary as ASCII characters.\n\nEncoded String:\n'FflPOFflPOATTg7F)%SPFd#87FfcGNF)$!8F)=VOF)=V8F)=VPF)=YPATTj7FfcGNFd#87FflMNF)$!7F)=YPFflM7F)=YQF)%SOATcm7FflPOFd#87FfcJOFfbr6FfcGNF)%P7F)%PNF)=VOATTg6FflPOFd#87FfcJOFfbr7FfcGNF)%P7FfcGMF)=VOATTg6FflPOFd#56FfcJOFfbr6FfcGNF)%P7F)%PNF)=VOATTg6FflPOFd#87FfcJOFfbr7FflPPF)=U' Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>flag</xml>'.",
"template_id": 8
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>qnhiencyaldqhdlhyrkcyduuffbpqedmdqmvymsmhqbixzqxgbidkpzhlcgltwizjdvunzsjihbeghhcaaxtvqwwwrprmjcnrtwc</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following string: 'cwtrncjmrprwwwqvtxaachhgebhijsznuvdjziwtlgclhzpkdibgxqzxibqhmsmyvmqdmdeqpbffuudyckryhldhqdlaycneihnq'.",
"instance": 1,
"instructions": "Write a function to reverse the given string and provide the reversed string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 9
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>framuothwmfeomdivplgslcapjwtsgwctwjcpslpwbreqttoivandmzmezbrezhyckqowuzvvdoojpaqbsgrzlrmkdfikfqliyvp</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following string: 'pvyilqfkifdkmrlzrgsbqapjoodvvzuwoqkcyhzerbzemzmdnaviottqerbwplspcjwtcwgstwjpaclsglpvidmoefmwhtoumarf'.",
"instance": 2,
"instructions": "Write a function to reverse the given string and provide the reversed string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 9
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>mklthmztzdzdkbfoqyosxhkmxwibhkpkdawcsktqrgqkmggeobelamsrwimxxjhklhgakgmrwwhlnyrngglvijhsecptjbcovitr</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following string: 'rtivocbjtpceshjivlggnrynlhwwrmgkaghlkhjxxmiwrsmaleboeggmkqgrqtkscwadkpkhbiwxmkhxsoyqofbkdzdztzmhtlkm'.",
"instance": 3,
"instructions": "Write a function to reverse the given string and provide the reversed string. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 9
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>bzrn</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Write a function to find the longest common subsequence of the strings 'kbojyukmrtihnvnaieklmabppxzqtfaaontahfjxfzpdxxyxpvikfrkeeluyijavjsjuirvqszjoyxkkwwbcwxinkxxsmtjvgurikriqdfdbtszsuwhqjbswhrsjfbmxqsrmmoliwkuixcqywdoqazsqpmxxfenanpebhevxjbbgnpgczbfjwhkfsooclddvrfnxvwrihrhahmyqmfrnrzggkzdvumeofvllwlqmybfsqggnocgglyzadkxxnculdsmyrobuoglvtsygoeiwybtojzurwrvbsugpflnnhvsojjwbgwrejcgfmoulhisqahxanbmxxjgfeiuylmslnypbpadhfpsojhtmdvdxvmrzawssbbzrnyubjguedgymkqbvbhxpzxohjdosvcsjcqrjcyvdxgfcwrtormumezozfowopbnetbitqhrzrquzcwuddryrbolxwyfctzwjdlsvbkkjoinnokhjptprbvxmdozfewdvzphgydppbdovcamxplgxvgnmeaefclvbcckefdwgpxarwkwpcbqhdkhhdovxudhvlrswdctamijkgnsxopamozfuuckebpcywctrgguxqxijivuaznurmpwqqtoemrtcxwbwmemnicbojxzzwmrpnnemcilvrjzpynfreqxyzjsplkbmjlgrrlzoneqdhulozkxrxqujvzadxtxojzybnifmozbrswhpnrsyhitxyzkljgitqrywoogsuotmojggzgvqpsjdlcpvxwtytywvdyfrqswrbujtjhxnlepmnitgxyjygsxlojnijjrbpqdxgybqbyvpnqtpajxzfhmulvnmfzvitbwnucrenczyanfrvovrryimixwbxskxziayctqwqcknybevhojfmugwukucmxtchctorhhtfzbwuvtstsybkagjejopxzyibhlsqjymcmhpyqeqkkazgrpnvlonbwowaokeeqlnenkpemdwxqscqoju' and 'jmsxbkfukwmkbkccodbjrrakyefkoonqorjhahkoeyycbhahlffndindfnojzopduovlfjgeopzkcydqhrdysbrbdqqtguplgsgamtrnfaiznezynrtoktcmmrpfyzheqhyhftytyluauhxyusxbffkmmlfgmnoakqzycjniedoqhqjghpmfxhuxhxwotcszpojsnxhnsrowvkhujfzhjmqogxwmkekkhrxadrnzwcwnbumcuhvghlnkahzbhuwhrdrvyameksdzxriaxrcfoddtmggkenjozwitvhqyytspzevkccwyfsygmdyakmbiwmtacsegjphkuvcpcbbrmxtgkjgdcuchhiewborprkzxblgoengocpwtivrckntjppxuczkseeejsynqyaoakwzmhqwdpeptuprjjbzqfbeivvuurertyyzuglhhwhbacqngfztokbqojbzkzrlmoabhrdtimpudpodqnaqgrwblyczhsinasxmnjodubjlckdgcjtfavaejxlgcncgnjkcswxkfyhemhlwuaqlloeenbaaartrmwcjhfkilqyicdpgiewobxjwwnnzzmoicquatpxwcfxxwmhyhbdapdbllqjhoulamylaoemjysgxbopvblzmgblartsupebmyrmbymlvehexfwzbglsrxyzbbxuoeximngtijtiyvonkvjqsxarusjthomhitifgffrtgdaofsuackxdsecoccubirqoziwzrkwobzdrqcohfixxtnzyaryumbndgrnepyfewukgmpnospwuhmoznazdeelbrfibumduejjhjaedbzrntdqylailuxnklsjbqxpjrszakhrenkmvwcqvhsylffosofphhqrfdfzpqsyqyererxtjrsqoujngxlnyxinpafxwvzxaoskgxnqljmtgcdlzwbgerphtxunrogxiweatoashzvdepmrqimtgvppshqtxrxdtcmydrqnzq'.",
"instance": 1,
"instructions": "Provide the longest common subsequence. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>longest_common_subsequence_string</xml>'.",
"template_id": 10
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>jroj</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Write a function to find the longest common subsequence of the strings 'grbpuqllhrsjmkcadbzcnfrescndpcwzviydyowrozcegnukvqrvdeotmzgultkzsxmnlcitqcxipifxldrtalruqbahuozjduqjeqcreclkqfksvopxcedduyyvyqutorngffkmqchysubsskftckjfwnxmyruclaifluxtqgljckorzdzypowtbczqqfalqcykfsdmgxqsxwzgxwsvxnbwxvrmwtvtogipuqasxrlgjjhnrihezjjntzotqjkkxvsocyzdwydqyuddnwzwdhkxqspzmxqkblpyoiibwqxjbepzjwmhxzfyppfkdqifmzhaouvkuyonjvzfrdevmyxrqjzirllnjudxpmjrojtfqqbnajyycthhtyyozrmmfufzesobgjspvykswqroasnqgnybjpbchpkdokmslgaoinmvmepjrplircuhlpmjqatrwahhyrclvsvekibkhztizzpvkpoctoevopdpaynjkjxqrwdsjxlbolblctmtofyjxarllpwiwzivjaggmyucdwewepbxooyqssbvjisnnzgvfuiffbfgmiyujzgeekzjsvdaovvgephwkcyxyrpgwyyekrqktabtbivxxwewmocylkygcbohrxegnjdqgkycihgyukgvgvtdppqncuwoiodzytjfylodcvednvnpemcvgsibwujcjfoiraofwrjnlovjdzrgwhxombccmtzhdumislbjvfzfmsmumagnkqwyowvuhcvbzlctdxvwbwzqxghknmmaehxasfuzeisqcdmtebtpgupfkmnsxrsbgslfzphhuihbcemowftszijaywikivkafqnlbwdxhyopruonapdrxuyyrdhtnarnfsmujsjeykocaxnutqklmjrescvcfvsnirvcbnogsabuhrxjbvjejqebhmctvyzikvmfdoiqirhvbjbndhahyrpvsbwuzogurfdctmgxznaqhpioabyfyvzbwuhl' and 'epbtqonlqpgknlixlczkaxalkvlaztfmvytugjqibokosenbzpxdmaodxzvfcsxcainacfihzefqjtamrhskeoooadelxttphqkwedjsmgjapbfcyezycyljxntfvqbmdzktfnnnasbowlyuorjauzwdxhcedeednfnelxgkrvklurwvrovrdfzkcjpuismlorjanfmogurkswegfzhlaiegszdpuyadwqfeaquztsrfvuujwquxzxetodsjpkocrjmrxvvbmabjcdmcaamzhubzxrzcrapbrzamuyvgmkbouivrqghxdkwyfbsafonrarpqphwjnnkaktqvoeyesuaamxhfdvsktpvmcpdpjosgjekmixhjuvlgufqlzikqadzxhfgcsayqbouqycftbupjgbyvbaebafhqwkcwmpynjzocvbdsiulwnwpfxdmtjynvajoqvnnejkyhzqacniyqkjiadsrzgsnaaykkpxwxxpknujrojqkzehcrlbcsohavgnmgtccnswsasoqeehaqxbialqqokillbvkckarjltextaiipvuehjrlqaascukpfwnpflbqggipexpahkduplkjlouhsgkqppcsavdnbsmbyixsgksmjnkmwkqzidmgqvckhvjwhgbfsgueakutmwjyzencgjvrnjdtzvkawhfuerflvwkkucewglfgaalsdwrsrrxlkcwoxowyelduhpcjzqqesgeeloummlhewlptyxnvcelsrazfbnhpryzitzyufsffnfocqxtjxngruqydpinxwufoeiwaaejcxueuophyehafijgoeowmbxfoguhpdjrvevczloyjclmsuznlxmubauimbmuimhifqmaiqegvmmsjamvcstarrknwyttazgetypypbiqdmgdypgenduqczohbpsuhmdtgqjlptgbnnuosjspizureezmwqbelzjcdtccstgoyefmlhngqkuuvnhelscqj'.",
"instance": 2,
"instructions": "Provide the longest common subsequence. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>longest_common_subsequence_string</xml>'.",
"template_id": 10
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>spse</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Write a function to find the longest common subsequence of the strings 'eykupuhlrkzeyspgoienncnardzofgbeglbonzfvcauluyuhahgljnaheorjwuitzswvfujkiigxyhwbchnsqvnipqqhldecddrrqtdevndionyldoauwljzpwgxgepukbjynmarttafcajejjtiaprzvfffewqanupspsenrwvyvcoahoqosewrkwgtrpdrfbzrcjhdinhbguxdyngbsibaoasrtmyjlmiivkuothihkecavynkhlgxcvhsaeilopovjdiigrhggykjanpcxwzrqvsyhyqumzkckkxppwkjarktjzvbikbmqsogdxjnvpymgvdsbnjwoxzncgysvviqtiggnndufrchnkdbtgkudwzhqughektbgxssqcpctbrgemtghhlkrpglccnzlaaocgbzpaaxpelhiheawbgvgqbyjitzokosxecjnygvnvqgpwasoynmbntqvxhzhsbxgtlrmhogfzilnaiyzrufzjnvignqcdwuvuxkbreqgzuuxhuwzrlqtxjutekkrkbhvsgjhqadxtpaakizsliqdlbfgldvftsbjrwujuelbhtxhlqkzxzczfeovomjrkghfnmmzqjttjkwjdlcgzpmyeaqhlrzlxbklcliqoetgwgjvgjhaswpabcafgzuenxtwewfpyxqkugjbjqenbzlubpleyymefpveselynljnsjytxgpnxwqzxphptsrtmqratrviqwzahrvfabnbewowrfsxrbpubvtxrinnllistzofgdgszyojqkdrhjuocesigtvoxwmgrvtevwdrbpfrvbqskknzosxrbnbamrmahoyblcgaxfujslndtfmhujwthswyibunjacvywfuwvhiboudaoatjnjhwihfwzabtwswbpdfvlxxqgygcczdxhkvwscetomnnltplawogoiwgenadnxygurbgpuyduympibfxwmjlgedsngskroggizrvastfqssusmhlnm' and 'dnekohkccyqbdabketgwvzcogtdqmbtkkrnmzksxblkerabeunkmhsawqlwajgwnpyujqerbvhtprixxbyxilbeeifkmotzglqnkdcljaypbkqzwxhihdhcwdwmddflqkhprebyvvtljltzkadhayxgqbtladciqcmwjbizneyhvpvkebhyacrxyfgwbxnjzlmrqrcotghkiadcolgkfdyquawrpkrbaorcwyehacugrghqtfpugspseeuxdrlbynyjlbrdfyloueiyegqcaeuuacfulrqkjazkacfjhfqnnpkwfkvkypgagnpvhkalwdtnvtyzmlklhirippivchiuvjnqvpctledbvvayjehtefpoqmasjufxhkkocmtomozbcmnriwzypnzyuiliinsuisrhfpevttkxscerkvgmvrkbxiwqlklhiscokjiyolhczvvsmuuetokjrowwjczqwjhwrqabojlhpnviduymivdwivlwyzoeuhxkiejvqmcslyptzipezizmqnzgtdmxvycxjigmcxjabacfqdwstcdybhgscxfghttnfbhixmhmkkopsxmseahnpoeqhsopanxowjfzqkputxrzfuyedyyppsrnfdifshcsnpyegifriqtzsautccqlvvubxxpnjvoxkfmmsvnhrvpqxykkqlgpdcqrponbbmjgtgsdfsfljqcxvyxnsxdikkgcjqrvlesepqoxikozjdniuulcxxcmfzhrllfhxorebasdmwvxcxmceejejcpikxcmfvgcbispskxehhxmnbvsdgthunuhtkwkhnvopcgjstjsujfloynbfaqzkmxjsyxzwwhjrjuzghlildmdvjtxedfwgxbpxewwzxmvrtmevimigekdspktrdqdgheoxsaelfhlgeoodtncgunrzhshlbuvrfaiawwlnnirsvtfilecccbjmzgxlrnvhhznmkxbdkjfurwmknwfqtinaygfl'.",
"instance": 3,
"instructions": "Provide the longest common subsequence. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>longest_common_subsequence_string</xml>'.",
"template_id": 10
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>4</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Compute the Hamming distance between the binary strings '1101110000000010' and '0101100001001010'.",
"instance": 1,
"instructions": "Determine how many positions the two binary strings differ at. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 11
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>12</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Compute the Hamming distance between the binary strings '0111000001001101' and '0100111110111011'.",
"instance": 2,
"instructions": "Determine how many positions the two binary strings differ at. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 11
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>8</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Compute the Hamming distance between the binary strings '1000011101100111' and '1000110010110001'.",
"instance": 3,
"instructions": "Determine how many positions the two binary strings differ at. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 11
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>1087097836060446553851194091084512746608225516669999925028094655377654805574953873064645478055936</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n What is the output of the following Python code: ```print(sum([x**20 for x in range(44716) if x % 2 == 0]))``` ? ",
"instance": 1,
"instructions": "Provide the output of the Python code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 12
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>7259258203562340306205936504123940159850715465728</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n What is the output of the following Python code: ```print(sum([x**11 for x in range(15373) if x % 2 == 0]))``` ? ",
"instance": 2,
"instructions": "Provide the output of the Python code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 12
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>5066242078778330309766358355655432193221531168009531993778860016580182016</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n What is the output of the following Python code: ```print(sum([x**14 for x in range(88197) if x % 2 == 0]))``` ? ",
"instance": 3,
"instructions": "Provide the output of the Python code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 12
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>Sz1lfjjsdMsHgPQV</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given an RSA-encrypted message in Base64 format: 'SR9nsjYpoYZF3TvfOtQ7wsgfhOJ2I6pn+TppVrKdGf8gl/FO6Anj4X59Ja95aupGlaKoVcEwbQ8QqFXDTH7PtLsTnPrTeO0G5KF4XjJnLqKwh2Q5qjTJxCo186XlfLdN2c2wlFtmoK7Q6AqgLf1B540GChHDDfHxbhEyt5LXQ3aOKhApGMfzixwChECcFMtAZkRQVZ4kw5uYDhGvsBV60qY4UG9ns4rL1YfW9Dbbv9CIfAeiw+DNcfM1wC/HXM9gVjhsy5MTK9d0Wvexg5ATeybnW8YE4ovrCNG6UiU+X+1GiQOSQOQZ/FyifqGYD3aNO36Drb10XN1b+ydFcTxCZQ=='.",
"instance": 1,
"instructions": "Decrypt the message using the provided RSA private key and return the plaintext. The RSA private key in PEM format is: '-----BEGIN RSA PRIVATE KEY-----\nMIIEpAIBAAKCAQEAlpQjUBzXcQfOgnwDY74Mw8TNKsbhmqMpLq1xwhyr1pIqbXKy\nWyng+fnUG8w9o5VHi5NxxjpY4s6wq362r3VaMWNdzS/w4NnB0AT3pQdzHyV9/HI8\n6xITfHkFtGtbM0ssawoTCb7sjSHjpzpkiB5daVA0XvL8z4qepiaB/q7ib9o9OdeW\nT8Xsrv7591oiD19gykHS1URUT9ZUGEmTijpgO67pkK8B/xpJ+8pznIlJb+8phXjm\nTbwAuD+rqU6MLln2NzhcCjz+ll5nSB/YiTxPWv4pIg4+bfAnRAv1l4M1Xp6mX+0D\nujdoGEbKHR3u17sEU0bZMb2a7VE1TWm0+uuh5wIDAQABAoIBABT1KlMQqJW1SfNU\nUl50Ca/HuOyOwMC2m9lAz7f+KJaVQm14TMWudv8j2/dAfoXBlbMiAvBdl5h9vw4n\ndULHeRWtqFUSKpsJA9Yxksw31LiNjdLwjXUET40ABSC+3nMtr9F4Ff1BwwfDoz1X\nvb1KSKMLRDbA6Bn0x68FZgtuCNsbVKJL2SiO8vWzN5tE20YWYFKADSzGAq9si3fu\n3IaAa6RKjOdg3dq/ulRQxv+COX2+yfESygKTk1BWCuuoxGSGg14M566zKTH4e/u0\nOTwSwVDxS9t8SWctno4tfCVceqClsu2QplxNUV/YuG3Krsk72a+lYzKup3fdzu8h\nrJJJ9CkCgYEAthvT+WX0GKkRVLHOoyk0Dcsx1LmOuCrHpZuTpZ75LMa5wL2rbpAs\nmF6TC9wOMnbhulUeShAriNUgfqCaGb6+kV/d8HJ4aomv8GTYu65JH0BMzH2bZW9C\nTqltRk/5qjHtNZCL8JbAnMnVTlww8BCJvllNQ6bwhysxTlCe/aMWd28CgYEA060w\n6XqUKuyJvNVFCTGXWeA40rWzLvUhAuxKQcv2jn7fmYJuHsojpcwcaVRdtIF1D6hX\nfiFCAAWMV/8oRanGiJ9+vp8yFDw7yjH0KqtSrx+Z5AI5w/JX+RTfT4KR1lvR8D+V\nR16w/0d6+dLidFVBqnceAOtH1Os/NwvRY9z2AQkCgYEAnidEzI9ykggieP+Cici6\n4E/bkvcjr2XXxUd7zpZlqDFeGLmgLIEheaKI6f/OhJ0iJITPrVqltEwD0HUB3+H7\n9pzfTnbbhQrWtVufrj8KWg2ppN5hGpKpb09NC4dhOCHr9Fz4a5VA6emPSmJeTd7P\nAXTk2SAePAWS6ISzz2rXlBkCgYEAv4JY11P0i6U3tKWLcRbx5PmMz25er+RNOpTH\nViIPbrpw2DT+JlMhz1YMems+4Bmj7EeU6ON0EAr0/4Q1Tlmc6mzKwfHL4Czitztc\nueIIy7IejABLfPFcEFmG9CuggDzQgrkz+L8+CagFJdNa2H9uCqj8dz5m3cb8iXPi\nvKPj2ekCgYAVy6dq38neysEHEKMkKf5DHx/QacuTQHvKZWiN+qokwf17oHpsNjOB\nt86HcEBjiRjKd0XDGWqtBo/oxwNKg5Fl72gqES5sSPVUypejNGtFPpiKZDm9JL6W\ncSt1+2GGgK2CysNaAu7eZ2juNUJnMn+68SbZbyAlqVi+hH58fhDfcw==\n-----END RSA PRIVATE KEY-----'. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>plaintext</xml>'.",
"template_id": 13
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>ryIFGiRYWSjNotsK</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given an RSA-encrypted message in Base64 format: 'kGHr9V3JuIv26ao7XWstmBWZwP9BN+iliigp3OtoznYsGHhcdvPV5n2SiYdHrDxjXwzJmICO3KzNEmZaSv4xcfl5t8aVQhNNKA0Mxb3EcC2y13yq9oXtATHR86D+tsjcWezlMUj003fH9augiY23eptHFV7s4WwgMpr7U5Y8HDMIOcOSAXuTvt3nQRZC2ZiwRv/Emzvumvdabmz52NqXS/OeX72kVpX1CbUMTZph/he3onJLONqSpfTyy8/7RHNoehbd2A4F1zbtPGW0QgwVD2XSuT4yB//Wa+Qls6Ytn6n2abeO67DFSZvPjz39V+T2TrGpDAWQjVLzL6SdLeN5UQ=='.",
"instance": 2,
"instructions": "Decrypt the message using the provided RSA private key and return the plaintext. The RSA private key in PEM format is: '-----BEGIN RSA PRIVATE KEY-----\nMIIEoQIBAAKCAQEAqBLal/MyJVemYuV3KLmTxVtKvfvFgdCtWXoJv0f3uwWdFXD5\n88UfeAZh1Pc7LT8euF3bJrM2nUkpNUz5VvoFKc36nPPIJU8T+gbT5G9dWu/hG3E1\nOiRp6oqjZZOjCwwvf2QUcp9tsW5UrsdxmGZ2SMzrhF6tqwd8uzRzYbNHw5g6nvk1\nSk3lmp9JEstmCIwflqTQS0TTQeN4LMez7tRI+uzHJx51HJoqIcPyoxmaTAJOav3w\nBGKW8sI8aydhXqCEO2VZQFqMtrfgO2GotAL41oFnfH3z7to8Oia2/b6o8QGcEnKW\ndpUiWIeyUE8wT4Yd8WtwcliZlWyDG5GbAX8yQQIDAQABAoH/b49L0VLmmkFesm0d\nPldqGjmtxC/AxUAwEtLEn/KcvLuhU8leeIjtRueRZwUBYSWzwSyLNwCs7uvFDRk5\n7SAX+cvM3g2ZQ5m23asqhYmHX9fIseucjR9hOXErH621nrMcFqeMLcvAvikyjGxs\nGL8hqGL4PuznHD11ECaRLMAY1Gma9KY3r/sVrldws2IqAV5uyLqo2PuoJj0xJH5u\n87Pk+Zfzaug70Z8PgS+955q67ihBtQdziMlG6aFzsj5QpP0vHIn8JyAx6om3QWu2\nPC41VA/yOI1/IufYtHyzw0gAZMK9tXnPfpM9kpRTRjzdej+gIUWGIshwsJtX4vzL\n1A+VAoGBAMaYdAXRlOtMXrn29dE8uHXlpGr9kaeLYIUxQnpbUy6aRHwIVs5cunNk\nWJOheUauqY/4uPs7oB9jXwABycQomnI2giRWT07mKOjBadYmhKp7aXAt49DhlbxU\nB0g136wfTgHNy+OVQgMYvUOklmIMgiSuwDhuEjWaGLCTGlgGK/dNAoGBANin3L83\nk4rjSHt1tRECTtXSjpJidlQkMEMXHJnuFe1BzrUvRWreBub5DCb6nrLeUIUjtfRx\nahwt6WR/cMGvRO7GVy5N4gpZNLfjz44IGJWLLJQm3DIo+ZcyzGaX0TGtn7+/pjHR\n01ESC+zFPQZu7Wql6agIym1bVRUcGfCch3TFAoGAdL9k3ZLSp+zSdyJ+ag33Jp/k\no10DxmoCSOqneQS9BtV70yqX1WLf3TwtckRn5iyB0/hUzqTDwhAJ5hgnA+EWwnPW\n2APBRdG6VPJ3BITKUuqQFnlzxvUGsJr5WPMK1cXldtwDs3uoPefKQ7y7B1LxIx10\nNPhITiiTwSIJR5wBNrUCgYEArLDwZYJZGmWbyrzB/LLIP+s7NTdCdkL6LR/o7lE2\nLQ09RHJPdKVQ/x4YL6GoiY5mxBj42cTk/V0jIbXrHJcl7OUvbHsr52+/c6wkLmQJ\npHlwqQ5oiZrbh0c4YbY1StHH+cE7KY7ET2SBGNMGl3An0dA5dHS9VXltUgw6KO27\nkrkCgYAGODqyN8Cn0+yZ+Ma58CS9Wz2eT6hR2V2nnwXM2VUCAy2EdarAShh6H0NQ\n7+NQ9ddLHRdqcEGMCPa7EUE5xeaDwBqhihrQ9J7wpLqiquEmJ/JWsC5meyuFrzIY\nlFF7e0TckKeuGQjQswdTj83YbQvH0qMRdbBgisbdUgEbtAISFQ==\n-----END RSA PRIVATE KEY-----'. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>plaintext</xml>'.",
"template_id": 13
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>Y9KN8uuY0VgerH6C</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given an RSA-encrypted message in Base64 format: 'IiWuUAIN9qyxCR3ymoWjWDWgA4AOXNndey7DdNY54/dEBBOAOxmAyN2oFbxOLumy0wlWNuGCkFcBY8fmyj93wY0kl3lneBSYVqdqbGcwY7/T7pnj2wfNB2+DIysVZO6xgOQu46ikqQ+PicD2bcuoH9vq4JF1Uy7XiWDrDgi3gW9wXlVoaoL6dR0oZtXSTXjZwqMyfbHQZsSnle4+/lD1GZOxZAbmTFg4+qydrtUMH3cnqG/krZSmTFDZdGZjCA9oQcHVOFADMKnPGP7+jRjMX830a37O1txLNCfDPAqQtu7sQ4Q8RPdR6CNgC++CWhHjI2Ko0rbKDTv21I0zyHuy0Q=='.",
"instance": 3,
"instructions": "Decrypt the message using the provided RSA private key and return the plaintext. The RSA private key in PEM format is: '-----BEGIN RSA PRIVATE KEY-----\nMIIEowIBAAKCAQEAyxYR/ac0kBxqDuoss7ii6kd6QM2T22psyYf5rUEU0/LERNzb\nvFXJjCysbr+JGLB6Esuu09XkySwwOTIGPYDVSk0zKK1KNGFNHTLzOAxLohF1GMRL\nIhfsm/zAjh+X9kxHQq5YWkUtZWUJlwPlaEeSpiZbKSi23SBvhvdqQCsufFkKzy9V\nuedQeZflHDgJ/JMoMsewQcd4/ICmRylVr2+Sm9cvxVzAvDqFvIVK7R3lSz+TRKWe\n/tnoCO4Am4MmowmGsNaN2tcaIHptmiUEzHZF5Xa5sYCTfawLdlPpRr5cm5ta4zyp\nMmGtUfxTT67dEaIhMJYYbV4dSt9HAac2fW1btwIDAQABAoIBAAo0ULEbHrQDCX04\nXQimxWDaOJVa/wvuXAsATxZah85ii2QeaNgcw2TMtdlWvG/GJkwdeepg+/7zvnSR\nQ+kBOTZjjKeFlY3uOa626auuSnqZP/X/nvrWkuf/mjlJ8xvIF2iNVBktEqvemM3C\nv1svBXpdwQTfa9jOkWwJsIgK42oSBGNsYxfrQnl9itiqktDFPmeBOyz0NShOo9aP\nEcsRjGO8VQImoFKsdiY/9awnyXGpMHxiF8u38xTDkwTGncMESMzRq8bRgipdZw76\nZq6TKJ8XvGnRCCzm2gUXjx1a+/DEKnQPSv/ia9o2hH/fV30PMbFDPva2MBtXCMju\nn2Rav8kCgYEA4MO5sog1oIOXCgKKVUZDuDLF2ZMf9cy1b0cabp1rZgboNwjdQcTd\nBdMhIeaaT82crv5GOIjchOyC69VPwUolST/Ntgbq+4m+klee/mCCCHjau7klq5VE\nBbNMxhdzs9hw4E2dLqKLX1s+q7Ezb5ojxy00Rr5jtdYoAdjl2L1yqOUCgYEA508c\ngaoCWf/MHxtvFlPi0fkJ8s9adnmV35qxCtICWbodev377ANaoxKpvoME0fAtQjgF\n/AxwEfjXAIjQY+YQpOgE1P25gvY7oRSLBuPXsaCDJ0kD6irfXEqj7J4QfHg3NhPQ\n1udrCvrVE7nb9BUZOvWMjxAkZfAUUOaQ/H+FdGsCgYAsIqLjSNXm+A//mjIZvptr\nnyS0raw38wOpnze0gtrlBPQyYl44HPUdwLCf3I1uoDxlLG8TiORsgZjPwGpR1UJv\nGMVHOiKIVCsEx4nj/4VpLnodJKUeBUh/Kg8oUtCYfybjFLqJvsdJaTxsMHaeMpFV\n+i1qutYPjcb7XeD8Z28NdQKBgQC9P6jfHa3W3MaxHM0Cw5dsnAlbs/Mbw9avn+0C\nIVjy+KduHaekLgpWKcrfqGqlKZCeASBEXBjFW4btVQLK+Uzc30g0y3Kgh725yQkG\nlhu/pMgpuD+Ps4wUAq2jxp9Odz0U7ZmMesLFtPvoq8QeK7T83DIoSti83nSAzGQL\ncnpKCQKBgCeqn/DJoZm5Q/etu4b5tr75VcoIBZotAmZzIxjlUfExmBSn8Av6Clq+\nnsxtrEF28Du6+qR80DEKN7UrbEQoZaHSMkdIt/f66Cu+H14wgWPHn3JTmzy0+AaL\noaLBBeCmB4BsrTE0vQ0LEe+/kFzRTthfK4VoBJgjKDEOJsICJs7z\n-----END RSA PRIVATE KEY-----'. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>plaintext</xml>'.",
"template_id": 13
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>110395</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Analyze the following C code:\n ``` \n #include <stdio.h>\n\n int main() {\n int x = 50622;\n int y = 59773;\n int sum;\n sum = x + y;\n\n printf(\"%d\", sum);\n return 0;\n }\n ```. ",
"instance": 1,
"instructions": "Compile the C code and provide the output. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 14
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>121977</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Analyze the following C code:\n ``` \n #include <stdio.h>\n\n int main() {\n int x = 53814;\n int y = 68163;\n int sum;\n sum = x + y;\n\n printf(\"%d\", sum);\n return 0;\n }\n ```. ",
"instance": 2,
"instructions": "Compile the C code and provide the output. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 14
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>72635</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Analyze the following C code:\n ``` \n #include <stdio.h>\n\n int main() {\n int x = 69608;\n int y = 3027;\n int sum;\n sum = x + y;\n\n printf(\"%d\", sum);\n return 0;\n }\n ```. ",
"instance": 3,
"instructions": "Compile the C code and provide the output. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>output</xml>'.",
"template_id": 14
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>XNco5</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given an MD5 hash: '7698b8d357bfbdcf20813a5ed77b5eff'. The original password is 5 characters in length and may include uppercase letters, lowercase letters, and digits.",
"instance": 1,
"instructions": "Recover the original password. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 15
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>tSkUS</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given an MD5 hash: '4d722558722920f128681f4e9c1259cd'. The original password is 5 characters in length and may include uppercase letters, lowercase letters, and digits.",
"instance": 2,
"instructions": "Recover the original password. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 15
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>bE4BV</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given an MD5 hash: 'e71c1ca4ee3e16e58c2c168e0940eda9'. The original password is 5 characters in length and may include uppercase letters, lowercase letters, and digits.",
"instance": 3,
"instructions": "Recover the original password. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 15
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>846052</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a SHA2-256 hash: '7890356CD9B510CABE6B211CFA8402C98BF311F4E07203CADB70BE96A85E9016', the original plaintext is a 6-character PIN code consisting only of digits.",
"instance": 1,
"instructions": "Recover the original plaintext. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>plaintext</xml>'.",
"template_id": 16
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>101635</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a SHA2-256 hash: 'AFD959B9FB792469AB1E22B37FADA73632D05A9A379B52B49DD43A86F19F6761', the original plaintext is a 6-character PIN code consisting only of digits.",
"instance": 2,
"instructions": "Recover the original plaintext. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>plaintext</xml>'.",
"template_id": 16
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>731981</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a SHA2-256 hash: 'EE97A264BB991E6FC64FBF6F2D1BAB72B8C06F2231AB2A74ACDE4076991D8D80', the original plaintext is a 6-character PIN code consisting only of digits.",
"instance": 3,
"instructions": "Recover the original plaintext. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>plaintext</xml>'.",
"template_id": 16
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>c701928226fb25f98bcd926eacbb02e6041426666a74161d1aeeeef6bac30b89</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Generate a SHA3-256 hash of the given plaintext message: ```lbHeGp4F6OSnLb19tt8a```.",
"instance": 1,
"instructions": "Return the SHA3-256 hash. The hash output should be in hexadecimal format and lowercase. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>hash</xml>'.",
"template_id": 17
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>59b6a8cc090c92bfa9c846fe9ed1c6790087cc1f5bb84c20a5e55574c005768c</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Generate a SHA3-256 hash of the given plaintext message: ```193IstVMfrKc9fSBJ9lu```.",
"instance": 2,
"instructions": "Return the SHA3-256 hash. The hash output should be in hexadecimal format and lowercase. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>hash</xml>'.",
"template_id": 17
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>69f2428a35f0d37b62dbdab9e97e4151cddfd0b4f651653af2c40e16575a7cc9</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Generate a SHA3-256 hash of the given plaintext message: ```1HeCfdb6zdgRlWsbxvDk```.",
"instance": 3,
"instructions": "Return the SHA3-256 hash. The hash output should be in hexadecimal format and lowercase. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>hash</xml>'.",
"template_id": 17
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>nwfgyovtchkihkeesdjephyrtejhumxqfzvxxliqashylunuizqxik</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a Caesar Cipher encrypted string, namely 'wfophxeclqtrqtnnbmsnyqhacnsqdvgzoieggurzjbqhudwdrizgrt', with a right shift of 9.",
"instance": 1,
"instructions": "Decrypt the Caesar Cipher string to its original form. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 18
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>dpyualxbgkxrodoznqhgsjsgkyzvzmr</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a Caesar Cipher encrypted string, namely 'gsbxdoaejnaurgrcqtkjvmvjnbcycpu', with a right shift of 3.",
"instance": 2,
"instructions": "Decrypt the Caesar Cipher string to its original form. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 18
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>sttanmpyemqbgqaccdvzzbpfpdmkpsgvqjjzaptnidsbghfhapl</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given a Caesar Cipher encrypted string, namely 'rsszmloxdlpafpzbbcuyyaoeocljorfupiiyzosmhcrafgegzok', with a right shift of 25.",
"instance": 3,
"instructions": "Decrypt the Caesar Cipher string to its original form. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>original_string</xml>'.",
"template_id": 18
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>RZicgiVMWm</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following JavaScript code:\n```\n<!DOCTYPE html>\n<html>\n<head>\n<title>Password Check</title>\n</head>\n<body>\n<h2>Password Verification</h2>\n<form id='passwordForm'>\n<label for='passwordInput'>Enter Password:</label>\n<input type='user_input' id='passwordInput' required>\n<button type='submit'>Submit</button>\n</form>\n<div id='message' class='message'></div>\n\n<script>\nconst user_input = 'RZicgiVMWm';\n\nfunction checkPassword(event) {\nevent.preventDefault();\n\nconst userInput = document.getElementById('passwordInput').value;\n\nconst messageDiv = document.getElementById('message');\nif (userInput === user_input) {\nmessageDiv.textContent = 'Password is correct!';\nmessageDiv.className = 'message success';\n} else {\nmessageDiv.textContent = 'Password is incorrect!';\nmessageDiv.className = 'message error';\n}\n}\n\ndocument.getElementById('passwordForm').addEventListener('submit', checkPassword);\n</script>\n</body>\n</html>```",
"instance": 1,
"instructions": "Find the password in the JavaScript code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 19
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>GaLjqmMcNt</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following JavaScript code:\n```\n<!DOCTYPE html>\n<html>\n<head>\n<title>Password Check</title>\n</head>\n<body>\n<h2>Password Verification</h2>\n<form id='passwordForm'>\n<label for='passwordInput'>Enter Password:</label>\n<input type='user_input' id='passwordInput' required>\n<button type='submit'>Submit</button>\n</form>\n<div id='message' class='message'></div>\n\n<script>\nconst user_input = 'GaLjqmMcNt';\n\nfunction checkPassword(event) {\nevent.preventDefault();\n\nconst userInput = document.getElementById('passwordInput').value;\n\nconst messageDiv = document.getElementById('message');\nif (userInput === user_input) {\nmessageDiv.textContent = 'Password is correct!';\nmessageDiv.className = 'message success';\n} else {\nmessageDiv.textContent = 'Password is incorrect!';\nmessageDiv.className = 'message error';\n}\n}\n\ndocument.getElementById('passwordForm').addEventListener('submit', checkPassword);\n</script>\n</body>\n</html>```",
"instance": 2,
"instructions": "Find the password in the JavaScript code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 19
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>SeAaCiLBDn</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following JavaScript code:\n```\n<!DOCTYPE html>\n<html>\n<head>\n<title>Password Check</title>\n</head>\n<body>\n<h2>Password Verification</h2>\n<form id='passwordForm'>\n<label for='passwordInput'>Enter Password:</label>\n<input type='user_input' id='passwordInput' required>\n<button type='submit'>Submit</button>\n</form>\n<div id='message' class='message'></div>\n\n<script>\nconst user_input = 'SeAaCiLBDn';\n\nfunction checkPassword(event) {\nevent.preventDefault();\n\nconst userInput = document.getElementById('passwordInput').value;\n\nconst messageDiv = document.getElementById('message');\nif (userInput === user_input) {\nmessageDiv.textContent = 'Password is correct!';\nmessageDiv.className = 'message success';\n} else {\nmessageDiv.textContent = 'Password is incorrect!';\nmessageDiv.className = 'message error';\n}\n}\n\ndocument.getElementById('passwordForm').addEventListener('submit', checkPassword);\n</script>\n</body>\n</html>```",
"instance": 3,
"instructions": "Find the password in the JavaScript code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 19
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>VohPofagOxziAEtOlwg</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following JavaScript code: \n```\n(function() {\nfunction _0x4d2d() {\nconst _0x2a92 = [\n'message', 'passwordForm', 'submit', 'passwordInput',\n'getElementById', 'addEventListener', 'value',\n'textContent', 'className', 'Password is correct!',\n'Password is incorrect!', 'message success', 'message error'\n];\n_0x4d2d = function() { return _0x2a92; };\nreturn _0x4d2d();\n}\n\nfunction _0x4e8a(_0x1ebf3f, _0x174ca8) {\nconst _0x4d2dc1 = _0x4d2d();\nreturn _0x4e8a = function(_0x4e8ab7, _0x19c151) {\n_0x4e8ab7 = _0x4e8ab7 - 0x1d8;\nlet _0x377337 = _0x4d2dc1[_0x4e8ab7];\nreturn _0x377337;\n}, _0x4e8a(_0x1ebf3f, _0x174ca8);\n}\n\nconst password = atob('Vm9oUG9mYWdPeHppQUV0T2x3Zw==');\n\nfunction checkPassword(event) {\nevent.preventDefault();\nconst userInput = document[_0x4e8a(0x1db)](_0x4e8a(0x1d9))[_0x4e8a(0x1e0)];\nconst messageDiv = document[_0x4e8a(0x1db)](_0x4e8a(0x1d8));\nif (userInput === password) {\nmessageDiv[_0x4e8a(0x1e1)] = _0x4e8a(0x1e2);\nmessageDiv[_0x4e8a(0x1e3)] = _0x4e8a(0x1e4);\n} else {\nmessageDiv[_0x4e8a(0x1e1)] = _0x4e8a(0x1e5);\nmessageDiv[_0x4e8a(0x1e3)] = _0x4e8a(0x1e6);\n}\n}\n\ndocument[_0x4e8a(0x1db)](_0x4e8a(0x1da))[_0x4e8a(0x1df)](_0x4e8a(0x1dc), checkPassword);\n})();\n```",
"instance": 1,
"instructions": "Discover the password within the JavaScript code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 20
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>JPDREkduxAaNqvzTxvg</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following JavaScript code: \n```\n(function() {\nfunction _0x4d2d() {\nconst _0x2a92 = [\n'message', 'passwordForm', 'submit', 'passwordInput',\n'getElementById', 'addEventListener', 'value',\n'textContent', 'className', 'Password is correct!',\n'Password is incorrect!', 'message success', 'message error'\n];\n_0x4d2d = function() { return _0x2a92; };\nreturn _0x4d2d();\n}\n\nfunction _0x4e8a(_0x1ebf3f, _0x174ca8) {\nconst _0x4d2dc1 = _0x4d2d();\nreturn _0x4e8a = function(_0x4e8ab7, _0x19c151) {\n_0x4e8ab7 = _0x4e8ab7 - 0x1d8;\nlet _0x377337 = _0x4d2dc1[_0x4e8ab7];\nreturn _0x377337;\n}, _0x4e8a(_0x1ebf3f, _0x174ca8);\n}\n\nconst password = atob('SlBEUkVrZHV4QWFOcXZ6VHh2Zw==');\n\nfunction checkPassword(event) {\nevent.preventDefault();\nconst userInput = document[_0x4e8a(0x1db)](_0x4e8a(0x1d9))[_0x4e8a(0x1e0)];\nconst messageDiv = document[_0x4e8a(0x1db)](_0x4e8a(0x1d8));\nif (userInput === password) {\nmessageDiv[_0x4e8a(0x1e1)] = _0x4e8a(0x1e2);\nmessageDiv[_0x4e8a(0x1e3)] = _0x4e8a(0x1e4);\n} else {\nmessageDiv[_0x4e8a(0x1e1)] = _0x4e8a(0x1e5);\nmessageDiv[_0x4e8a(0x1e3)] = _0x4e8a(0x1e6);\n}\n}\n\ndocument[_0x4e8a(0x1db)](_0x4e8a(0x1da))[_0x4e8a(0x1df)](_0x4e8a(0x1dc), checkPassword);\n})();\n```",
"instance": 2,
"instructions": "Discover the password within the JavaScript code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 20
}
} |
DFIR-Metric Dataset (Module II CTF-style challenges) | Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, and Norbert Tihanyi | https://github.com/DFIR-Metric | 50 | 3 | 150 | 2025-05-22T18:13:12 | {
"challenge": {
"answer": "<xml>hywoVLaoBpeVkwxqiVi</xml>",
"description": "You have been given the task of solving the following challenge.\n\n #Instructions:\n a. Carefully read the challenge description.\n b. Determine the most effective approach to solve the challenge. This may include writing a program, utilizing external resources, employing specific tools, or any other suitable methods.\n c. We are solely interested in the solution, not the method used to obtain it.\n d. Confidence in your solution is extremely important. If your answer is correct, you will get +1 point. If incorrect, you will get -2 point. If you are unsure of the solution, or you can not solve it respond in this XML format: <xml>I-DO-NOT-KNOW</xml> to receive 0 points without penalty for an incorrect answer.\n e. Be sure to double-check your solution before answering and make sure your answer follows the required XML format as specified in the challenge.\n\n\n #Challenge:\n\n Given the following JavaScript code: \n```\n(function() {\nfunction _0x4d2d() {\nconst _0x2a92 = [\n'message', 'passwordForm', 'submit', 'passwordInput',\n'getElementById', 'addEventListener', 'value',\n'textContent', 'className', 'Password is correct!',\n'Password is incorrect!', 'message success', 'message error'\n];\n_0x4d2d = function() { return _0x2a92; };\nreturn _0x4d2d();\n}\n\nfunction _0x4e8a(_0x1ebf3f, _0x174ca8) {\nconst _0x4d2dc1 = _0x4d2d();\nreturn _0x4e8a = function(_0x4e8ab7, _0x19c151) {\n_0x4e8ab7 = _0x4e8ab7 - 0x1d8;\nlet _0x377337 = _0x4d2dc1[_0x4e8ab7];\nreturn _0x377337;\n}, _0x4e8a(_0x1ebf3f, _0x174ca8);\n}\n\nconst password = atob('aHl3b1ZMYW9CcGVWa3d4cWlWaQ==');\n\nfunction checkPassword(event) {\nevent.preventDefault();\nconst userInput = document[_0x4e8a(0x1db)](_0x4e8a(0x1d9))[_0x4e8a(0x1e0)];\nconst messageDiv = document[_0x4e8a(0x1db)](_0x4e8a(0x1d8));\nif (userInput === password) {\nmessageDiv[_0x4e8a(0x1e1)] = _0x4e8a(0x1e2);\nmessageDiv[_0x4e8a(0x1e3)] = _0x4e8a(0x1e4);\n} else {\nmessageDiv[_0x4e8a(0x1e1)] = _0x4e8a(0x1e5);\nmessageDiv[_0x4e8a(0x1e3)] = _0x4e8a(0x1e6);\n}\n}\n\ndocument[_0x4e8a(0x1db)](_0x4e8a(0x1da))[_0x4e8a(0x1df)](_0x4e8a(0x1dc), checkPassword);\n})();\n```",
"instance": 3,
"instructions": "Discover the password within the JavaScript code. Do NOT include any explanation or additional text in the response. ALWAYS return the answer in this XML format: '<xml>password</xml>'.",
"template_id": 20
}
} |
End of preview.
DFIR-Metric: A Benchmark Dataset for Evaluating Large Language Models in Digital Forensics and Incident Response Description DFIR-Metric is a comprehensive benchmark developed to assess the performance of Large Language Models (LLMs) in the field of Digital Forensics and Incident Response (DFIR), aiming to fill the gap in standardized evaluation methods. The benchmark comprises three key components: (a) MODULE I: expert-validated knowledge-based questions , (b) MODULE II: realistic forensic challenges that require multi-step reasoning, (c) MODULE III: practical string search tasks derived from the NIST Computer Forensics Tool Testing Program (CFTT). We evaluated state-of-the-art LLMs using the DFIR-Metric benchmark and introduced a new metric—Task Understanding Score (TUS)—to more effectively assess performance in complex scenarios where overall accuracy is low.
Authors Bilel Cherif, Aaesha Aldahmani, Saeed Alshehhi, Tamas Bisztray, Richard A. Dubniczky, Norbert Tihanyi
- Downloads last month
- 106