@possumtech/rummy 2.2.0 → 2.2.1

package/audit/sweep/feal-differential-cryptanalysis/turns/turn_004.md

@@ -1,67 +0,0 @@
-# turn 004
-
-tokens: prompt=4821 cached=1749 completion=139 reasoning=0 total=4960 cost=0
-created: 2026-05-02 00:06:01
-
-update: status=155 body=researching FEAL differential attack for distillation
-
----
-
-## reasoning (think)
-
-```
-* Still in Distillation Stage. No source code files (app/feal.py, app/attack.py) found in repo despite searches.
-* Unknown:// entries created from prompt decomposition need distillation into known://, but lack concrete source data.
-* Need external research on FEAL differential cryptanalysis for key[5] to distill properly.
-* Will search for FEAL differential attack details, then distill known:// entries based on results next turn.
-* Budget allows search (1 per turn) and promotes.
-```
-
-## assistant emission
-
-```
-<think>
-* Still in Distillation Stage. No source code files (app/feal.py, app/attack.py) found in repo despite searches.
-* Unknown:// entries created from prompt decomposition need distillation into known://, but lack concrete source data.
-* Need external research on FEAL differential cryptanalysis for key[5] to distill properly.
-* Will search for FEAL differential attack details, then distill known:// entries based on results next turn.
-* Budget allows search (1 per turn) and promotes.
-</think>
-
-<search>FEAL differential cryptanalysis chosen plaintext attack key recovery</search>
-
-<update status="155">researching FEAL differential attack for distillation</update>
-```
-
-## actions (chronological log entries)
-
-### `log://turn_4/search/FEAL_differential_cryptanalysis_chosen_plaintext_attack_key_recovery`
-scheme=log action=search attrs={"query":"FEAL differential cryptanalysis chosen plaintext attack key recovery","action":"search"}
-
-```
-8 of 12 results for "FEAL differential cryptanalysis chosen plaintext attack key recovery" (4 unreachable)
-* http://theamazingking.com/crypto-feal.php — The Amazing King - Differential Cryptanalysis of FEAL (13199 tokens)
-  The somewhat seperate process that achieves this is known as the key schedule. In the case of FEAL, this process is designed to be one-way. In other words, <strong>if you are able to recover one of the subkeys, it should be impossible to use that information to recover part of the &quot;real&quot; 64-bit key</strong>.
-* https://en.wikipedia.org/wiki/Differential_cryptanalysis — Differential cryptanalysis (7491 tokens)
-  While DES was designed with resistance to differential cryptanalysis in mind, other contemporary ciphers proved to be vulnerable. An early target for the attack was the FEAL block cipher. The original proposed version with four rounds (FEAL-4) can be broken using only eight chosen plaintexts, and ...
-* https://en-academic.com/dic.nsf/enwiki/4957 — Differential cryptanalysis (10759 tokens)
-  While DES was designed with resistance to differential cryptanalysis in mind, other contemporary ciphers proved to be vulnerable. An early target for the attack was the FEAL block cipher. The original proposed version with four rounds (FEAL-4) can be broken using only eight chosen plaintexts, and ...
-* https://github.com/samvartaka/cryptanalysis/blob/master/five_blocks/feal4_differential_cryptanalysis.py — feal4_differential_cryptanalysis.py (4074 tokens)
-  valid_schedules = differential_cryptanalysis(output_differential, [None, pairs_2, pairs_3, pairs_4])
 ... 			print &quot;[+] Recovered valid FEAL-4 key schedule [0x%08x, 0x%08x, 0x%08x, 0x%08x, 0x%08x, 0x%08x]!&quot; % (subkeys[0], subkeys[1], subkeys[2], subkeys[3], subkeys[4], subkeys[5])
-* http://taggedwiki.zubiaga.org/new_content/557444f08fd64b0f6e64087d4302dc81 — Differential cryptanalysis - Wikipedia, the free encyclopedia (5222 tokens)
-  While DES was designed with resistance to differential cryptanalysis in mind, other contemporary ciphers proved to be vulnerable. An early target for the attack was the FEAL block cipher. The original proposed version with four rounds (FEAL-4) can be broken using only eight chosen plaintexts, and ...
-* https://en.wikibooks.org/wiki/Cryptography/Differential_cryptanalysis — Cryptography/Differential cryptanalysis - Wikibooks, open books for an open world (266 tokens)
-  While DES was designed with resistance to differential cryptanalysis in mind, other contemporary ciphers proved to be vulnerable. An early target for the attack was the FEAL block cipher. The original proposed version with four rounds (FEAL-4) can be broken using only eight chosen plaintexts, and ...
-* https://en.wikipedia.org/wiki/FEAL — FEAL (3287 tokens)
-  In response, the designers introduced a variable-round cipher, FEAL-N (Miyaguchi, 1990), where &quot;N&quot; was chosen by the user, together with FEAL-NX, which had a larger 128-bit key. Biham and Shamir&#x27;s differential cryptanalysis (1991) showed that both FEAL-N and FEAL-NX could be broken faster than exhaustive search for N ≤ 31. Later attacks, precursors to linear cryptanalysis, could break versions under the known plaintext assumption, first (Tardy-Corfdir and Gilbert, 1991) and then (Matsui and Yamagishi, 1992), the latter breaking FEAL-4 with 5 known plaintexts, FEAL-6 with 100, and FEAL-8 with 215.
-* https://samvartaka.github.io/cryptanalysis/2016/04/08/volgactf-fiveblocks-writeup — VolgaCTF 2016 Quals - Five Blocks (Crypto 600) Writeup ← (28897 tokens)
-  Running the above attack against the challenge server will (after some time) recover the seperate key schedules which we can then use to decrypt any ciphertext originating from the server (including the flag): $ python five_blocks_attack.py [*] Collecting chosen plaintexts ... [*] Mounting differential cryptanalysis attack ...
-```
-
-### `log://turn_4/update/researching_FEAL_differential_attack_for_distillation`
-scheme=log action=update attrs={"status":155,"action":"update"}
-
-```
-researching FEAL differential attack for distillation
-```
-

package/audit/sweep/feal-differential-cryptanalysis/turns/turn_005.md

@@ -1,295 +0,0 @@
-# turn 005
-
-tokens: prompt=5896 cached=1749 completion=294 reasoning=0 total=6190 cost=0
-created: 2026-05-02 00:06:14
-
-update: status=155 body=discovering FEAL diff attack sources for distillation
-
----
-
-## reasoning (think)
-
-```
-* In Distillation Stage: resolve 4 unknown:// entries by discovering sources and creating known:// entries.
-* Sources: log turn_4 search has FEAL diff cryptanalysis details (promising low-token entries first).
-* Budget ok: 1.7M free, prioritize low-token sources like github py impl (4074 tokens).
-* Plan: 
-  1. Get search results detailing attack (amazingking, wiki, github py).
-  2. Distill into known://attack/differential/feal/details resolving unknown://attack/differential/feal.
-  3. Get feal.py code if exists (unknown://code/feal_py suggests /app/feal.py).
-  4. Check app/ files again targeted.
-  5. Next turn: distill spec/impl based on sources.
-* Continue 155 after.
-```
-
-## assistant emission
-
-```
-<think>
-* In Distillation Stage: resolve 4 unknown:// entries by discovering sources and creating known:// entries.
-* Sources: log turn_4 search has FEAL diff cryptanalysis details (promising low-token entries first).
-* Budget ok: 1.7M free, prioritize low-token sources like github py impl (4074 tokens).
-* Plan: 
-  1. Get search results detailing attack (amazingking, wiki, github py).
-  2. Distill into known://attack/differential/feal/details resolving unknown://attack/differential/feal.
-  3. Get feal.py code if exists (unknown://code/feal_py suggests /app/feal.py).
-  4. Check app/ files again targeted.
-  5. Next turn: distill spec/impl based on sources.
-* Continue 155 after.
-</think>
-
-<get path="http://theamazingking.com/crypto-feal.php" tokens="13199"/>
-<get path="https://github.com/samvartaka/cryptanalysis/blob/master/five_blocks/feal4_differential_cryptanalysis.py" tokens="4074"/>
-<get path="https://en.wikipedia.org/wiki/Differential_cryptanalysis" line="1" limit="500"/>
-<get path="app/feal.py"/>
-<get path="app/attack.py" preview/>
-
-<update status="155">discovering FEAL diff attack sources for distillation</update>
-```
-
-## actions (chronological log entries)
-
-### `log://turn_5/get/http%3A/theamazingking.com/crypto-feal.php`
-scheme=log action=get attrs={"path":"http://theamazingking.com/crypto-feal.php","action":"get"}
-
-```
-http://theamazingking.com/crypto-feal.php promoted
-```
-
-### `log://turn_5/get/https%3A/github.com/samvartaka/cryptanalysis/blob/master/five_blocks/feal4_differ`
-scheme=log action=get attrs={"path":"https://github.com/samvartaka/cryptanalysis/blob/master/five_blocks/feal4_differential_cryptanalysis.py","action":"get"}
-
-```
-https://github.com/samvartaka/cryptanalysis/blob/master/five_blocks/feal4_differential_cryptanalysis.py promoted
-```
-
-### `log://turn_5/get/https%3A/en.wikipedia.org/wiki/Differential_cryptanalysis`
-scheme=log action=get attrs={"path":"https://en.wikipedia.org/wiki/Differential_cryptanalysis","lineStart":1,"lineEnd":201,"totalLines":201,"action":"get"}
-
-```
-https://en.wikipedia.org/wiki/Differential_cryptanalysis
-[lines 1–201 / 201 total]
-# Differential cryptanalysis
-
-[](https://en.wikipedia.org/w/index.php?title=Differential_cryptanalysis&action=edit&section=0)
-
-**[Differential](https://en.wikipedia.org/wiki/Differential_%28mathematics%29
-"Differential (mathematics)") cryptanalysis** is a general form of
-[cryptanalysis](https://en.wikipedia.org/wiki/Cryptanalysis "Cryptanalysis")
-applicable primarily to
-[block ciphers](https://en.wikipedia.org/wiki/Block_cipher "Block cipher") , but
-also to stream ciphers and cryptographic hash functions. In the broadest sense,
-it is the study of how differences in information input can affect the resultant
-difference at the output. In the case of a
-[block cipher](https://en.wikipedia.org/wiki/Block_cipher "Block cipher") , it
-refers to a set of techniques for tracing differences through the network of
-transformation, discovering where the cipher exhibits
-[non-random behavior](https://en.wikipedia.org/wiki/Non-randomness "Non-randomness")
-, and exploiting such properties to recover the secret key (cryptography key).
-
-The public discovery and disclosure of differential cryptanalysis is generally
-attributed to [Eli Biham](https://en.wikipedia.org/wiki/Eli_Biham "Eli Biham")
-and [Adi Shamir](https://en.wikipedia.org/wiki/Adi_Shamir "Adi Shamir") in the
-late 1980s, who published a number of attacks against various block ciphers and
-hash functions, including a theoretical weakness in the
-[Data Encryption Standard](https://en.wikipedia.org/wiki/Data_Encryption_Standard "Data Encryption Standard")
-(DES). It was noted by Biham and Shamir that DES was surprisingly resistant to
-differential cryptanalysis, but small modifications to the algorithm would make
-it much more
-susceptible.[\[1\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-Biham_1993-1):
-8–9
-
-In 1994, a member of the original IBM DES team,
-[Don Coppersmith](https://en.wikipedia.org/wiki/Don_Coppersmith "Don Coppersmith")
-, published a paper stating that differential cryptanalysis was known to IBM as
-early as 1974, and that defending against differential cryptanalysis had been a
-design
-goal.[\[2\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-coppersmith-2)
-According to author
-[Steven Levy](https://en.wikipedia.org/wiki/Steven_Levy "Steven Levy") , IBM had
-discovered differential cryptanalysis on its own, and the
-[NSA](https://en.wikipedia.org/wiki/NSA "NSA") was apparently well aware of the
-technique.[\[3\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-3)
-IBM kept some secrets, as Coppersmith explains: "After discussions with NSA, it
-was decided that disclosure of the design considerations would reveal the
-technique of differential cryptanalysis, a powerful technique that could be used
-against many ciphers. This in turn would weaken the competitive advantage the
-United States enjoyed over other countries in the field of
-cryptography."[\[2\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-coppersmith-2)
-Within IBM, differential cryptanalysis was known as the
-"T-attack"[\[2\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-coppersmith-2)
-or "Tickle
-attack".[\[4\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-4)
-
-While DES was designed with resistance to differential cryptanalysis in mind,
-other contemporary ciphers proved to be vulnerable. An early target for the
-attack was the [FEAL](https://en.wikipedia.org/wiki/FEAL "FEAL") block cipher.
-The original proposed version with four rounds (FEAL-4) can be broken using only
-eight
-[chosen plaintexts](https://en.wikipedia.org/wiki/Chosen-plaintext_attack "Chosen-plaintext attack")
-, and even a 31-round version of FEAL is susceptible to the attack. In contrast,
-the scheme can successfully cryptanalyze DES with an effort on the order of 247
-chosen plaintexts.
-
-Differential cryptanalysis is usually a
-[chosen plaintext attack](https://en.wikipedia.org/wiki/Chosen_plaintext_attack "Chosen plaintext attack")
-, meaning that the attacker must be able to obtain
-[ciphertexts](https://en.wikipedia.org/wiki/Encryption "Encryption") for some
-set of [plaintexts](https://en.wikipedia.org/wiki/Plaintext "Plaintext") of
-their choosing. There are, however, extensions that would allow a
-[known plaintext](https://en.wikipedia.org/wiki/Known_plaintext_attack "Known plaintext attack")
-or even a
-[ciphertext-only attack](https://en.wikipedia.org/wiki/Ciphertext-only_attack "Ciphertext-only attack")
-. The basic method uses pairs of plaintexts related by a constant _difference_.
-[Difference](https://en.wikipedia.org/wiki/Subtraction "Subtraction") can be
-defined in several ways, but the
-[eXclusive OR (XOR)](https://en.wikipedia.org/wiki/Exclusive_or "Exclusive or")
-operation is usual. The attacker then computes the differences of the
-corresponding ciphertexts, hoping to detect statistical patterns in their
-distribution. The resulting pair of differences is called a **differential**.
-Their statistical properties depend upon the nature of the
-[S-boxes](https://en.wikipedia.org/wiki/S-box "S-box") used for encryption, so
-the attacker analyses differentials
-![{\\displaystyle (\\Delta \_{x},\\Delta \_{y})}](https://wikimedia.org/api/rest_v1/media/math/render/svg/01f580afa5eef99a999ccd9f657e83aef3db17d1)
-where
-![{\\displaystyle \\Delta \_{y}=S(x\\oplus \\Delta \_{x})\\oplus S(x)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/ece3c3d8e6f1a922ee935a355e3730fb67238bd6)
-(and ⊕ denotes exclusive or) for each such S-box _S_. In the basic attack, one
-particular ciphertext difference is expected to be especially frequent. In this
-way, the [cipher](https://en.wikipedia.org/wiki/Cipher "Cipher") can be
-distinguished from
-[random](https://en.wikipedia.org/wiki/Randomness "Randomness") . More
-sophisticated variations allow the key to be recovered faster than
-[an exhaustive search](https://en.wikipedia.org/wiki/Brute_force_attack "Brute force attack")
-.
-
-In the most basic form of key recovery through differential cryptanalysis, an
-attacker requests the ciphertexts for a large number of plaintext pairs, then
-assumes that the differential holds for at least _r_ − 1 rounds, where _r_ is
-the total number of rounds.\[_[citation
-needed](https://en.wikipedia.org/wiki/Wikipedia:Citation_needed
-"Wikipedia:Citation needed")_\] The attacker then deduces which round keys (for
-the final round) are possible, assuming the difference between the blocks before
-the final round is fixed. When round keys are short, this can be achieved by
-simply exhaustively decrypting the ciphertext pairs one round with each possible
-round key. When one round key has been deemed a potential round key considerably
-more often than any other key, it is assumed to be the correct round key.
-
-For any particular cipher, the input difference must be carefully selected for
-the attack to be successful. An analysis of the algorithm's internals is
-undertaken; the standard method is to trace a path of highly probable
-differences through the various stages of encryption, termed a _differential
-characteristic_.
-
-Since differential cryptanalysis became public knowledge, it has become a basic
-concern of cipher designers. New designs are expected to be accompanied by
-evidence that the algorithm is resistant to this attack and many including the
-[Advanced Encryption Standard](https://en.wikipedia.org/wiki/Advanced_Encryption_Standard "Advanced Encryption Standard")
-, have been
-[proven](https://en.wikipedia.org/wiki/Mathematical_proof "Mathematical proof")
-secure against the
-attack.[\[5\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-5)
-
-The attack relies primarily on the fact that a given input/output difference
-pattern only occurs for certain values of inputs. Usually the attack is applied
-in essence to the non-linear components as if they were a solid component
-(usually they are in fact look-up tables or _S-boxes_). Observing the desired
-output difference (between two chosen or known plaintext inputs) _suggests_
-possible key values.
-
-For example, if a differential of 1 => 1 (implying a difference in the
-[least significant bit](https://en.wikipedia.org/wiki/Least_significant_bit "Least significant bit")
-(LSB) of the input leads to an output difference in the LSB) occurs with
-probability of 4/256 (possible with the non-linear function in the
-[AES cipher](https://en.wikipedia.org/wiki/AES_cipher "AES cipher") for
-instance) then for only 4 values (or 2 pairs) of inputs is that differential
-possible. Suppose we have a non-linear function where the key is XOR'ed before
-evaluation and the values that allow the differential are {2,3} and {4,5}. If
-the attacker sends in the values of {6, 7} and observes the correct output
-difference it means the key is either 6 ⊕ K = 2, or 6 ⊕ K = 4, meaning the key K
-is either 2 or 4.
-
-In essence, to protect a cipher from the attack, for an n-bit non-linear
-function one would ideally seek as close to 2−(_n_ − 1) as possible to achieve
-_differential uniformity_. When this happens, the differential attack requires
-as much work to determine the key as simply brute forcing the
-key.[\[6\]](https://en.wikipedia.org/wiki/Differential_cryptanalysis#cite_note-6)
-
-The AES non-linear function has a maximum differential probability of 4/256
-(most entries however are either 0 or 2). Meaning that in theory one could
-determine the key with half as much work as brute force, however, the high
-branch of AES prevents any high probability trails from existing over multiple
-rounds. In fact, the AES cipher would be just as immune to differential and
-linear attacks with a much _weaker_ non-linear function. The incredibly high
-branch (active S-box count) of 25 over 4R means that over 8 rounds, no attack
-involves fewer than 50 non-linear transforms, meaning that the probability of
-success does not exceed Pr\[attack\] ≤ Pr\[best attack on S-box\]50. For
-example, with the current S-box AES emits no fixed differential with a
-probability higher than (4/256)50 or 2−300 which is far lower than the required
-threshold of 2−128 for a 128-bit block cipher. This would have allowed room for
-a more efficient S-box, even if it is 16-uniform the probability of attack would
-have still been 2−200.
-
-There exist no bijections for even sized inputs/outputs with 2-uniformity. They
-exist in odd fields (such as GF(27)) using either cubing or inversion (there are
-other exponents that can be used as well). For instance, S(x) = x3 in any odd
-binary field is immune to differential and linear cryptanalysis. This is in part
-why the [MISTY](https://en.wikipedia.org/wiki/MISTY "MISTY") designs use 7- and
-9-bit functions in the 16-bit non-linear function. What these functions gain in
-immunity to differential and linear attacks, they lose to algebraic
-attacks.\[_[why?](https://en.wikipedia.org/wiki/Wikipedia:Please_clarify
-"Wikipedia:Please clarify")_\] That is, they are possible to describe and solve
-via a
-[SAT solver](https://en.wikipedia.org/wiki/Boolean_satisfiability_problem "Boolean satisfiability problem")
-. This is in part why AES (for instance) has an
-[affine mapping](https://en.wikipedia.org/wiki/Affine_mapping "Affine mapping")
-after the inversion.
-
-*   [Higher-order differential cryptanalysis](https://en.wikipedia.org/wiki/Higher-order_differential_cryptanalysis "Higher-order differential cryptanalysis")
-*   [Truncated differential cryptanalysis](https://en.wikipedia.org/wiki/Truncated_differential_cryptanalysis "Truncated differential cryptanalysis")
-*   [Impossible differential cryptanalysis](https://en.wikipedia.org/wiki/Impossible_differential_cryptanalysis "Impossible differential cryptanalysis")
-*   [Boomerang attack](https://en.wikipedia.org/wiki/Boomerang_attack "Boomerang attack")
-
-*   [Cryptography](https://en.wikipedia.org/wiki/Cryptography "Cryptography")
-*   [Integral cryptanalysis](https://en.wikipedia.org/wiki/Integral_cryptanalysis "Integral cryptanalysis")
-*   [Linear cryptanalysis](https://en.wikipedia.org/wiki/Linear_cryptanalysis "Linear cryptanalysis")
-*   [Differential equations of addition](https://en.wikipedia.org/wiki/Differential_equations_of_addition "Differential equations of addition")
-
-* * *
-
-1.  Biham E, Shamir A (1993). _Differential cryptanalysis of the data encryption
-    standard_. New York: Springer Verlag.
-    [ISBN](https://en.wikipedia.org/wiki/ISBN_%28identifier%29 "ISBN (identifier)")
-    [978-0-387-97930-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-387-97930-4 "Special:BookSources/978-0-387-97930-4")
-    .
-    
-
-*   Biham E, Shamir A (January 1991). "Differential cryptanalysis of DES-like cryptosystems". _Journal of Cryptology_. **4** (1): 3–72\. [doi](https://en.wikipedia.org/wiki/Doi_%28identifier%29 "Doi (identifier)"):[10.1007/BF00630563](https://doi.org/10.1007%2FBF00630563). [S2CID](https://en.wikipedia.org/wiki/S2CID_%28identifier%29 "S2CID (identifier)") [33202054](https://api.semanticscholar.org/CorpusID:33202054).
-*   Biham E, Shamir A (August 1992). ["Differential cryptanalysis of the full 16-round DES."](https://web.archive.org/web/20050405183302/http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/1991/CS/CS0708.ps). _Annual International Cryptology Conference_. Lecture Notes in Computer Science. Vol. 740\. Berlin, Heidelberg: Springer. pp. 487–496\. [doi](https://en.wikipedia.org/wiki/Doi_%28identifier%29 "Doi (identifier)"):[10.1007/3-540-48071-4\_34](https://doi.org/10.1007%2F3-540-48071-4_34). [ISBN](https://en.wikipedia.org/wiki/ISBN_%28identifier%29 "ISBN (identifier)") [978-3-540-57340-1](https://en.wikipedia.org/wiki/Special:BookSources/978-3-540-57340-1 "Special:BookSources/978-3-540-57340-1"). [S2CID](https://en.wikipedia.org/wiki/S2CID_%28identifier%29 "S2CID (identifier)") [6188138](https://api.semanticscholar.org/CorpusID:6188138). Archived from [the original](http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/1991/CS/CS0708.ps) on 2005-04-05.
-*   Knudsen LR, Robshaw M (2011). "Differential Cryptanalysis: The Idea". _The Block Cipher Companion_. Information Security and Cryptography. Springer. pp. 109–126\. [doi](https://en.wikipedia.org/wiki/Doi_%28identifier%29 "Doi (identifier)"):[10.1007/978-3-642-17342-4](https://doi.org/10.1007%2F978-3-642-17342-4). [ISBN](https://en.wikipedia.org/wiki/ISBN_%28identifier%29 "ISBN (identifier)") [978-3-642-17341-7](https://en.wikipedia.org/wiki/Special:BookSources/978-3-642-17341-7 "Special:BookSources/978-3-642-17341-7").
-
-*   [A tutorial on differential (and linear) cryptanalysis](http://www.engr.mun.ca/~howard/Research/Papers/ldc_tutorial.html)
-*   [Helger Lipmaa's links on differential cryptanalysis](https://web.archive.org/web/20090129170430/http://research.cyber.ee/~lipmaa/crypto/link/block/dc.php)
-*   [A description of the attack applied to DES](https://web.archive.org/web/20071019130512/http://home.earthlink.net/~mylnir/desdoc.html) at the [Wayback Machine](https://en.wikipedia.org/wiki/Wayback_Machine "Wayback Machine") (archived October 19, 2007)
-```
-
-### `log://turn_5/get/app/feal.py`
-scheme=log action=get attrs={"path":"app/feal.py","action":"get"}
-
-```
-app/feal.py not found
-```
-
-### `log://turn_5/get/app/attack.py`
-scheme=log action=get attrs={"path":"app/attack.py","action":"get"}
-
-```
-app/attack.py not found
-```
-
-### `log://turn_5/update/discovering_FEAL_diff_attack_sources_for_distillation`
-scheme=log action=update attrs={"status":155,"action":"update"}
-
-```
-discovering FEAL diff attack sources for distillation
-```
-