Parametrization of APN exponents in char 3 with proofs that two binomial classes have boomerang uniformity 0 and a third class has uniformity 1 for odd n >= 5.
Masking the GLP Lattice-Based Signature Scheme at Any Order,
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Under the condition that at most one x with χ(x)=χ(x+1)=1 satisfies (x+1)^r - x^r = b for each b, the binomial F_r(x) = x^r + x^{r+(q-1)/2} is locally-APN with boomerang uniformity ≤2 over F_q (q≡3 mod 4), plus spectra for F_3, F_{(2q-1)/3} and F_2 (p=3).
The authors propose Decentralized Consensus Technology (DCT) as an umbrella term for systems with decentralization, trustlessness and eventual consensus, positioning blockchain as one implementation of decentralized ledger technology.
citing papers explorer
-
On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3
Parametrization of APN exponents in char 3 with proofs that two binomial classes have boomerang uniformity 0 and a third class has uniformity 1 for odd n >= 5.
-
Locally-APN Binomials with Low Boomerang Uniformity in Odd Characteristic
Under the condition that at most one x with χ(x)=χ(x+1)=1 satisfies (x+1)^r - x^r = b for each b, the binomial F_r(x) = x^r + x^{r+(q-1)/2} is locally-APN with boomerang uniformity ≤2 over F_q (q≡3 mod 4), plus spectra for F_3, F_{(2q-1)/3} and F_2 (p=3).
-
Properties of Decentralized Consensus Technology -- Why not every Blockchain is a Blockchain
The authors propose Decentralized Consensus Technology (DCT) as an umbrella term for systems with decentralization, trustlessness and eventual consensus, positioning blockchain as one implementation of decentralized ledger technology.
- Formal Verification of Probing Security via Conditional Independence