scientific article; zbMATH DE number 1088902
From MaRDI portal
Publication:4365727
zbMath0909.94013MaRDI QIDQ4365727
S. Vaudenav, Claus Peter Schnorr
Publication date: 14 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (20)
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations ⋮ Complementary information set codes over \(\mathrm{GF}(p)\) ⋮ Necessary and sufficient conditions of two classes of permutation polynomials ⋮ Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications ⋮ Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\) ⋮ A general construction of regular complete permutation polynomials ⋮ Multipermutations on the Cartesian product of groups and their properties;Мультиподстановки на декартовом произведении групп и их свойства ⋮ Some results on complete permutation polynomials and mutually orthogonal Latin squares ⋮ All-or-nothing encryption and the package transform ⋮ CS-Cipher ⋮ Towards a general construction of recursive MDS diffusion layers ⋮ Group polynomials over rings ⋮ Permutation polynomials modulo \(2^w\) ⋮ CIS codes over ${\mathbb F}_4$ ⋮ Constructions of complete permutation polynomials ⋮ Provable Security against Impossible Differential Cryptanalysis Application to CS-Cipher ⋮ Полное описание одного класса MDS-матриц над конечным полем характеристики 2 ⋮ Incomplete character sums and a special class of permutations ⋮ Efficient recursive diffusion layers for block ciphers and hash functions ⋮ Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
This page was built for publication:
