Fast Software Encryption
From MaRDI portal
Publication:5902477
DOI10.1007/B93938zbMath1254.94026OpenAlexW2505253445WikidataQ56387660 ScholiaQ56387660MaRDI QIDQ5902477
Publication date: 5 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b93938
Related Items (10)
Cryptanalysis of an involutional block cipher using cellular automata ⋮ Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE ⋮ A general construction of regular complete permutation polynomials ⋮ Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\) ⋮ Involutory differentially 4-uniform permutations from known constructions ⋮ Characterizations and constructions of triple-cycle permutations of the form \(x^rh(x^s)\) ⋮ Scalable PP-1 block cipher ⋮ Cryptanalysis of Feistel Networks with Secret Round Functions ⋮ Атака на $\mathrm{6}$ раундов Khazad ⋮ Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
This page was built for publication: Fast Software Encryption
