Evaluation of the maximum performance of block encryption algorithms
From MaRDI portal
Recommendations
Cites work
- Extended generalized Feistel networks using matrix representation
- Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: <sc>Lilliput</sc>
- scientific article; zbMATH DE number 7301719 (Why is no real title available?)
- Improving the generalized Feistel
- Primitivity and local primitivity of digraphs and nonnegative matrices
Cited in
(5)- Estimating nonlinearity characteristics for iterative transformations of a vector space
- The difference relations and impossible differentials construction for the KB-256 algorithm
- On mixing properties of register transformations of ciphers TEA1 and TEA2
- On extending the class of impossible differencials for the KB-256 algorithm
- On the possibility of modifying the KB-256 algorithm from the searching for impossible differentials view point
This page was built for publication: Evaluation of the maximum performance of block encryption algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383082)