easy Cryptography The Forgotten Vault Points Poten...

创建于:2026年10月31日

使用 GPT-5.6 Thinking 回答 Chat01

问题

0a3446a817d346bf955571cbae1843d0.zip

easy
Cryptography
The Forgotten Vault
Points Potential
100
Challenge Description
The vault developer derived an AES-128 key from a dictionary word and a numeric PIN. Crack the key and recover the classified intelligence.

Flag Format: HACKITUP{...}
Submit Flag
Format: HACKITUP{...}

回答

I’ll inspect the challenge bundle, identify the key-derivation/encryption scheme, then brute-force the dictionary word + PIN space and recover the flag.

思考

Inspected CTF archives and read challenge output files

回答

The bundle makes the weakness explicit: only 5,460 dictionary words × 100 PINs = 546,000 candidates. The key is MD5(Capitalize(word) + two-digit PIN), so this is a small offline search.

思考

Brute-forced AES vault password candidates and checked cryptography libraries

Worked for 25s

回答

Cracked successfully.

  • Word: keystone
  • PIN: 42
  • Password: Keystone42
  • AES-128 key (MD5): ed5c881ffdb35eb114dbafdb0dafb904

Flag:

text
HACKITUP{md5_k3y_d3r1v4t10n_w1th_p1n_m4ngl1ng_15_f4r_t00_w34k}

问题

67626ea3d2f145349f67c4f37ea45919.zip

medium
Forensics
THE CAPTAIN'S LAST LOG
Points Potential
200
Challenge Description
An abandoned pirate ship, a missing captain, and a recovered storage device. Can you recover Captain Vance's final deleted log and uncover his last secret?
Submit Flag
Attempts Left: 10 / 10
Format: FLAG{...}

回答

I’ll unpack the evidence, identify the filesystem/image type, then recover deleted artifacts and search the recovered captain log for the FLAG{...} value.

思考

Inspected ZIP contents and checked E01 tools and checksum

回答

The evidence checksum matches, and the payload is a valid EnCase/E01 forensic image. I’m now working at the filesystem/deleted-file layer rather than trusting visible files alone—the challenge specifically points to a deleted final log.

思考

Decoding the volume

I’m identifying the header fields and validating them against the offsets. The image appears to be 64 MB, divided into 2,048 chunks, with compressed entries pointing into a sector-data area.

Decoded the volume

思考

Inspected E01 forensic image structure and reconstructed its NTFS filesystem

回答

I’ve reconstructed the original 64 MB disk image and verified its MD5 against the E01’s stored hash, so the extraction is sound. The partition is NTFS; I’m parsing its MFT directly so deleted entries remain visible even without mounting the filesystem.

思考

Recovered deleted file data, inspected logs, and decrypted Vigenere cipher

Worked for 1m 14s

回答

Solved.

The deleted NTFS MFT entry was:

Captains_Quarters/journal_entries/journal_1723_11_24_final.txt

It specified a Vigenère key built from:

  • Night watchword for Nov. 23: LEVIATHAN
  • NTFS volume label: BLACK_TIDE
  • Effective key: LEVIATHANBLACKTIDE

Decrypting the recovered ciphertext gives:

text
FLAG{v4nc3_s1l4s_d34d_m4ns_c4y_s3cr3t_1723}

Recovered captain's final log

问题

medium
Cryptography
Welcome
Points Potential
200
Challenge Description
One hidden message Countless possibilities.

A mysterious message was recovered from an old pirate transmission. The message appears to be nothing more than a meaningless sequence of characters, but the captain left behind one clue:

The truth is hidden in the alphabets, not in the words.

Your task is to uncover the original message and recover the hidden flag

Sometimes, the hardest part isn't finding the treasure. It's understanding how it was hidden.

3HZF7u0WE87LVnejqUQ6yIymxYd4LYh6YqJieV2Oft7iYaggfjl6I93nrGF3N6kEWhTNCdnfjCVuROFAA4sWX7kod
Submit Flag
Attempts Left: 10 / 10
Format: SOS{...}

回答

I’m treating the clue literally: this looks less like a word-based cipher and more like an encoding whose character alphabet has been altered. I’m checking common base encodings and custom alphabet permutations first.

Python

python
s="3HZF7u0WE87LVnejqUQ6yIymxYd4LYh6YqJieV2Oft7iYaggfjl6I93nrGF3N6kEWhTNCdnfjCVuROFAA4sWX7kod" len(s), sorted(set(s)), len(set(s)) (89, ['0', '2', '3', '4', '6', '7', '8', '9', 'A', 'C', 'E', 'F', 'G', 'H', 'I', 'J', 'L', 'N', 'O', 'Q', 'R', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'q', 'r', 's', 't', 'u', 'x', 'y'], 48)

Python

python
import math, string, binascii alphs=[ "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789", ] def baseN_decode(s, alphabet): n=0 base=len(alphabet) for ch in s: n=n*base+alphabet.index(ch) # minimal bytes return n.to_bytes((n.bit_length()+7)//8,'big') for a in alphs: b=baseN_decode(s,a) print(a[:10],len(b),b[:20],sum(32<=x<127 for x in b)/len(b))

Python

python
b=baseN_decode(s,alphs[0]) b b'3mDj8fUq2nVY4SKHQoVgv4c9AMmrStjJi16dPeWfJ58rzQxJf4MRpKsDjtVGdsFm7S'

Python

python
layers=[s] cur=s for i in range(10): try: bb=baseN_decode(cur,alphs[0]) except Exception as e: print("err",e); break print(i+1,len(cur),len(bb),bb, "print", sum(32<=x<127 for x in bb)/len(bb)) try: cur=bb.decode() layers.append(cur) except: break

Python

python
import itertools,string, math groups=[string.digits,string.ascii_uppercase,string.ascii_lowercase] candidates=[] for perm in itertools.permutations(groups): for dirs in itertools.product([False,True], repeat=3): parts=[] for g, rev in zip(perm,dirs): parts.append(g[::-1] if rev else g) a=''.join(parts) candidates.append(a) len(set(candidates)) 48

Python

python
cur=layers[1] res=[] for a in candidates: bb=baseN_decode(cur,a) pr=sum((32<=x<127) or x in (9,10,13) for x in bb)/len(bb) score=sum(32<=x<127 for x in bb) res.append((pr,a,bb)) for pr,a,bb in sorted(res, reverse=True)[:10]: print(pr,a[:15],a[-10:],len(bb),repr(bb[:80]))

Python

python
import base64, binascii mid=layers[1] for func,name in [(base64.b64decode,"b64"),(base64.urlsafe_b64decode,"url")]: try: bb=func(mid+"==") print(name,len(bb),bb, sum(32<=x<127 for x in bb)/len(bb)) except Exception as e: print(e)

Python

python
import itertools, string, base64, math, zlib, gzip, bz2, lzma std64="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" groups64=[string.ascii_uppercase,string.ascii_lowercase,string.digits,"+/"] alph64=[] for perm in itertools.permutations(groups64): # preserve group order chars, maybe reverse full? a=''.join(perm) if len(a)==64: alph64.append(a) ar=''.join(g[::-1] for g in perm) alph64.append(ar) # Add known crypt/bcrypt/url variants: alph64 += [ "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", "./ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_", std64[::-1], ] def custom_b64decode(x, alphabet): trans=str.maketrans(alphabet,std64) y=x.translate(trans) y += "="*((-len(y))%4) try:return base64.b64decode(y,validate=True) except:return None def score_bytes(b): if not b:return -1 printable=sum((32<=x<127) or x in (9,10,13) for x in b)/len(b) # bonus prefixes bonus=0 for magic in [b'SOS{',b'FLAG{',b'HACK',b'PK\x03\x04',b'\x1f\x8b',b'x\x9c',b'BZh',b'%PDF',b'{"',b'CTF']: if b.startswith(magic):bonus+=5 return printable+bonus r=[] for a in set(alph64): b=custom_b64decode(mid,a) r.append((score_bytes(b),a,b)) for sc,a,b in sorted(r,reverse=True)[:10]: print(sc,a[:20],len(b),repr(b[:60])) (['1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'D', 'F', 'G', 'H', 'J', 'K', 'M', 'P', 'Q', 'R', 'S', 'U', 'V', 'W', 'Y', 'c', 'd', 'e', 'f', 'g', 'i', 'j', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'v', 'x', 'z'], False, False, False, False)

Python

python
b58_alphabet="123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz" b=baseN_decode(mid,b58_alphabet) len(b), b, sum(32<=x<127 for x in b)/len(b) (48, b'KNHVG62XMVWGG33NMVPWEYLEMR4V653FNRWF64DMMF4WKZD5', 1.0)

Python

python
layer2=b.decode() base64.b32decode(layer2) b'SOS{Welcome_baddy_well_played}'

思考

Decoding Base32-Encoded String

Worked for 41s

回答

Solved. The clue points to changing encoding alphabets, not a word cipher:

Base62 → Base58 → Base32 → plaintext

Recovered flag:

text
SOS{Welcome_baddy_well_played}

问题

4de77d8b4ceb41958d90e717e5e63ab6.zip

Challenge Description
We designed a super secure ElGamal encryption scheme over NIST P-192.
However, our hardware decryption module seems to be suffering from bit flips...
Can you recover the master secret key?
Submit Flag
Format: flag{...}

回答

I’ll unpack the challenge files, identify exactly how the “bit flips” affect ElGamal decryption on P-192, then use that fault behavior to recover the private key and format the flag.

思考

Solving the fault pattern

I’m deriving how each faulty decryption reveals one private-key bit: the result differs from the message by either plus or minus a power-of-two multiple of C1. I’ll compare points, reconstruct the bitstring, and decode the flag.

Solved the fault pattern

Inspected CTF archive and cryptography challenge files

回答

The fault leaks one private-key bit per sample. For bit position ii, the faulty plaintext is exactly M + 2^i·C1 if that secret bit was 1, and M - 2^i·C1 if it was 0—so the entire key can be reconstructed without solving an elliptic-curve discrete log.

思考

Recovered a private key from faulty decryption

Worked for 20s

回答

Solved.

The bit-flip fault reveals each secret-key bit directly by comparing the faulty decryption against M ± 2^i·C1. Reconstructing all 319 bits gives:

text
flag{p01s0n3d_3cc_f4u1t_4tt4ck_succ3ss!}

I also verified the recovered private key against every provided ElGamal ciphertext relation.

问题

d24d9ff3bb9247dc8c0f2b79952cbbf4.zip

Challenge Description
Partial keys, broken transcripts, and a custom mixer. Find the prime factors and unlock the vault.
Submit Flag
Attempts Left: 5 / 5
Format: FLAG{...}

问题

47ab48225a314ef4ad62bc2c3e5deaf1.zip

hard
Steganography
HackitUp's Kingdom
Points Potential
600
Challenge Description
An ordinary-looking image may contain more than what meets the eye. Dig deeper, examine its hidden layers, and use your steganography skills to uncover the concealed message and retrieve the flag.
Submit Flag
Attempts Left: 5 / 5
Format: Hack!tUp{...}

分享这个问答