Pages that link to "Item:Q2716513"
From MaRDI portal
The following pages link to An application of permutatation arrays to block ciphers (Q2716513):
Displaying 16 items.
- A bound on permutation codes (Q396801) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
- On the design of bit permutation based ciphers. The interplay among S-box, bit permutation and key-addition (Q1995501) (← links)
- Cryptanalysis of the permutation based algorithm SpoC (Q2152034) (← links)
- Using permutation rational functions to obtain permutation arrays with large Hamming distance (Q2153758) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- Doubly resolvable canonical Kirkman packing designs and its applications (Q2334086) (← links)
- Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\) (Q2352077) (← links)
- Variable bit permutations: linear characteristics and pure VBP-based cipher (Q2573401) (← links)
- Generation algorithm of a sort of P-permutations (Q3017388) (← links)
- (Q3563434) (← links)
- Optimizing Online Permutation-Based AE Schemes for Lightweight Applications (Q5056019) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric (Q6489327) (← links)
