Analysis of a class of easily computable permutations

DOI10.1007/S10559-008-9033-9MaRDI QIDQ1008318zbMATH OpenOpenAlexFDO

Authors E. Ye. Zaitseva, V. G. Skobelev

Publication date 27 March 2009

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-008-9033-9

zbMATH Keywords

fractalstream cipherfinite ringeasily computable permutations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 2031132
• Permutations of finite fields with prescribed properties
• Pseudorandom permutation
• Encoding and classification of permutations by special conversion with estimates of class power
• scientific article; zbMATH DE number 1911491

Cites work

• scientific article; zbMATH DE number 3726249 (Why is no real title available?)
• Fractal based ciphers
• Nonlinear automata over a finite ring
• On the invertible matrices over the ring \(\mathbb Z_{p^k}\).

Cited in

(8)

• Encoding and classification of permutations by special conversion with estimates of class power
• scientific article; zbMATH DE number 2031132 (Why is no real title available?)
• Accord advantage equivalent class of permutation and its properties
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• Best permutation analysis
• scientific article; zbMATH DE number 7300422 (Why is no real title available?)
• An Analysis of Permutations in Arrays
• Fourier analysis of operations that preserve permutations

This page was built for publication: Analysis of a class of easily computable permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008318)