摘要： 针对近年来兴起的数字图像信息安全问题，从二叉树的性质出发，提出了一种基于二叉树遍历的数字图像置乱方法，并讨论了该置乱方法的周期性及其逆变换。该方法简便易行，适用于任意大小的图像，且具有很好的置乱效果和极大的置乱周期。在一定的攻击下，置乱后的图像可以恢复原始图像，在一定程度上可以满足数字图像加密和隐藏的鲁棒性要求。

关键词: 二叉树遍历, 数字图象置乱, 信息隐藏

Abstract: Aiming at ensuring digital image information security, and starting from characters of binary tree, this paper proposes a novel method of digital image scrambling based on binary tree traversal, and its periodicity and inverse transformation are discussed. The approach is easy to realize for digital images of arbitrary size, and has a good result and a large periodicity of scrambling. Under some attacks, the original image can be reconstructed from scrambled image, so the algorithm satisfies the robustness requirement of image encryption and hiding to a certain extent.

Key words: Binary tree traversal, Digital image scrambling, Information hiding