scientific article; zbMATH DE number 1930413
From MaRDI portal
Publication:4708767
Recommendations
Cited in
(18)- An application of permutatation arrays to block ciphers
- Cryptanalysis of a public key cryptosystem based on boolean permutations
- Constructions of cryptographically significant Boolean permutations
- A generation algorithm of a sort of P-permutations
- Functional circuits defining families of permutations of the space \(\mathrm{GF}(2)^n\)
- Accord advantage equivalent class of permutation and its properties
- Algorithm for strengthening some cryptographic systems
- On the Use of Interconnection Networks in Cryptography
- On Almost Perfect Nonlinear Permutations
- Public key cryptosystems based on boolean permutations and their applications
- Nonlinear permutations of a space over a finite field induced by linear transformations of a module over a Galois ring
- Cryptanalysis of an asymmetric cipher on Boolean functions
- Constructing 8-bit permutations, 8-bit involutions and 8-bit orthomorphisms with almost optimal cryptographic parameters
- On a mnemonic construction of permutations
- Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction
- Maximal complete permutations over \(\mathbb{F}_2^n \)
- S-blocks of a special type with a small number of variables
- Efficient construction of permutations of high nonlinearity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708767)