Cryptographically secure substitutions based on the approximation of mixing maps

DOI10.1109/TCSI.2004.841602MaRDI QIDQ4590353zbMATH OpenOpenAlexFDO

Authors T. Michalek, Ljupco Kocarev, Janusz Szczepański, José M. Amigó

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2004.841602

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25) Dynamical systems in control (37N35) Cryptography (94A60)

Cited in

(6)

• Lessons learnt from the cryptanalysis of chaos-based ciphers
• SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
• Cryptanalysis of Fridrich's chaotic image encryption
• Designing key-dependent chaotic S-box with larger key space
• Theory and practice of chaotic cryptography
• A chaos-based approach to the design of cryptographically secure substitutions

This page was built for publication: Cryptographically secure substitutions based on the approximation of mixing maps

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