[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10,"_11":12,"_13":14},"actionData","errors","root",{"_171":172,"_173":166},"routes/_root/_root",{"_168":-7,"_41":169,"_144":-7,"_170":-7},"routes/_root.challenges",{"_37":164,"_165":166,"_167":16},"routes/_root.challenges.$challengeCanonical+/_root",{"_75":76,"_77":78,"_79":80},"routes/_root.challenges.$challengeCanonical+/writeups",{"_15":16,"_17":16,"_18":19,"_20":21,"_22":21},"solved",false,"hasWriteup","writeups",[23,24,25,26,27],"name","xorshift521","canonicalName",{"_28":68,"_30":69,"_32":70,"_34":16,"_35":16,"_36":16,"_37":71,"_39":72,"_41":42,"_43":16,"_44":73},{"_28":62,"_30":63,"_32":64,"_34":16,"_35":16,"_36":16,"_37":38,"_39":65,"_41":42,"_43":16,"_44":66},{"_28":56,"_30":57,"_32":58,"_34":16,"_35":16,"_36":16,"_37":38,"_39":59,"_41":42,"_43":16,"_44":60},{"_28":48,"_30":49,"_32":50,"_34":16,"_35":16,"_36":16,"_37":51,"_39":52,"_41":42,"_43":16,"_44":53},{"_28":29,"_30":31,"_32":33,"_34":16,"_35":16,"_36":16,"_37":38,"_39":40,"_41":42,"_43":16,"_44":45},"author",{"_20":46,"_47":-5},"writeupElementId","7d17457d","writeupId","7d17457d-9549-4d52-bf10-466901d6ea35","canEdit","canLike","likedByViewer","title","Writeup for xorshift521","url","https://note.com/miyazakimitsuo/n/n28e08594c96c","language","ja","isOfficial","createdAt",["D",1782017540975],"umineko","gravatarHash",{"_20":54,"_47":55},"fb923737","fb923737-4fe5-4fb6-a2a3-51d6322358b9","Writeup for Daily AlpacaHack 6/14-6/20","https://www.notion.so/kakur41-wrteup/Daily-AlpacaHack-6-14-6-20-38bda8520c028192a489ec573c192fd4?source=copy_link",["D",1782650102428],"kakur41","b38a5e77015b23df77d112279a16aaba1c929e984106792bf5505dff367d67fa",{"_20":61,"_47":-5},"f447c025","f447c025-8277-4aff-899f-b6b33b0b6104","https://github.com/baumroll0928-spec/myRepository/blob/main/Daily_AlpacaHack/m202606/d20_xorshift521/README.md",["D",1781968936056],"baumroll1234",{"_20":67,"_47":-5},"e5f85353","e5f85353-04c3-47d6-b2b0-bac0177722d8","https://github.com/goroshirow/CTF-WriteUps/blob/main/AlpacaHack/2026Jun/xorshift521.md",["D",1781968907657],"goroshirow",{"_20":74,"_47":-5},"39334896","39334896-0fd9-4d1a-bf71-b30ce6aeafee","Daily AlpacaHackに挑戦するつくよみちゃん 06/20/xorshift521/nozokare","https://youtu.be/c9_OF-4I-hE",["D",1781970020028],"tsukuyomi-chan","challenge",{"_20":21,"_22":21,"_84":85,"_86":87,"_88":89,"_90":91,"_92":93,"_94":-7,"_95":96,"_97":98,"_99":16,"_100":-7,"_101":102,"_103":-7,"_104":-7,"_36":16,"_105":106,"_107":108,"_109":16,"_110":-7,"_111":16,"_112":-7,"_113":-7,"_114":115,"_116":-7,"_117":-7,"_118":-7,"_119":120,"_121":16,"_122":120,"_35":120,"_123":16,"_124":-7,"_125":126,"_127":128,"_129":130,"_131":132},"availablePages",[81,82,83],"canonicalUrl","https://alpacahack.com/challenges/xorshift521","Description","Solves","Writeups","solves",57,"difficulty",85,"flagFormat","Alpaca{...}","categories",[161],"attachments",[157],"remote","description","The galactic flag checker determines whether an input string is the correct flag in finite time!\n\n

Beginner Hint 1

\n\n - To solve this problem, it seems necessary to calculate the result of applying the `next` function to `state=521` for `(521**521)**521` times.\n - However, performing this calculation simply would take far too long, so some ingenuity is required.\n - Is there another way to calculate what the function is computing?\n\n

\n\n

Beginner Hint 2

\n\n - Think of an n-bit integer as an n-dimensional vector over GF(2). (GF(2) = Z/2Z is the field consisting of {0, 1}.)\n - The `next` function consists of a combination of bit shifts and XOR, forming a linear transformation from GF(2)^n to GF(2)^n.\n - This leads us to consider linear algebra over GF(2), and many properties that hold in linear algebra over the real numbers also hold over GF(2).\n\n

\n\n

Beginner Hint 3

\n\n - The `next` function is a state transition function of a type of pseudorandom number generator called an LFSR.\n - For example, [Xorshift32](https://en.wikipedia.org/wiki/Xorshift) is an LFSR with a 32-bit internal state.\n - The period of a typical Xorshift32 is 2^32 - 1, and if you start from a state other than 0 and apply the state transition function, it will cycle through 2^32 - 1 states before returning to the initial state.\n - What is the period of the `next` function?\n\n

\n\n

Beginner Hint: About SageMath

\n\n - I recommend using SageMath to solve this problem.\n - For a short introduction to SageMath, see [this short guide](https://github.com/alpacahack/resources/blob/main/resources/SageMath.md).\n - You can call the `next` function directly from SageMath by importing `chal.py`.\n - If you copy the code from `chal.py`, keep in mind that the XOR operator in SageMath is `^^`, not `^`.\n\n

\n","descriptionJa","銀河級のフラグチェッカーが入力した文字列が正しいフラグかどうかを有限時間で判定します！\n\n

初心者向けヒント①

\n \n - この問題を解くためには `state=521` に `next` 関数を `(521**521)**521` 回適用した結果を計算する必要がありそうです。\n - しかし、単純に計算していてはあまりにも時間がかかるため、何らかの工夫が必要になります。\n - 関数が計算している内容を他の方法で計算することはできないでしょうか？\n\n

\n\n

初心者向けヒント②

\n \n - n ビットの整数を n 次元ベクトル GF(2)^n として考えます。(GF(2) = Z/2Z は {0, 1} からなる体です。)\n - `next` 関数はビットシフトと XOR の組み合わせで構成されていて、GF(2)^n → GF(2)^n の線型変換になっています。\n - GF(2) 上の線型代数を考えることになりますが、実数上の線型代数で成り立っていた性質の多くは GF(2) 上の線型代数でも成り立ちます。\n\n

\n\n

初心者向けヒント③

\n\n - `next` 関数は LFSR と呼ばれる種類の疑似乱数生成器の状態遷移関数になっています。\n - 例えば [Xorshift32](https://ja.wikipedia.org/wiki/Xorshift) は内部状態が 32 ビットの LFSR です。\n - 代表的なパラメータの Xorshift32 の周期は 2^32 - 1 で、0 以外の状態からスタートして状態遷移関数を適用していくと 2^32 - 1 通りの状態を巡回して最初の状態に戻ります。\n - `next` 関数の周期はどうなっているでしょうか？\n\n

\n\n

初心者向けヒント: SageMath について

\n \n - この問題は SageMath を使って解くことをおすすめします。\n - SageMath については [簡単な紹介文](https://github.com/alpacahack/resources/blob/main/resources/SageMath.md) があります。必要に応じて参照してください。\n - `chal.py` を import することでそのまま SageMath から `next` 関数を呼び出すことができます。\n - コードをコピーして使用する場合は SageMath では XOR 演算子は `^` ではなく `^^` であることに注意してください。\n\n

\n","descriptionRequiresSignIn","changeLog","authors",[155],"solvedAt","solvedAtInContext","ctfChallenges",[],"tags",[146,147,148],"submitAsCtfChallenge","ctfCanonical","ctfEnded","point","solvesCtfChallenge","classification","hard","isMirror","ctfParticipants","ctfMode","isDailyChallenge",true,"canCheckFlagWithoutSubmission","canCreateInstance","showcaseMode","dailyProgramCanonicalForAction","reviewProgramCanonicalForAction","daily-alpacahack","dailyChallengeSlot",{"_133":134,"_114":115,"_135":136,"_137":138,"_139":140,"_141":142},"nextDailyCanonical","what-is-my-size","httpsProxyHostname","xorshift521.chal.alp4ca.com","program",{"_22":126,"_20":143,"_144":145},"scheduledDate",["D",1781881200000],"releaseAt",["D",1781881200000],"status","PUBLISHED","plannedTopic","RNG","Daily AlpacaHack","timeZone","Asia/Tokyo",{"_20":153,"_22":154},{"_20":151,"_22":152},{"_20":149,"_22":150},"Matrix","matrix","Optimization","optimization","Xorshift","xorshift",{"_20":156,"_47":-7},"nozokare",{"_158":159,"_39":160},"fileName","chal.py","https://alpacahack-prod.s3.ap-northeast-1.amazonaws.com/bf5afc06-2581-4e06-96df-86319cba885c/chal.py",{"_20":162,"_22":163},"Crypto","crypto","Challenges","query","","isLoggedIn","user","en","timeZoneAbbr","clientConfig",{"_174":175,"_176":120,"_177":178,"_179":178,"_180":181,"_182":183,"_184":16,"_185":166},"cspNonce","firebaseOptions",{"_186":187,"_188":189,"_190":191,"_192":193,"_194":195,"_196":181},"isVercel","env","production","envName","gaTrackingId","G-FJX5L5Y9FE","turnstileSiteKey","0x4AAAAAAAfYTP7SUci3nVKW","isSpawnerUnderMaintenance","spawnerMaintenanceNotice","apiKey","AIzaSyDGInmUCFubPOqJWQCw3LBB-XZGj9LX4l4","appId","1:691353492123:web:4ae258ec8c620e63f0443e","projectId","alpacahack","authDomain","alpacahack.firebaseapp.com","messagingSenderId","691353492123","measurementId"]