b6a.black/posts/2023-08-28-cryptoctf

Preview meta tags from the b6a.black website.

Linked Hostnames

7

Search Engine Appearance

Google

https://b6a.black/posts/2023-08-28-cryptoctf

CryptoCTF 2023 Writeup

Welcome!! (23 points, 663 solves) Difficulty: Warm-up We surely did get warmed up this CTF, as we came second, even beating the Cryptohackers (merge) team! Well done to everyone who participated 💜 Did it! (33 points, 220 solves) Difficulty: Easy The parameters $n = 127$ and $\ell = 20$ is fixed. A hidden subset of $\ell$ numbers $S \subseteq \{0, 1, \cdots, n - 1\}$ with $|S| \leq \ell$ is chosen, and we are given $13$ calls to the following oracle: Given a set $T \subseteq {0, 1, \cdots, n - 1}$ also with $|T| \leq \ell$, the server computes $T \setminus S$ and outputs $\{(u^2 + \varepsilon) \pmod{n} : u \in T \setminus S, \varepsilon \in \{0, 1\}\}$.



Bing

CryptoCTF 2023 Writeup

https://b6a.black/posts/2023-08-28-cryptoctf

Welcome!! (23 points, 663 solves) Difficulty: Warm-up We surely did get warmed up this CTF, as we came second, even beating the Cryptohackers (merge) team! Well done to everyone who participated 💜 Did it! (33 points, 220 solves) Difficulty: Easy The parameters $n = 127$ and $\ell = 20$ is fixed. A hidden subset of $\ell$ numbers $S \subseteq \{0, 1, \cdots, n - 1\}$ with $|S| \leq \ell$ is chosen, and we are given $13$ calls to the following oracle: Given a set $T \subseteq {0, 1, \cdots, n - 1}$ also with $|T| \leq \ell$, the server computes $T \setminus S$ and outputs $\{(u^2 + \varepsilon) \pmod{n} : u \in T \setminus S, \varepsilon \in \{0, 1\}\}$.



DuckDuckGo

https://b6a.black/posts/2023-08-28-cryptoctf

CryptoCTF 2023 Writeup

Welcome!! (23 points, 663 solves) Difficulty: Warm-up We surely did get warmed up this CTF, as we came second, even beating the Cryptohackers (merge) team! Well done to everyone who participated 💜 Did it! (33 points, 220 solves) Difficulty: Easy The parameters $n = 127$ and $\ell = 20$ is fixed. A hidden subset of $\ell$ numbers $S \subseteq \{0, 1, \cdots, n - 1\}$ with $|S| \leq \ell$ is chosen, and we are given $13$ calls to the following oracle: Given a set $T \subseteq {0, 1, \cdots, n - 1}$ also with $|T| \leq \ell$, the server computes $T \setminus S$ and outputs $\{(u^2 + \varepsilon) \pmod{n} : u \in T \setminus S, \varepsilon \in \{0, 1\}\}$.

  • General Meta Tags

    13
    • title
      CryptoCTF 2023 Writeup | Black Bauhinia
    • charset
      utf-8
    • X-UA-Compatible
      IE=edge
    • viewport
      width=device-width, initial-scale=1, shrink-to-fit=no
    • robots
      index, follow

  • Open Graph Meta Tags

    4
    • og:title
      CryptoCTF 2023 Writeup
    • og:description
      Welcome!! (23 points, 663 solves) Difficulty: Warm-up We surely did get warmed up this CTF, as we came second, even beating the Cryptohackers (merge) team! Well done to everyone who participated 💜 Did it! (33 points, 220 solves) Difficulty: Easy The parameters $n = 127$ and $\ell = 20$ is fixed. A hidden subset of $\ell$ numbers $S \subseteq \{0, 1, \cdots, n - 1\}$ with $|S| \leq \ell$ is chosen, and we are given $13$ calls to the following oracle: Given a set $T \subseteq {0, 1, \cdots, n - 1}$ also with $|T| \leq \ell$, the server computes $T \setminus S$ and outputs $\{(u^2 + \varepsilon) \pmod{n} : u \in T \setminus S, \varepsilon \in \{0, 1\}\}$.
    • og:type
      article
    • og:url
      https://b6a.black/posts/2023-08-28-cryptoctf/

  • Twitter Meta Tags

    3
    • twitter:card
      summary
    • twitter:title
      CryptoCTF 2023 Writeup
    • twitter:description
      Welcome!! (23 points, 663 solves) Difficulty: Warm-up We surely did get warmed up this CTF, as we came second, even beating the Cryptohackers (merge) team! Well done to everyone who participated 💜 Did it! (33 points, 220 solves) Difficulty: Easy The parameters $n = 127$ and $\ell = 20$ is fixed. A hidden subset of $\ell$ numbers $S \subseteq \{0, 1, \cdots, n - 1\}$ with $|S| \leq \ell$ is chosen, and we are given $13$ calls to the following oracle: Given a set $T \subseteq {0, 1, \cdots, n - 1}$ also with $|T| \leq \ell$, the server computes $T \setminus S$ and outputs $\{(u^2 + \varepsilon) \pmod{n} : u \in T \setminus S, \varepsilon \in \{0, 1\}\}$.

  • Link Tags

    7
    • canonical
      https://b6a.black/posts/2023-08-28-cryptoctf/
    • icon
      https://b6a.black/favicon.ico
    • preconnect
      https://fonts.gstatic.com
    • preload stylesheet
      /assets/css/stylesheet.min.79c4dfee3993cd3110886e38d36a5106e0d6922344cefa3ff5c0076f246815f0.css
    • stylesheet
      https://fonts.googleapis.com/css2?family=Recursive&display=swap

Links

14