Analysis of a class of easily computable permutations

DOI10.1007/s10559-008-9033-9zbMath1162.68441OpenAlexW1976810565MaRDI QIDQ1008318

E. Ye. Zaitseva, Volodymyr 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)

Related Items (1)

Unnamed Item

Cites Work

• Nonlinear automata over a finite ring
• Unnamed Item
• Unnamed Item
• Unnamed Item

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