cryptohard
Shamir's Secret Challenge Scenario
hackthebox
Task: recover a secret hidden as the constant term of a degree-31 polynomial modulo 2^1024, mixed with 32 random fake shares. Solution: distinguish real shares with a 2-adic valuation test on zero encryptions, then reconstruct the secret with an HNF-based solver over Z/(2^1024).
$ ls tags/ techniques/
chosen_plaintextpolynomial_interpolationshamir_secret_sharingpower_of_two_modulusfake_shares2_adic_valuationmodular_linear_algebra
real_share_distinguishingchosen_plaintext_zero_probehnf_based_modular_reconstructioninterpolation_over_zmod_2k
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub to get started.
$ssh [email protected]