The following pages link to Fast Software Encryption (Q5902477):
Displaying 12 items.
- Involutory differentially 4-uniform permutations from known constructions (Q1755990) (← links)
- Characterizations and constructions of triple-cycle permutations of the form \(x^rh(x^s)\) (Q2004971) (← links)
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \) (Q2115736) (← links)
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE (Q2188966) (← links)
- Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\) (Q2238924) (← links)
- Cryptanalysis of an involutional block cipher using cellular automata (Q2380020) (← links)
- Cryptanalysis of Feistel Networks with Secret Round Functions (Q2807198) (← links)
- Атака на $\mathrm{6}$ раундов Khazad (Q3381819) (← links)
- Scalable PP-1 block cipher (Q3587072) (← links)
- A general construction of regular complete permutation polynomials (Q6109698) (← links)
- Nilpotent linearized polynomials over finite fields, revisited (Q6565501) (← links)
- A further study on the Ness-Helleseth function (Q6597204) (← links)
