# Dead-end pages

The following pages do not link to other pages in Boolean Functions.

Showing below up to **29** results in range #**1** to #**29**.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

- --------------------------------
- APN Permutations
- APN functions obtained via polynomial expansion in small dimensions
- Algorithms for testing equivalence
- Bent Boolean Functions
- Books on Boolean Functions
- Boomerang uniformity
- CCZ-equivalence of Familes of APN Polynomials over GF(2^n) from table (for n is equal or larger than 6 and equal or smaller than 11)
- CCZ-equivalence of Families of APN Polynomials over GF(2^n) from the table (for n between 6 and 11)
- CCZ-inequivalent APN functions from the known APN classes over GF(2^n) (for n between 6 and 11) html
- Conferences related to Boolean Functions
- Differentially 4-uniform permutation
- Differentially 4-uniform permutations
- Known infinite families of APN power functions over GF(2^n)
- Known infinite families of APN power functions over GF(2^n) html
- Known infinite families of quadratic APN polynomials over GF(2^n)
- Known infinite families of quadratic APN polynomials over GF(2^n) html
- Known inifinte families of quadratic APN polynomials over GF(2^n)
- Lower bounds on APN-distance for all known APN functions in dimension 8
- Notation
- Papers on Boolean Functions
- People in Boolean Functions
- Plateaued Functions
- Polygon
- Projective plane
- Some APN functions CCZ-equivalent to ----- and CCZ-equivalent to the Gold functions over GF(2^n)
- Some APN functions CCZ-equivalent to Gold functions and EA-inequivalent to power functions over GF(2^n)
- Some APN functions CCZ-equivalent to gold functions and EA-inequivalent to power functions over GF(2^n)
- Some APN functions CCZ-equivalent to x^3 + tr n(x^9) and CCZ-inequivalent to the Gold functions over GF(2^n)