OpenLLM-France/wikimedia huggingface dataset:
# Dichotomous Key/Chiroptera

* Parent key: Mammalia
* Subclasses
* Marsupialia - Monotremata - Placentalia
* Key: Mammalia
* Orders
* Afrosoricida - Artiodactyla - Carnivora - Cetacea - Chiroptera - Dermoptera - Insectivora - Lagomorpha - Macroselidae - Marsupialia - Monotremata - Perissodactyla - Pholidota - Primates - Proboscidea - Rodentia - Scandentia - Sirenia - Xenarthra

## 1

* Claw on second toes of the forelimb
** Present - #2: Megachiroptera
** Not present - #3: Microchiroptera

## 3: Microchiroptera

* Tail length
** Long - Rhinopomatidae
** Short or absent - #4

## 4

* Shape of posterior tip of last caudal vertebrae
** T-shaped - Nycteridae
** Same as other vertebrae - #5

## 5

* Suction cups on wrists and ankles
** Present - #6
** Not present - #7

## 6

* Number of phalanges
** Two, united for most of their length - Myzopodidae
** Other - Thyropteridae

## 7

* Secondary fold on tragus
** Present - Mormoopidae
** Not present, or tragus not present - #8

## 8

* Tragus
** Divided - Megadermatidae
** Not divided, or not present - #9
# Dichotomous Key/Dermaptera
## 1

* Wings
** Present - 2
** Not present - 3

## 2: Forficulina

Forficulina (Common earwigs) -- This group includes several families and almost all species (about 2200 world wide) you will find.

## 3

* Shape of cerci
** Filiform - 4
** Rod-shaped - 5

## 4: Hemimerina

Only about 20 species living on hamster rats in sub-Saharan Africa. No chance to find elsewhere.

## 5: Arixenina

Few species, too, living on or close to bats in the Philippines and Borneo (Sarawak) region. No chance to find elsewhere.
# Dichotomous Key/Cnidaria

Dichotomous Key: Cnidaria :
* Kingdom: Animalia
* Phylum: Cnidaria
Information related to Cnidaria :
* Wikipedia
* Wikispecies
* Wikicommons
* Parent key: Animalia
* Phyla
* Cnidaria
* Key: Cnidaria
* Cnidaria
* {{{6}}}

## Key to Cnidaria

* Animalia keys
* Subkingdom
* Agnotozoa
* Phyla
* Acoelomorpha | Cnidaria | Ctenophora | Myxozoa | Orthonectida | Placozoa | Porifera | Rhombozoa
* Superphylum:Deuterostomia
* Chaetognatha | Chordata | Echinodermata | Hemichordata
* Superphylum:Ecdysozoa
* Arthropoda | Kinorhyncha | Loricifera | Nematoda | Nematomorpha | Onychophora | Priapulida | Tardigrada
* Superphylum:Lophotrochozoa
* Annelida | Brachiopoda | Ectoprocta | Entoprocta | Mollusca | Nemertea | Phoronida | Sipuncula
* Superphylum:Platyzoa
* Acanthocephala | Cycliophora | Gastrotricha | Gnathostomulida | Micrognathozoa | Platyhelminthes | Rotifera
* 1: Medusa stage present.
* 2: Medusa stage absent.

## 1: Medusozoa

incomplete

## 2

* 3: Parasitic
* 4: Non-parasitic. Corals and sea anemonies.

## 3

incomplete
* Polypodium hydriforme: Intracellular cnidarian parasite. Parasite of sturgeon eggs.
* Myxozoa

## 4

* Hexacorallia: Polyps have 6-fold symmetry
* Octocorallia: Polyps have 8-fold symmetry
# Dichotomous Key/Chordata

Dichotomous Key: Chordata :
* Kingdom: Animalia
* Phylum: Chordata
Information related to Chordata :
* Wikipedia
* Wikispecies
* Wikicommons
* Parent key: Animalia
* Phyla
* Acanthocephala - Acoelomorpha - Annelida - Arthropoda - Brachiopoda - Chaetognatha - Chordata - Cnidaria - Ctenophora - Cycliophora - Echinodermata - Ectoprocta - Entoprocta - Gastrotricha - Gnathostomulida - Hemichordata - Kinorhyncha - Lophotrochozoa - Loricifera - Micrognathozoa - Mollusca - Myxozoa - Nematoda - Nematomorpha - Nemertea - Onychophora - Orthonectida - Phoronida - Placozoa - Platyhelminthes - Porifera - Priapulida - Rhombozoa - Rotifera - Sipuncula - Tardigrada
* Key: Chordata
* Subphyla
* Cephalochordata - Myxini - Urochordata - Vertebrata

## 1

* Vertebrae
** Present - #4
** Not present - #2

## 2

* Feeding method
** Filter - Urochordata
** Jawless, sucking mouth - Myxini

## 3

* No options yet

## 4

* Jaw
** Present - #5
** Not present - Petromyzontidae

## 5

* Skeletal material
** Cartilage - Chondrichthyes
** Bone - #6

## 6

* Primary habitat (does not include secondary aquatic animals such as newts, aquatic snakes, whales, dolphins, ....)
** Aquatic - #10
** Terrestrial or amphibious - #7

## 7

* Metamorphosis (not within egg or womb)
** Present - Amphibia
** Not present - #8

## 8

* Scales
** Present - Reptilia
** Not present - #9

## 9

* Feathered wings
** Present - Aves
** Not present - Mammalia

## 10

* Fins
** Lobed - #11: Sarcopterygii
** Rayed - Actinopterygii

## 11: Sarcopterygii

* Ability to breathe air
** Present - Dipnoi
** Not present - Actinistia
# Dichotomous Key/Dicot

The color of the flower is yellow and white. It has a long stem without leaves. The leaf is denticulate.
# Dichotomous Key/Cetacea

* Parent key: Mammalia
* Subclasses
* Marsupialia - Monotremata - Placentalia
* Key: Mammalia
* Orders
* Afrosoricida - Artiodactyla - Carnivora - Cetacea - Chiroptera - Dermoptera - Insectivora - Lagomorpha - Macroselidae - Marsupialia - Monotremata - Perissodactyla - Pholidota - Primates - Proboscidea - Rodentia - Scandentia - Sirenia - Xenarthra

## 1

* Teeth present
** No, has baleen plates - #2: Mysticeti
** Yes - #6: Odontoceti

## 2: Mysticeti

* Series of longitudinal folds of skin running from below the mouth back to the navel
** Present - #4: Balaenopteridae
** Not present - #3
Glossary for this page (all links are to Wikipedia articles) :
* Baleen:
* Callositities:

## 3

* Gumline
** White - Caperea marginata
** Other color - #5

## 4: Balaenopteridae

* Hump on back
** Present - Humpback whale, Megaptera novaeangliae
** Not present - Balaenoptera

## 5

* Callositities
** Numerous - Eubalaena
** Few - Eschrichtius robustus
# Dichotomous Key/Coleoptera
## 1

* Notopleural sutures
** Present - #2 (Suborder: Adephaga)
** Not present - #3 (Suborder: Polyphaga)

## 2

* Coloration
** Ventrally metallic/iridescent; extremely large eyes and cursorial form- Cicindelidae
** Brown, black, or uniformly metallic (some are iridescent on elytra only) - Carabidae

## 3

* Toothed or scalloped edge on front tibia
** Present - Scarabaeidae
** Not present - #4

## 4

* Abdomen adapted to produce light
** Yes - Lampyridae
** No - #5

## 5

* Makes a clicking sound when escaping or flipping over
** Yes - Elateridae
** No - #6

## 6

* Antennae clubbed
** Yes - either Bostrichidae or Nitidulidae
** No - #7

## 7

* Head visible
** No, covered by pronotum - Coccinellidae
** Yes - #8

## 8

* Antennae arise from middle of snout
** Yes - Curculionidae
** No - #9

## 9

Could be Buprestidae, Cantharidae, Cerambycidae, Chrysomelidae, Scolytidae
# Dichotomous Key/Chondrichthyes

Dichotomous Key: Chondrichthyes :
* Kingdom: Animalia
* Phylum: Animalia
* Subphylum: Chordata
* Class: Chondrichthyes
Information related to Chondrichthyes :
* Wikipedia
* Wikispecies
* Wikicommons
* Parent key: Chordata
* Subphyla
* Vertebrata
* Key: Chondrichthyes
* Vertebrata
* Clerck, 1757
* Chordata keys
* Subphyla
* Myxini | Urochordata
* Classes
* Actinistia | Actinopterygii | Amphibia | Aves | Chondrichthyes | Dipnoi | Mammalia | Petromyzontida | Reptilia

## 1

* Scales
** Present - #2: Elasmobranchii
** Not present - Chimaeriformes

## 2: Elasmobranchii

* Open Gill position
** Ventrally - Rajomorphii
** Laterally - Selachimorpha
# Complex Analysis/Special functions

Definition (Gamma function):
The Gamma function is the unique function that is meromorphic on $\mathbb {C}$ and that is given by
    $\Gamma (z):=\int _{0}^{\infty }t^{z-1}e^{-t}dt$
whenever $\Re z>0$.
Proposition (Gamma function interpolates the factorial):
For $n\in \mathbb {N}$, we have
    $n!=\int _{0}^{\infty }t^{n}e^{-t}dt$.
Proof: We use induction on $n$. The base case is $n=1$, $\Box$
Proposition (existence and uniqueness of the Gamma function):
The integral
    $\int _{0}^{\infty }t^{z-1}e^{-t}dt$
converges whenever $\Re z>0$, and there exists a unique function $\Gamma$ which is meromorphic on $\mathbb {C}$ and satisfies
    $\Gamma (z):=\int _{0}^{\infty }t^{z-1}e^{-t}dt$
whenever $\Re z>0$.
Proof: First, note that the integral
    $\int _{0}^{\infty }t^{z-1}e^{-t}dt$
converges for $\Re z>0$, because we have the estimate
    ${\begin{aligned}\int _{0}^{\infty }|t^{z-1}e^{-t}|dt&=\int _{0}^{\infty }t^{\Re z-1}e^{-t}dt\\&=\int _{0}^{1}t^{\Re z-1}e^{-t}dt+\int _{1}^{\infty }t^{\Re z-1}e^{-t}dt\\&\leq \int _{0}^{1}t^{\Re z-1}dt+\int _{1}^{\infty }t^{k}e^{-t}dt,\end{aligned}}$
where $k\in \mathbb {N}$ is sufficiently large. The first integral evaluates to
    $\int _{0}^{1}t^{\Re z-1}dt=\left[{\frac {t^{\Re z}}{\Re z}}\right]_{0}^{1}={\frac {1}{\Re z}}$,
whereas the second integral is less than $k!$. $\Box$
# Complex Analysis/Residue Theory

Note: In mathematics, there is no field called "Residue Theory". There is only a "Calculus of Residues", belonging to the field of "Complex Analysis".
Residue Theory is fairly short, with only a few methods; and is basically a glorified way of saying, "Finding the coefficients when expanding fractions." Although this small subject blossoms into other areas of mathematics, particularly in simplifying integrals, and in analyzing singularities in limits, the real-number system, or the complex number system.
Knowing the following ideas is more-or-less required:
* Power/Taylor/Laurent Series
* Limits/Derivatives/Integrals
And for the more advanced techniques in sections 3 and 4:
* Complex Number Algebra
* Line Integrals in the complex plane
* Cauchy's Integral Formula

## Chapter 4: Residue Theory

* The Basics
* Partial Fractions
* A More "Complex" Solution
* Some Consequences
# Complex Analysis/Meromorphic functions and the Riemann sphere

Definition (singularity):
Let $U$ be an open subset of $\mathbb {C}$, let $z_{0}\in U$ and finally $f\in H(U\setminus \{z_{0}\})$. Suppose that $f$ is unbounded in every neighbourhood of $z_{0}$. Then (and only then) $z_{0}$ is called a singularity of $f$.
Definition (pole):
Let $U$ be an open subset of $\mathbb {C}$, let $z_{0}\in U$ and finally $f\in H(U\setminus \{z_{0}\})$. Suppose that $z_{0}$ is a singularity of $f$, but there exists an $n\in \mathbb {N}$ such that the function
    $U\ni z\mapsto (z-z_{0})^{n}f(z)$
is bounded in a neighbourhood of $z_{0}$ (whence by the Riemann removability theorem it may be holomorphically continued into the whole of $U$). Then (and only then) $z_{0}$ is called a pole of $f$.
Definition (order):
Let $U$ be an open subset of $\mathbb {C}$, let $z_{0}\in U$ and finally $f\in H(U\setminus \{z_{0}\})$. If $z_{0}$ is a pole of $f$, the natural number $n$ from the definition of a pole is called the order of the pole $z_{0}$.
Definition (essential singularity):
An essential singularity is a singularity which is not a pole.
Definition (meromorphic):
Let $U$ be an open subset of $\mathbb {C}$, let $E\subset U$ be discrete and let $f\in H(U\setminus E)$. We call $f$ a meromorphic function on $U$ if and only if at least one of the elements of $E$ is a pole of $f$ and all elements of $E$ are either poles or singularities of $f$.
Theorem (existence and uniqueness of the Laurent expansion in a punctuated ball):
Theorem (existence and uniqueness of the Laurent decomposition in a punctuated ball):
Theorem (existence and uniqueness of the Laurent decomposition in an open set):
Theorem (Marty's theorem):
A family of functions ${\mathcal {F}}:\mathbb {C} \to S^{2}$ is normal if and only if for every sequence $(f_{n})_{n\in \mathbb {N} }$ in ${\mathcal {F}}$, either the sequence $(f_{n})_{n\in \mathbb {N} }$ or the sequence $(1/f_{n})_{n\in \mathbb {N} }$ contains a subsequence that uniformly converges to a holomorphic function.
Proof: Suppose first that ${\mathcal {F}}$ is normal. Then there exists a constant $M>0$ such that
    $\forall f\in {\mathcal {F}}:\forall z\in \mathbb {C} :{\frac {|f'(z)|}{1+|f(z)|^{2}}}<M$.
Let then $(f_{n})_{n\in \mathbb {N} }$ be a sequence in ${\mathcal {F}}$. Then either $(|f_{n}'(z)|)_{n\in \mathbb {N} }$ is a bounded sequence, or there exists a subsequence $(f_{n_{k}})_{k\in \mathbb {N} }$ of $(f_{n})_{n\in \mathbb {N} }$ such that $\forall k\in \mathbb {N} :|f_{n_{k}}(z)|>C$ for a certain constant $C>0$. Since
    ${\frac {d}{dz}}\left({\frac {1}{f(z)}}\right)=-{\frac {f'(z)}{f(z)^{2}}}$, we have $\left|{\frac {d}{dz}}\left({\frac {1}{f(z)}}\right)\right|\leq \left({\frac {1}{C}}+1\right)M$,
we may infer from Montel's theorem that $(1/f_{n_{k}})_{k\in \mathbb {N} }$ is normal, whence it contains a convergent subsequence.
The opposite direction follows immediately from Montel's theorem and the symmetry of the spherical derivative. $\Box$
# Complex Analysis/Residue Theory/A More "Complex" Solution

There is a much more general, more lovely, all-pole encompassing formula for determining residues. We start off by examining the Laurent series of a function:
$f(z)=\sum _{n=-\infty }^{\infty }a_{n}(z-z_{0})^{n}$
And when examining the expansion we note that if we want the residue of the simple pole of a function, we want the coefficient $a_{-1}$. The second order pole, $a_{-2}$, and so on. In order to really see what's going on in the formula, it's best to look at the expansion:
$f(z)=...+{\frac {a_{-2}}{(z-z_{0})^{2}}}+{\frac {a_{-1}}{(z-z_{0})}}+a_{0}+a_{1}(z-z_{0})+a_{2}(z-z_{0})^{2}+...$
Say we want the residue of $z_{0}$ from a function with a 2nd-order pole about that point, we first multiply by $(z-z_{0})^{2}$:
$f(z)={\frac {a_{-2}}{(z-z_{0})^{2}}}+{\frac {a_{-1}}{(z-z_{0})}}+a_{0}+a_{1}(z-z_{0})+a_{2}(z-z_{0})^{2}+...$
$(z-z_{0})^{2}f(z)=a_{-2}+a_{-1}(z-z_{0})+...\,$
We now want to isolate the $a_{-1}$ term, so we take a derivative:
$g(z)={\frac {d}{dz}}((z-z_{0})^{2}f(z))=a_{-1}+...$
Now if we evaluate $g$ at $z_{0}$, the remaining terms will be zero, thus:
$g(z_{0})={\frac {d}{dz}}((z-z_{0})^{2}f(z))=a_{-1}$
gets us the residue, from repeating this same procedure the general formula can be obtained quite easily.

## The Residue Formula

$\mathrm {Res} (f,z_{0})=\lim _{z\rightarrow z_{0}}{\frac {1}{(m-1)!}}{\frac {d^{m-1}}{dz^{m-1}}}{\Big(z-z_{0})^{m}\cdot f(z){\Big )}$
Where $z_{0}$ is the point about which the residue is to be found, $f$ is the function.
There are some extra terms placed into this formula that weren't discussed above. The factorial eliminates the extra multiplied terms from the derivatives, and the limit deals with issues caused by a removable singularity.
# Complex Analysis/Residue Theory/Partial Fractions

This is probably the most basic technique, and doesn't require a lot of theory, mainly just algebraic manipulation. However, it does have its limitations, namely it really only works with polynomials. It is more of a cookbook method: here's the recipe, follow the steps.
Given two polynomial functions $P(z)$ and $Q(z)$, where the degree of Q is greater than the degree of P, we define another function to be the quotient of the two polynomials:
$f(z)={\frac {P(z)}{Q(z)}}$
And we note that if we factor Q we obtain:
$Q(z)=(z-z_{0})^{a_{0}}\cdot (z-z_{1})^{a_{1}}\cdot ...$
Then depending on the form of $(z-z_{0})^{a_{0}}$ we can reduce the function into a limited series of simple or m-th order poles as so:
$f(z)={\frac {P(z)}{Q(z)}}={\frac {A_{0}(x)(+B_{0})}{(z-z_{0})^{a_{0}}}}+{\frac {A_{0}(x)(+B_{0})}{(z-z_{0})^{a_{0}-1}}}+...+{\frac {A_{1}(x)(+B_{1})}{(z-z_{1})^{a_{1}}}}+{\frac {A_{1}(x)(+B_{1})}{(z-z_{1})^{a_{1}-1}}}+...$
And then the coefficients $A_{0},...,B_{0},...$ can be solved for and the function can be stated into an explicit form with readable residues.
Of course, this is taught a lot better by example and case.

## Case 1, simple one-order factors

We begin with the function:
$f(z)={\frac {1}{z^{2}+3z+2}}$
And note that it can be factored thusly:
$f(z)={\frac {1}{z^{2}+3z+2}}={\frac {1}{(z+1)(z+2)}}$
For this case the correct form we "guess" is like so:
${\frac {1}{(z+1)(z+2)}}={\frac {A_{0}}{z+1}}+{\frac {A_{1}}{z+2}}$
The remaining portion is by algebra, we multiply both sides by $(z+1)(z+2)$:
$1=A_{0}z+2A_{0}+A_{1}z+A_{1}$
Which gives us two equations:
$0=A_{0}z+A_{1}z$
$1=2A_{0}+A_{1}$
Thus:
$A_{0}=1$ and $A_{1}=-1$
And our function can be rewritten as:
$f(z)={\frac {1}{z+1}}-{\frac {1}{z+2}}$
The remainder of this section discusses suggests fractional forms that aid in separation, since the actual method and theory hold.

## The Other Two Cases

Case 1, Unfactorable Terms. In our generic expression, there is A(x)+B term, but really should include an additional polynomial for possible "unfactorable" terms (i.e., terms that can't be factored with only real numbers, although if the terms are factored correctly with imaginary numbers, the method works). To account for this the "guessed" fraction, include these extra terms. For example,
$f(z)={\frac {1}{(z^{2}+4)(z-1)}}={\frac {A_{0}x+B_{0}}{z^{2}+4}}+{\frac {A_{1}}{z-1}}$
With $A_{0}$, $B_{0}$, and $A_{1}$ to be solved.
Case 2, Term(s) Raised To A Power, The correct "guess" will include a trailing series of decreasing powers of the factor. For example,
$f(z)={\frac {1}{(z+1)^{2}(z-1)}}={\frac {A_{0}}{(z+1)^{2}}}+{\frac {A_{1}}{z+1}}+{\frac {A_{2}}{z-1}}$

## Remark

Again, partial fractioning only really works with polynomials, and can be a huge hassle for large denominators. The next section looks at a more general way of determining the residue.
# Cryptography/Unbroken is Not Necessarily Unbreakable

In cryptography, an unbroken algorithm is not necessarily an unbreakable one. There have been many cryptographic algorithms made and deployed in various situations throughout the world, some dating back from the time of Julius Caesar! More recent algorithms, AES Rijndael for example, are very strong, and have survived close scrutiny for many years and have remained secure. But, many other algorithms such as the Vigniere cipher were once believed to be totally unbreakable, but then all of a sudden, they may as well be written in plaintext. It was once thought that the simple XOR cipher could be the answer to an unbreakable algorithm, but new methods of cryptanalysis were born, and now, it can be cracked within moments.
Today's 'secure' ciphers such as AES and Twofish may be secure now, but in the future, with the advent of faster computers, better techniques and even quantum computing, these ciphers will only last so long.
# Cryptography/full-disk encryption

Most modern operating systems support full-disk encryption (FDE): a small boot area is left unencrypted (and never changes), containing the code to ask for a password and use that password to decrypt and run the rest of the operating system. The entire rest of the disk is always encrypted -- every write to the disk is intercepted by the operating system and encrypted, so everything written to the disk is encrypted.
Even if the entire computer is stolen, the data is useless without the password.
As of 2020, the latest FDE software running on modern server hardware is fast enough that the latency is indistinguishable from not using encryption at all.

### Even-Mansour block ciphers

Even-Mansour block ciphers are very simple: Given a block of data, these XOR a key with the block, apply a publicly-known permutation, then XOR a key again. Many cryptographers have studied this construction and some variants.
As of 2014, the de-facto standard disk encryption mode for full-disk encryption (FDE) is a specific variant called XEX-based tweaked-codebook mode with ciphertext stealing (XTS). It's good for full-disk encryption, but authenticated encryption has several advantages over XTS in almost any other application.
* ↑ Ignat Korchagin. "Speeding up Linux disk encryption". 2020.
* ↑ JP Aumasson. "Lazy crypto reloaded".
* ↑ "You Don't Want XTS". 2014.
# Cryptography/Substitution cipher

A Substitution Cipher is similar to a Caesar cipher, but instead of using a constant shift left or right, the plain alphabets and the cipher alphabets are mixed arbitrarily.
For example:
With the above, the Plain text "This is a sample" would encrypt to "Gsrh rh z hznkov." This particular substitution cipher, which relies on transposing all the letters in the alphabet such that the resulting alphabet is backwards, is known as an atbash cipher.
With Substitution Ciphers, the secret is in the mapping between the plain and cipher alphabets. However, there are several analytical techniques to help break these ciphers with only the ciphertext. See Frequency analysis

## Solving substitution ciphers

English-language ciphers be solved using principles such as these:
* Single-letter words are almost always A or I.
* As Edgar Allan Poe points out in The Gold Bug, "E predominates so remarkably that an individual sentence of any length is rarely seen, in which it is not the prevailing character."
* Apostrophes are generally followed by S, T, D, M, LL, or RE.
* Repeating letter patterns may be common letter groups such as TH, SH, RE, CH, TR, ING, ION, and ENT.
* Double letters are most likely to be LL, followed in frequency by EE, SS, OO, and TT (and on to less commonly seen doubles).
* Two-letter words almost always have one vowel and one consonant. The five most common two-letter words, in order of frequency, are OF, TO, IN, IS, and IT.
* The most common three-letter words, in order of frequency, are THE, AND, FOR, WAS, and HIS.
* The most common four-letter word is THAT. An encrypted word beginning and ending with the same letter is likely to be THAT. Others are AQUA, AREA, AURA, BARB, BLAB, BLOB, BOOB, BULB, CHIC, DEAD, deed, DIED, DYED, ease, edge, ELSE, FIEF, GANG, GONG, HASH, HATH, HUSH, KICK, LULL, MAIM, NEON, NOON, NOUN, ONTO, ORZO, PEEP, PIMP, PLOP, POMP, PREP, PROP, PULP, PUMP, REAR, ROAR, SAYS, SEAS, SEES, TACT, TART, TENT, TILT, TINT, TOOT, TORT, TUFT, URDU, and WHEW.

## See also

* w:etaoin shrdlu

## External links

* McClung, O. William: Substitution Cipher Cracker — a useful tool that will perform a frequency analysis on ciphertext.
* Cryptoquip: Crack a Substitution Cipher.
* American Cryptogram Association: Solve a Cipher.
* Olson, Edwin: Decrypto — a fast and automated cryptogram solver that can solve simple substitution ciphers often found in newspapers, including puzzles like cryptoquips and patristocrats.
* Ciphergram Solution Assistant — solves, or nearly solves, ciphergrams like those in the newspapers that are called cryptoquotes.
# Cryptography/Tiger
## Tiger hash

The Tiger hash processes data in 512-bit blocks and produces a 192-bit message digest. This hash was designed by Ross Anderson and Eli Biham (see http://www.cs.technion.ac.il/~biham/Reports/Tiger/), with the goal of producing a secure, fast hash function that performs especially well on next-generation 64-bit architectures, being still efficient on 32 and 16-bit architectures.

## Tiger tree hash

Tiger Tree cryptographic hash is calculated by applying the Tiger hash to 1024-byte blocks of a stream, then combining the interim values through a binary hash tree.
This implementation method is specially useful as a secure way to validate transfers, especially blocks of a file and prevent corruption in distributed systems.
# Culinary Arts
## Table of Contents

* Introduction
* The Kitchen Brigade
* Garde Manger
** Hors D’Oeuvere and Canapés
* Synergy
** Menus
** Formal Dining
** Buffet Presentation