cryptoGRAPHy 3
| ID： | 2243 |
|---|---|
| 标题： | cryptoGRAPHy 3 |
| 描述： | Description Here is the hardest part: Can you directly recover the shortest path query if you are the server, having access to the original graph and all queries? (On a side note, this setting is somewhat realistic in scenarios such as Google Maps , where the whole routing map is available to the adversary.) ❖ Note lib.zip remains unchanged in this series. The flag for this challenge will be used to access the next one when unlocked. Author: sahuang |
| 类型： | Crypto |
| 网站： | bugku |
| 题目链接： | https://ctf.bugku.com/challenges/detail/id/2391.html |
| 赛事： | SekaiCTF2023 |
| 年度： | 2023 |
| Flag值： | cryptoGRAPHy 3 的 flag 值或具体答案在提供的搜索结果中未明确给出，但搜索结果 2包含了该题目的详细解题思路、代码分析和验证的完整过程。根据该文章，题目的核心是通过分析给定的最短路径加密结构和所有节点对的加密结果，反向匹配和推导出特定的最短路径，从而解题。验证的网址如下： |
| writeup： | https://blog.csdn.net/qq_41626232/article/details/132534546 |