Color Image Scrambling Technique Based on Transposition of Pixels between RGB Channels Using Knight’s Moving Rules and Digital Chaotic Map

Algorithm 1

Scrambling image 𝐼₀𝑖,𝑗,𝑘_{1≤𝑖≤𝑚1≤𝑗≤𝑚1≤𝑘≤3}.

Require:   Bits_A.txt and  Bits_B.txt          % files containing bitstreams generated by 𝑓_𝑇’s trajectories

Compute_KMR_and_RNS  (Bits_A, Bits_B, m, k)    % compute KMR and RNS matrices

for   𝑝= 1 : k

  for   𝑞= 1 : m

    for   𝑟= 1 : m

    Extract_features   KMR𝑖,𝑗,𝑘_{1≤𝑖≤𝑚1≤𝑗≤𝑚1≤𝑘≤3},RNS𝑖,𝑗,𝑘_{1≤𝑖≤𝑚1≤𝑗≤𝑚1≤𝑘≤3}

    𝐼^𝑎₀𝑖,𝑗,𝑘 =  Compute_limits_on_scrambling   𝐼₀𝑖,𝑗,𝑘_{1≤𝑖<𝑚1≤𝑗<𝑚},𝑅_𝑎,𝑛_𝑎

    𝐼^𝑏₀𝑖,𝑗,𝑘 =  Compute_limits_on_scrambling   𝐼^𝑎₀𝑖,𝑗,𝑘_{1≤𝑖<𝑚1≤𝑗<𝑚},𝑅_𝑏,𝑛_𝑏

    Transpose_pixel_color_values_on_scrambling   𝐼₀𝑖,𝑗,𝑘,𝐼^𝑎₀𝑖,𝑗,𝑘,𝐼^𝑏₀𝑖,𝑗,𝑘,𝑃_𝑦,𝑃_𝑧,𝑘

     end

   end

end