US20110228927A1 - Cryptographic Method of Multilayer Diffusion in Multidimension - Google Patents

Abstract

The invention provides a diffusion function working on a multidimensional diffusion-area (plaintext/ciphertext), in which a multidimensional medium is meanwhile overlapped to the diffusion-area; accordingly, repeating the diffusion function for at least one time thus brings about the multilayer effect. FIG. 1 shows an embodiment of the present invention in flow chart diagram form, comprising of: inputting a plaintext in encryption or a ciphertext in decryption 100; inputting a series of password data forward in encryption or backward in decryption 200; further, by the password data, converting the dimensions of the plaintext 300, and implementing with a diffusion function, repeated T_E times in encryption, T_D times in decryption 400; outputting the ciphertext in encryption or the plaintext in decryption 600 if completing all password data 500.

Description

• The Applicant's following patent applications are related to the invention and are incorporated herein by reference: “Diffused Data Encryption/Decryption Processing Method”, application Ser. No. 12/365,160, filed Feb. 3, 2009 (CIP of application Ser. No. 10/963,014, filed Oct. 12, 2004); “Multipoint Synchronous Diffused Encryption/Decryption Method”, application Ser. No. 11/171,549, filed Jun. 30, 2005.
BACKGROUND OF THE INVENTION
• 1. Field of the Invention
• The invention relates to a cryptographic method. More particularly, the invention relates to a diffusion function working on a multidimensional diffusion-area (plaintext/ciphertext), and further, repeating the diffusion function for at least one time to create a multilayer effect in order to perform the encryption and the decryption.
• 2. Description of the Related Art
• The prior art described that the coding of a 2D diffusion-area, see application Ser. No. 12/365,160, page 7, teaches the math of A(i, j)=A⊕Ac_i⊕Ar_j⊕b(i, j); further expressed the status of diffusion from inward to outward or vice versa in reverse, and implemented to multidimensional matrix A(i₁, i₂, . . . i_n), see application Ser. No. 11/171,549, page 4, 7.
• The present invention emphasizes the multilayer effect of multidimensional diffusion. The diffusion function herein is notated specially by AF(p₁, p₂, . . . p_n) to differentiate from the traditional symbolization of matrix position.
SUMMARY OF THE INVENTION
• The invention provides a diffusion function working on a multidimensional diffusion-area (plaintext/ciphertext), in which a multidimensional medium is meanwhile overlapped to the diffusion-area; accordingly, repeating the diffusion function for at least one time thus brings about the multilayer effect. In addition, the numbers of repetition, a so called diffusion-cycle, is then able to divide into two parts: one for encrypting, the other for decrypting; consequently, the original status of the diffusion-area is recovered through the diffusion-cycle. The steps are shown as follows:
• • (a) Selecting a diffusion function, a multidimensional medium;
  • (b) Inputting a multidimensional diffusion-area (plaintext/ciphertext), for which the dimensions are the same as the medium's, and generating a diffusion-cycle;
  • (c) Repeating the diffusion function working on a plaintext for a first part of the diffusion-cycle to generate a ciphertext;
  • (d) Repeating the diffusion function working on the ciphertext for a second part of the diffusion-cycle to recover the plaintext.
BRIEF DESCRIPTION OF THE DRAWINGS
• FIG. 1 is a summary flow chart diagram showing the main steps taken while encrypting/decrypting by repeating diffusion function in accordance with the present invention;
• FIG. 2A is a summary flow chart diagram of FIG. 1, 410 showing the steps taken while originating the function of point-diffusion from a diffusion-center in accordance with the present invention;
• FIG. 2B is a two-dimension visualized diagram of FIG. 2A showing the point-diffusion by way of a medium anchoring to a diffusion-center in accordance with the present invention;
• FIG. 3A is a summarized flow chart diagram of FIG. 1, 420 showing the steps taken while originating the function of block-diffusion from a block diffusion-center in accordance with the present invention;
• FIG. 3B is a two-dimension visualized diagram of FIG. 3A showing the block-diffusion by way of a medium anchoring to a diffusion-center, a block anchoring to the diffusion-center to form a block diffusion-center in accordance with the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
• FIG. 1 shows an embodiment of the present invention in flow chart diagram form. This system comprises of: inputting a plaintext in encryption or a ciphertext in decryption 100; inputting a series of password data forward in encryption or backward in decryption 200; further, by the password data, converting the dimensions of the plaintext 300, and implementing with a function of diffusion, repeated T_E times in encryption, T_D times in decryption 400; outputting the ciphertext in encryption or the plaintext in decryption 600 if completing all password data 500.
Function of Point-Diffusion:
• FIG. 2A shows an embodiment of the point-diffusion function, FIG. 1, 410, in flow chart diagram. The function comprises of: reading a diffusion-area (plaintext/ciphertext), a diffusion-center, and a medium with an anchor-point 201; anchoring the medium to the diffusion-center with the anchor-point 411; implementing the point-diffusion AF(p₁, p₂, . . . p_n) 412, which is further detailed in Notation of Point-Diffusion. In addition, also see FIG. 2B with 2D visualization for a more clear view, the diffusion effect colored from white to black generates the column segments a-g, a-b for later diffusion calculation.
Notation of Point-Diffusion:
• A: a diffusion-area, wherein A expresses a d₁×d₂× . . . ×d_n binary matrix, wherein A includes a diffusion-center {dot over (P)} expressed (p₁, p₂, . . . p_n) coordinate position.
• S: a n-dimension medium, expresses a s₁×s₂× . . . ×s_n binary matrix, wherein S includes an anchor-point {dot over (S)} expressed (s₁, s₂, . . . , s_n) coordinate position.
• AF(p₁, p₂, . . . p_n): the diffusion-area A performs the function of point-diffusion at position {dot over (P)}, wherein S overlaps A by {dot over (S)} anchoring to {dot over (P)}; further comprising:
  •  AF(p₁, p₂, . . . , p_n)=A⊕Ad_1p⊕Ad_2p⊕ . . . ⊕Ad_np⊕S;
  •  Ad_ip=[A_{d i} (2), . . . , A_{d i} (p_i), A_{d i} (0), A_{d i} (p_i), . . . , A_{d i} (d_i−1)];
  • Ad_ip expresses a series of n−1 dimensional binary matrix A_{d i} the axis d_i. Furthermore, A_{d i} (p_i) represents the original A_{d i} the coordinate p_i, and then, A_{d i} (0) expresses a zero matrix filling at the coordinate p_i.
  • For example: 2D point-diffusion, with rows for x, columns for y, AF(p_x=3, p_y=2).
    • Suppose
• $A=\left[\begin{array}{cccc}{a}_{11}& a_{12}& a_{13}& a_{14}\\ a_{21}& a_{22}& a_{23}& a_{24}\\ a_{31}& a_{32}& a_{33}& a_{34}\\ a_{41}& a_{42}& a_{43}& a_{44}\end{array}\right],S=\left[\begin{array}{cccc}{s}_{11}& s_{12}& s_{13}& s_{14}\\ s_{21}& s_{22}& s_{23}& s_{24}\\ s_{31}& s_{32}& s_{33}& s_{34}\\ s_{41}& s_{42}& s_{43}& s_{44}\end{array}\right],\stackrel{.}{S}=\left(2,1\right)$ $\mathrm{thus}$ $\begin{array}{c}\mathrm{AF}\left(3,2\right)=A\oplus {\mathrm{Ax}}_3\oplus {\mathrm{Ay}}_2\oplus S\\ =A\oplus \left[\begin{array}{cccc}{a}_{21}& a_{22}& a_{23}& a_{24}\\ a_{31}& a_{32}& a_{33}& a_{34}\\ 0& 0& 0& 0\\ a_{31}& a_{32}& a_{33}& a_{34}\end{array}\right]\oplus \left[\begin{array}{cccc}{a}_{12}& 0& a_{12}& a_{13}\\ a_{22}& 0& a_{22}& a_{23}\\ a_{32}& 0& a_{32}& a_{33}\\ a_{42}& 0& a_{42}& a_{43}\end{array}\right]\oplus \\ \left[\begin{array}{cccc}0& 0& 0& 0\\ 0& s_{11}& s_{12}& s_{13}\\ 0& s_{21}& s_{22}& s_{23}\\ 0& s_{31}& s_{32}& s_{33}\end{array}\right]\end{array}$
• In detail, Ax₃ expresses a series of one dimensional binary matrixes A_x on the axis x; wherein Ax₃ comprises A_x (2)=[a₂₁ a₂₂ a₂₃ a₂₄] to position 1, A_x (3)=[a₃₁ a₃₂ a₃₃ a₃₄] to positions 2, 4, and A_x (0)=[0 0 0 0] at position 3. Furthermore, Ay₂ expresses a series of one dimensional binary matrixes A_y on the axis y; wherein Ay₂ comprises
• $A_y\left(2\right)=\left[\begin{array}{c}{a}_{12}\\ a_{22}\\ a_{32}\\ a_{42}\end{array}\right]$
• to positions 1, 3,
• $A_y\left(3\right)=\left[\begin{array}{c}{a}_{13}\\ a_{23}\\ a_{33}\\ a_{43}\end{array}\right]$
• to position 4, and
• $A_y\left(0\right)=\left[\begin{array}{c}0\\ 0\\ 0\\ 0\end{array}\right]$
• at position 2.
  Finally, the effective S comes from the overlap between S and A, while {dot over (S)}=(2,1) anchors to P=(3,2).
  For example: 3D point-diffusion AF(p_x=3, p_y=2, p_z=1). Suppose
• $A=\left[\stackrel{z=1}{\stackrel{}{\begin{array}{cccc}{a}_{111}& a_{121}& a_{131}& a_{141}\\ a_{211}& a_{221}& a_{231}& a_{241}\\ a_{311}& a_{321}& a_{331}& a_{341}\\ a_{411}& a_{421}& a_{431}& a_{441}\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{a}_{112}& a_{122}& a_{132}& a_{142}\\ a_{212}& a_{222}& a_{232}& a_{242}\\ a_{312}& a_{322}& a_{332}& a_{342}\\ a_{412}& a_{422}& a_{432}& a_{442}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{a}_{113}& a_{123}& a_{133}& a_{143}\\ a_{213}& a_{223}& a_{233}& a_{243}\\ a_{313}& a_{323}& a_{333}& a_{343}\\ a_{413}& a_{423}& a_{433}& a_{443}\end{array}}}\right],S=\left[\stackrel{z=1}{\stackrel{}{\begin{array}{cccc}{s}_{111}& s_{121}& s_{131}& s_{141}\\ s_{211}& s_{221}& s_{231}& s_{241}\\ s_{311}& s_{321}& s_{331}& s_{341}\\ s_{411}& s_{421}& s_{431}& s_{441}\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{s}_{112}& s_{122}& s_{132}& s_{142}\\ s_{212}& s_{222}& s_{232}& s_{242}\\ s_{312}& s_{322}& s_{332}& s_{342}\\ s_{412}& s_{422}& s_{432}& s_{442}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{s}_{113}& s_{123}& s_{133}& s_{143}\\ s_{213}& s_{223}& s_{233}& s_{243}\\ s_{313}& s_{323}& s_{333}& s_{343}\\ s_{413}& s_{423}& s_{433}& s_{443}\end{array}}}\right],\stackrel{.}{S}=\left(2,1,3\right);\mathrm{thus},\mathrm{AF}\left(3,2,1\right)=A\oplus {\mathrm{Ax}}_3\oplus {\mathrm{Ay}}_2\oplus {\mathrm{Az}}_1\oplus S=A\dots \oplus \left[\stackrel{z=1}{\stackrel{}{\begin{array}{cccc}{a}_{211}& a_{221}& a_{231}& a_{241}\\ a_{311}& a_{321}& a_{331}& a_{341}\\ 0& 0& 0& 0\\ a_{311}& a_{321}& a_{331}& a_{341}\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{a}_{212}& a_{222}& a_{232}& a_{242}\\ a_{312}& a_{322}& a_{332}& a_{342}\\ 0& 0& 0& 0\\ a_{312}& a_{322}& a_{332}& a_{342}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{a}_{213}& a_{223}& a_{233}& a_{243}\\ a_{313}& a_{323}& a_{333}& a_{343}\\ 0& 0& 0& 0\\ a_{313}& a_{323}& a_{333}& a_{343}\end{array}}}\right]\oplus \left[\stackrel{z=1}{\stackrel{}{\begin{array}{cccc}{a}_{121}& 0& a_{121}& a_{131}\\ a_{221}& 0& a_{221}& a_{231}\\ a_{321}& 0& a_{321}& a_{331}\\ a_{421}& 0& a_{421}& a_{431}\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{a}_{122}& 0& a_{122}& a_{132}\\ a_{222}& 0& a_{222}& a_{232}\\ a_{322}& 0& a_{322}& a_{332}\\ a_{422}& 0& a_{422}& a_{432}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{a}_{123}& 0& a_{123}& a_{133}\\ a_{223}& 0& a_{223}& a_{233}\\ a_{323}& 0& a_{323}& a_{333}\\ a_{423}& 0& a_{423}& a_{433}\end{array}}}\right]\oplus \left[\stackrel{z=1}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{a}_{111}& a_{121}& a_{131}& a_{141}\\ a_{211}& a_{221}& a_{231}& a_{241}\\ a_{311}& a_{321}& a_{331}& a_{341}\\ a_{411}& a_{421}& a_{431}& a_{441}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{a}_{112}& a_{122}& a_{132}& a_{142}\\ a_{212}& a_{222}& a_{232}& a_{242}\\ a_{312}& a_{322}& a_{332}& a_{342}\\ a_{412}& a_{422}& a_{432}& a_{442}\end{array}}}\right]\oplus \left[\stackrel{z=1}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\\ 0& s_{113}& s_{123}& s_{133}\\ 0& s_{213}& s_{223}& s_{233}\\ 0& s_{313}& s_{323}& s_{333}\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\end{array}}}\right].$
• In detail, Ax₃ expresses a series of two dimensional binary matrixes A_x on the axis x; wherein Ax₃ comprises
• $A_x\left(2\right)=\left[\stackrel{z=1}{\stackrel{}{\begin{array}{ccc}{a}_{211}& a_{221}& a_{231}\end{array}a_{241}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{a}_{212}& a_{222}& a_{232}& a_{242}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{a}_{213}& a_{223}& a_{233}& a_{243}\end{array}}}\right]$
• to position 1.
• $A_x\left(3\right)=\left[\stackrel{z=1}{\stackrel{}{\begin{array}{ccc}{a}_{311}& a_{321}& a_{331}\end{array}a_{341}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}{a}_{312}& a_{322}& a_{332}& a_{342}\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}{a}_{313}& a_{323}& a_{333}& a_{343}\end{array}}}\right]$
• to positions 2, 4, and
• $A_x\left(0\right)=\left[\stackrel{z=1}{\stackrel{}{\begin{array}{ccc}0& 0& \begin{array}{cc}0& 0\end{array}\end{array}}}\stackrel{z=2}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\end{array}}}\stackrel{z=3}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\end{array}}}\right]$
• at position 3.
  Furthermore, Ay₂ expresses a series of two dimensional binary matrixes A_y on the axis y; wherein Ay₂ comprises
• $A_y\left(2\right)=\left[\begin{array}{ccc}\stackrel{\stackrel{z=1}{}}{a_{121}}& \stackrel{\stackrel{z=2}{}}{a_{122}}& \stackrel{\stackrel{z=3}{}}{a_{123}}\\ a_{221}& a_{222}& a_{223}\\ a_{321}& a_{322}& a_{323}\\ a_{421}& a_{422}& a_{423}\end{array}\right]$
• to positions 1, 3,
• $A_y\left(3\right)=\left[\begin{array}{ccc}\stackrel{\stackrel{z=1}{}}{a_{131}}& \stackrel{\stackrel{z=2}{}}{a_{132}}& \stackrel{\stackrel{z=3}{}}{a_{133}}\\ a_{231}& a_{232}& a_{233}\\ a_{331}& a_{332}& a_{333}\\ a_{431}& a_{432}& a_{433}\end{array}\right]$
• to position 4, and
• $A_y\left(0\right)=\left[\begin{array}{ccc}\stackrel{\stackrel{z=1}{}}{0}& \stackrel{\stackrel{z=2}{}}{0}& \stackrel{\stackrel{z=3}{}}{0}\\ 0& 0& 0\\ 0& 0& 0\\ 0& 0& 0\end{array}\right]$
• at position 2.
  Moreover, Az₁ expresses a series of two dimensional binary matrixes A_z on the axis z; wherein Az₁ comprises
• $A_z\left(1\right)=\left[\begin{array}{cccc}{a}_{111}& a_{121}& a_{131}& a_{141}\\ a_{211}& a_{221}& a_{231}& a_{241}\\ a_{311}& a_{321}& a_{331}& a_{341}\\ a_{411}& a_{421}& a_{431}& a_{441}\end{array}\right]$
• to position 2,
• $A_z\left(2\right)=\left[\begin{array}{cccc}{a}_{112}& a_{122}& a_{132}& a_{142}\\ a_{212}& a_{222}& a_{232}& a_{242}\\ a_{312}& a_{322}& a_{332}& a_{342}\\ a_{412}& a_{422}& a_{432}& a_{442}\end{array}\right]$
• to position 3, and
• $A_z\left(0\right)=\left[\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\\ 0& 0& 0& 0\end{array}\right]$
• at position 1. Finally, the effective S comes from the overlap between S and A, while {dot over (S)}=(2,1,3) anchors to P=(3,2,1).
• AF(p₁, p₂ ^t, . . . , p_n): A performs the function of point-diffusion, repeated t times.
  • Example: (a) AF(p₁, p₂ ², . . . , p_n)=AF(p₁, p₂, . . . , p_n)F(p₁, p₂, . . . , p_n)
    • (b) AF(p₁, p₂ ¹, . . . , p_n)=AF(p₁, p₂, . . . , p_n)
    • (c) AF(p₁, p₂ ⁰, . . . , p_n)=A
• T: a diffusion-cycle, expresses AF(p₁, p₂ ^T, . . . , p_n)=A, wherein T=2^U+1, U=┌log₂ u┐, u=max(d₁, d₂, . . . , d_n).
Function of Block-Diffusion:
• FIG. 3A shows an embodiment of the block-diffusion function, FIG. 1, 420, in flow chart diagram. The function comprises of: reading a diffusion-area (plaintext/ciphertext), a diffusion-center, a medium with an anchor-point and a block with an anchor-point 202; anchoring the medium and the block to the diffusion-center with the anchor-point 421; implementing the block-diffusion ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n) 422, further detailed in Notation of Block-Diffusion. In addition, also see FIG. 3B with 2D visualization for a more clear view, the diffusion effect colored from white to black generates the block-column segments a-c, a-b for later diffusion calculation.
Notation of Block-Diffusion:
• A: a n-dimension plaintext, expresses a d₁×d₂× . . . ×d_n binary matrix, wherein A includes a diffusion-center P expressed (p₁, p₂, . . . p_n) coordinate position.
• S: a n-dimension medium, expresses a s₁×s₂× . . . ×s_n binary matrix, wherein S includes an anchor-point {dot over (S)} expressed ({dot over (s)}₁, {dot over (s)}₂, . . . , {dot over (s)}_n) coordinate position.
• B: a n-dimension unit-block, expresses a b₁×b₂× . . . ×b_n binary matrix, wherein B includes an anchor-point {dot over (B)} expressed ({dot over (b)}₁, {dot over (b)}₂, . . . , {dot over (b)}_n) coordinate position.
• ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n):  performs the function of block-diffusion, wherein  expresses A by B unit seeing that {dot over (B)} anchors to P, and thus, includes a block diffusion-center {circumflex over (P)} expressed ({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n) coordinate position. Therefore, A translates into a {circumflex over (d)}₁×{circumflex over (d)}₂× . . . ×{circumflex over (d)}_n binary matrix, wherein {circumflex over (d)}_i=┌(p_i−{dot over (b)}_i)/b_i┐+┌(d_i−p_i+{dot over (b)}_i┐, and {circumflex over (p)}_i=(p_i−{dot over (b)}_i)/b_i|+1; further comprising:
• $\hat{A}F\left({\hat{p}}_1,{\hat{p}}_2,\dots ,{\hat{p}}_n\right)=\hat{A}\oplus \hat{A}{\hat{d}}_{1\hat{p}}\oplus \hat{A}{\hat{d}}_{2\hat{p}}\oplus \dots \oplus \hat{A}{\hat{d}}_{n\hat{p}}\oplus S;$ $\hat{A}{\hat{d}}_{i\hat{p}}=\left[{\hat{A}}_{{\hat{d}}_i}\left(2\right),\dots ,{\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right),{\hat{A}}_{{\hat{d}}_i}\left(0\right),{\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right),\dots ,{\hat{A}}_{{\hat{d}}_i}\left({\hat{d}}_i-1\right)\right];$
• Â{circumflex over (d)}_{i{circumflex over (p)}} expresses a series of n−1 dimensional binary matrixes
• ${\hat{A}}_{{\hat{d}}_i}$
• on the axis {circumflex over (d)}_i. Furthermore,
• ${\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right)$
• represents the original
• ${\hat{A}}_{{\hat{d}}_i}$
• at the coordinate {circumflex over (p)}_i, and then,
• ${\hat{A}}_{{\hat{d}}_i}\left(0\right)$
• expresses a zero matrix tilling at the coordinate {circumflex over (p)}_i.
• • For example: 2D block-diffusion, with rows for x, columns for y, AF(p_x=3, p_y=2). Suppose
• $A=\left[\begin{array}{cccc}{a}_{11}& a_{12}& a_{13}& a_{14}\\ a_{21}& a_{22}& a_{23}& a_{24}\\ a_{31}& a_{32}& a_{33}& a_{34}\\ a_{41}& a_{42}& a_{43}& a_{44}\end{array}\right],S=\left[\begin{array}{cccc}{s}_{11}& s_{12}& s_{13}& s_{14}\\ s_{21}& s_{22}& s_{23}& s_{24}\\ s_{31}& s_{32}& s_{33}& s_{34}\\ s_{41}& s_{42}& s_{43}& s_{44}\end{array}\right],B=\left[\begin{array}{cc}{b}_{11}& b_{12}\\ b_{21}& b_{22}\end{array}\right],\stackrel{.}{S}=\left(2,1\right),\stackrel{.}{B}=\left(1,1\right);$
• thus, dimensions {circumflex over (x)}=┌(3−1)/2┐+┌(4−3+1)/2┐=2 and ŷ=┌(2−1)/2┐+┌(4−2+1)/2┐=3;
• 
• that shows the block-diffusion in 2×3 blocks, but with the data still kept in 4×4 bits. And now {circumflex over (p)}_x=┌(3−1)/2┐+1=2, {circumflex over (p)}_y=┌(2−1)/2┐+1=2, thus
• 
• In detail, Â{circumflex over (x)}₂ expresses a series of one dimensional binary matrixes Â_{{circumflex over (x)}} on the axis {circumflex over (x)}; wherein Â{circumflex over (x)}₂ comprises
• ${\hat{A}}_{\hat{x}}\left(2\right)=\left[\begin{array}{cccc}{a}_{31}& a_{32}& a_{33}& a_{34}\\ a_{41}& a_{42}& a_{43}& a_{44}\end{array}\right]$
• to position 1, and
• ${\hat{A}}_{\hat{x}}\left(0\right)=\left[\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 0& 0\end{array}\right]$
• at position 2. Furthermore, Âŷ₂ expresses a series of one dimensional binary matrixes Â_ŷ on the axis ŷ; wherein Âŷ₂ comprises
• ${\hat{A}}_{\hat{y}}\left(2\right)=\left[\begin{array}{cc}{a}_{12}& a_{13}\\ a_{22}& a_{23}\\ a_{32}& a_{33}\\ a_{42}& a_{43}\end{array}\right]$
• to positions 1, 3, and
• ${\hat{A}}_{\hat{y}}\left(0\right)=\left[\begin{array}{cc}0& 0\\ 0& 0\\ 0& 0\\ 0& 0\end{array}\right]$
• at position 2. Finally, the effective S comes from the overlap between S and A, while {dot over (S)}=(2,1) anchors to P=(3,2).
• • For example: 3D block-diffusion AF(p_x=3, p_y=2, p_z=1). Suppose
• $A=\left[\stackrel{\stackrel{z=1}{}}{\begin{array}{cccc}{a}_{111}& a_{121}& a_{131}& a_{141}\\ a_{211}& a_{221}& a_{231}& a_{241}\\ a_{311}& a_{321}& a_{331}& a_{341}\\ a_{411}& a_{421}& a_{431}& a_{441}\end{array}}\stackrel{\stackrel{z=2}{}}{\begin{array}{cccc}{a}_{112}& a_{122}& a_{132}& a_{142}\\ a_{212}& a_{222}& a_{232}& a_{242}\\ a_{312}& a_{322}& a_{332}& a_{342}\\ a_{412}& a_{422}& a_{432}& a_{442}\end{array}}\stackrel{\stackrel{z=3}{}}{\begin{array}{cccc}{a}_{113}& a_{123}& a_{133}& a_{143}\\ a_{213}& a_{223}& a_{233}& a_{243}\\ a_{313}& a_{323}& a_{333}& a_{343}\\ a_{413}& a_{423}& a_{433}& a_{443}\end{array}}\right],S=\left[\stackrel{\stackrel{z=1}{}}{\begin{array}{cccc}{s}_{111}& s_{121}& s_{131}& s_{141}\\ s_{211}& s_{221}& s_{231}& s_{241}\\ s_{311}& s_{321}& s_{331}& s_{341}\\ s_{411}& s_{421}& s_{431}& s_{441}\end{array}}\stackrel{\stackrel{z=2}{}}{\begin{array}{cccc}{s}_{112}& s_{122}& s_{132}& s_{142}\\ s_{212}& s_{222}& s_{232}& s_{242}\\ s_{312}& s_{322}& s_{332}& s_{342}\\ s_{412}& s_{422}& s_{432}& s_{442}\end{array}}\stackrel{\stackrel{z=3}{}}{\begin{array}{cccc}{s}_{113}& s_{123}& s_{133}& s_{143}\\ s_{213}& s_{223}& s_{233}& s_{243}\\ s_{313}& s_{323}& s_{333}& s_{343}\\ s_{413}& s_{423}& s_{433}& s_{443}\end{array}}\right],\text{}B=\left[\stackrel{\stackrel{z=1}{}}{\begin{array}{cc}{b}_{111}& b_{121}\\ b_{211}& b_{221}\end{array}}|\stackrel{\stackrel{z=2}{}}{\begin{array}{cc}{b}_{112}& b_{122}\\ b_{212}& b_{222}\end{array}}\right],\stackrel{.}{S}=\left(2,1,3\right),\stackrel{.}{B}=\left(1,1,1\right);$
• thus, dimensions {circumflex over (x)}=┌(3−1)/2┐+┌(4−3+1)/2┐=2, ŷ=┌(2−1)/2┐+┌(4−2+1)/2┐=3, and {circumflex over (z)}=┌(1−1)/2┐+┌(4−1+1)/2┐=2; further
• 
• • that shows the block-diffusion in 2×3×2 blocks, but with the data still kept in 4×4×3 bits. And now {circumflex over (p)}_x=┌(3−1)/2┐+1=2, {circumflex over (p)}_y=┌(2−1)/2┐+1=2, {circumflex over (p)}_z=┌(1−1)/2┐+1=1, thus,
• 
• In detail, Â{circumflex over (x)}₂ expresses a series of two dimensional binary matrixes Â_{{circumflex over (x)}} on the axis {circumflex over (x)}; wherein Â{circumflex over (x)}₂ comprises
• ${\hat{A}}_{\hat{x}}\left(2\right)=\left[\stackrel{\hat{z}=1}{\stackrel{}{\begin{array}{cccccccc}{a}_{311}& a_{321}& a_{331}& a_{341}& a_{312}& a_{322}& a_{332}& a_{342}\\ a_{411}& a_{421}& a_{431}& a_{441}& a_{412}& a_{422}& a_{432}& a_{442}\end{array}}}\stackrel{\hat{z}=2}{\stackrel{}{\begin{array}{cccc}{a}_{313}& a_{323}& a_{333}& a_{343}\\ a_{413}& a_{423}& a_{433}& a_{443}\end{array}}}\right]$
• to position 1, and
• ${\hat{A}}_{\hat{x}}\left(0\right)=\left[\stackrel{\hat{z}=1}{\stackrel{}{\begin{array}{cccccccc}0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\end{array}}}\stackrel{\hat{z}=2}{\stackrel{}{\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 0& 0\end{array}}}\right]$
• at position 2.
  Furthermore, Âŷ₂ expresses a series of two dimensional binary matrixes Âŷ on the axis ŷ; wherein Âŷ₂ comprises Âŷ(2) to positions 1, 3 is equal to
• $\left[\stackrel{\stackrel{\hat{z}=1}{}}{\begin{array}{cc}{a}_{121}& a_{131}\\ a_{221}& a_{231}\\ a_{321}& a_{331}\\ a_{421}& a_{431}\end{array}\begin{array}{cc}{a}_{122}& a_{132}\\ a_{222}& a_{232}\\ a_{322}& a_{332}\\ a_{422}& a_{432}\end{array}}\stackrel{\stackrel{\hat{z}=2}{}}{\begin{array}{cc}{a}_{123}& a_{133}\\ a_{223}& a_{233}\\ a_{323}& a_{333}\\ a_{423}& a_{433}\end{array}}\right],\mathrm{and}$ ${\hat{A}}_{\hat{y}}\left(0\right)=\left[\stackrel{\stackrel{\hat{z}=1}{}}{\begin{array}{cc}0& 0\\ 0& 0\\ 0& 0\\ 0& 0\end{array}\begin{array}{cc}0& 0\\ 0& 0\\ 0& 0\\ 0& 0\end{array}}\stackrel{\stackrel{\hat{z}=2}{}}{\begin{array}{cc}0& 0\\ 0& 0\\ 0& 0\\ 0& 0\end{array}}\right]\mathrm{and}$
• at position 2.
  Moreover, Â{circumflex over (z)}₁ expresses a series of two dimensional binary matrixes Â{circumflex over (z)} on the axis {circumflex over (z)}; wherein Â{circumflex over (z)}₁ comprises
• ${\hat{A}}_{\hat{z}}\left(1\right)=\left[\stackrel{\hat{z}=1}{\stackrel{}{\begin{array}{cccc}{a}_{111}& a_{121}& a_{131}& a_{141}\\ a_{211}& a_{221}& a_{231}& a_{241}\\ a_{311}& a_{321}& a_{331}& a_{341}\\ a_{411}& a_{421}& a_{431}& a_{441}\end{array}}}\right]$
• to position
• ${\hat{A}}_{\hat{z}}\left(0\right)=\left[\begin{array}{cccccccc}0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\end{array}\right]$
• at position 1. Finally, the effective S comes from the overlap between S and A, while {dot over (S)}=(2,1,3) anchors to P=(3,2,1).
• ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {dot over (p)}_n): Â performs the function of block-diffusion, repeated t times.
  • Example: (a) ÂF({circumflex over (p)}₁, {circumflex over (p)}₂ ², . . . , {circumflex over (p)}_n)=ÂF({circumflex over (p)}_i, {circumflex over (p)}₂, . . . , {dot over (p)}_n)F({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n)
    • (b) {dot over (A)}F({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {circumflex over (p)}_n)=ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {circumflex over (p)}_n)
    • (c) ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {circumflex over (p)}_n)=A
• T: a diffusion-cycle, expresses {dot over (A)}F({circumflex over (p)}₁, {circumflex over (p)}₂ ^T, . . . {dot over (p)}_n)=A, wherein T=2^U+1, U=┌log₂ u┌, u=max(┌d_i/b_i┐, 1≦i≦n).
Embodiment of Cryptographic Method
• To make it easier to understand the content of the present invention, examples in detail are described as follows:
• Suppose a plaintext A: “smoother”, its ASCII code is 73 6d 6f 6f 74 68 65 72, the binary format is shown as an 8×8 two-dimensional matrix as in Table 1-1.

• TABLE 1-1
  ASCII

  73	6d	6f	6f	74	68	65	72
  1	1	1	1	0	0	1	0
  1	0	1	1	0	0	0	1
  0	1	1	1	1	0	1	0
  0	1	1	1	0	1	0	0
  1	0	0	0	1	0	0	1
  1	1	1	1	1	1	1	1
  1	1	1	1	1	1	1	1
  0	0	0	0	0	0	0	0

• Suppose a password: “Yourlips”, its ASCII code is 59 6f 75 72 6c 69 70 73. For applying to the plaintext, the ASCII code: first, excludes the last digit 3; second, forms into octal format 26 26 75.65 34 46 61 51 34 07; third, adds 1 to each digit; Table 1-2 shows that the password includes 10 diffusion-centers.

• TABLE 1-2
  	ASCII

  	26	26	75	65	34	46	61	51	34	07
  Row	3	3	8	7	4	5	7	6	4	1
  Column	7	7	6	6	5	7	2	2	5	8

Example 1 The Function of Point-Diffusion in 2D
• Supposes
• $S_{5\times 5}=\left[\begin{array}{c}10011\\ 01101\\ 10111\\ 10010\\ 11101\end{array}\right],\stackrel{.}{S}=\left(1,1\right);$
• reads every diffusion-center in order, if from 1 to 10 on encryption, then from 10 back to 1 on decryption; counts the diffusion-cycle T=2³⁺¹=16, if 1 time on encryption, then 15 times on decryption. In math, inputs the plaintext A, then runs A¹, A₁ ¹, . . . A₉ ¹ and outputs A₁, A₂, . . . A₁₀ during encryption; inputs the ciphertext A₁₀, then runs A₁₀ ¹⁵, A₉ ¹⁵, . . . A₁ ¹⁵ and outputs A₉, . . . , A₁, A during decryption. The details on the order 1, 5, 10 are shown as below, A_{d i} (0) marked in boldface.
Encryption at the 1^st Diffusion-Center (3,7):
• $\begin{array}{c}{A}^1=\mathrm{AF}\left(3,7\right)\\ =A\oplus {\mathrm{Ax}}_3\oplus {\mathrm{Ay}}_7\oplus S\\ =\left[\begin{array}{c}11110010\\ 10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}10110001\\ 01111010\\ 00000000\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\end{array}\right]\oplus \left[\begin{array}{c}11100101\\ 01100000\\ 11110101\\ 11101000\\ 00010000\\ 11111101\\ 11111101\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000010\\ 00000001\\ 00000010\\ 00000010\\ 00000011\\ 00000000\end{array}\right]\\ =[\begin{array}{c}10100110\\ 10101011\\ 10001101\\ 11100111\\ 11101111\\ 10001001\\ 11111110\\ 11111111\end{array}]={\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="US20110228927A1-20110922-D00003.png"\; state="\{\{state\}\}">A</figure-callout>}}_1.\end{array}$
Encryption at the 5^th Diffusion-Center (4,5):
• $\begin{array}{c}{A}_4^1=A_4F\left(4,5\right)\\ =A_4\oplus A_4x_4\oplus A_4y_5\oplus S\\ =\left[\begin{array}{c}11010111\\ 00010101\\ 00010001\\ 01000011\\ 00001111\\ 01011001\\ 10101011\\ 01100101\end{array}\right]\oplus \left[\begin{array}{c}00010101\\ 00010001\\ 01000011\\ 00000000\\ 01000011\\ 00001111\\ 01011001\\ 10101011\end{array}\right]\oplus \left[\begin{array}{c}10100011\\ 00100010\\ 00100000\\ 10000001\\ 00010111\\ 10110100\\ 01010101\\ 11000010\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00001001\\ 00000110\\ 00001011\\ 00001001\\ 00001110\end{array}\right]\\ =\left[\begin{array}{c}01100001\\ 00100110\\ 01110010\\ 11001011\\ 01011101\\ 11101001\\ 10101110\\ 00000010\end{array}\right]=A_5.\end{array}$
• Encryption at the 10^th Diffusion-Center (1,8):
• $\begin{array}{c}{A}_9^1=A_9F\left(1,8\right)=A_9\oplus A_9x_1\oplus A_9y_8\oplus S\\ =\left[\begin{array}{c}01110011\\ 10000110\\ 10011100\\ 10101100\\ 01000101\\ 10001011\\ 00110101\\ 10101001\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 01110011\\ 10000110\\ 10011100\\ 10101100\\ 01000101\\ 10001011\\ 00110101\end{array}\right]\oplus \left[\begin{array}{c}11100110\\ 00001100\\ 00111000\\ 01011000\\ 10001010\\ 00010110\\ 01101010\\ 01010010\end{array}\right]\oplus \left[\begin{array}{c}00000001\\ 00000000\\ 00000001\\ 00000001\\ 00000001\\ 00000000\\ 00000000\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}10010100\\ 11111001\\ 00100011\\ 01101001\\ 01100010\\ 11011000\\ 11010100\\ 11001110\end{array}\right]=A_{10}.\end{array}$
• Decryption at the 10^th Diffusion-Center (1,8):
• $\begin{array}{c}{A}_{10}^{15}=A_{10}^{14}F\left(1,8\right)=A_{10}^{14}\oplus A_{10}^{14}x_1\oplus A_{10}^{14}y_8\oplus S\\ =\left[\begin{array}{c}00101110\\ 10011000\\ 00000011\\ 10011010\\ 01001010\\ 10111111\\ 10000110\\ 11100101\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00101110\\ 10011000\\ 00000011\\ 10011010\\ 01001010\\ 10111111\\ 10000110\end{array}\right]\oplus \left[\begin{array}{c}01011100\\ 00110000\\ 00000110\\ 00110100\\ 10010100\\ 01111110\\ 00001100\\ 11001010\end{array}\right]\oplus \left[\begin{array}{c}00000001\\ 00000000\\ 00000001\\ 00000001\\ 00000001\\ 00000000\\ 00000000\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}01110011\\ 10000110\\ 10011100\\ 10101100\\ 01000101\\ 10001011\\ 00110101\\ 10101001\end{array}\right]=A_9.\end{array}$
• Decryption at the 5^th Diffusion-Center (4,5):
• $\begin{array}{c}{A}_5^{15}=A_5^{14}F\left(4,5\right)=A_5^{14}\oplus A_5^{14}x_4\oplus A_5^{14}y_5\oplus S\\ =\left[\begin{array}{c}00011010\\ 11111000\\ 00011001\\ 00111100\\ 00010110\\ 11000111\\ 00100110\\ 00111001\end{array}\right]\oplus \left[\begin{array}{c}11111000\\ 00011001\\ 00111100\\ 00000000\\ 00111100\\ 00010110\\ 11000111\\ 00100110\end{array}\right]\oplus \left[\begin{array}{c}00110101\\ 11110100\\ 00110100\\ 01110110\\ 00100011\\ 10000011\\ 01000011\\ 01110100\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00001001\\ 00000110\\ 00001011\\ 00001001\\ 00001110\end{array}\right]\\ =\left[\begin{array}{c}11010111\\ 00010101\\ 00010001\\ 01000011\\ 00001111\\ 01011001\\ 10101011\\ 01100101\end{array}\right]=A_4.\end{array}$
• Decryption at the 1^st Diffusion-Center (3,7):
• $\begin{array}{c}{A}_1^{15}=A_1^{14}F\left(3,7\right)=A_1^{14}\oplus A_1^{14}x_3\oplus A_1^{14}y_7\oplus S\\ =\left[\begin{array}{c}11010110\\ 10001001\\ 00101000\\ 00110101\\ 01101011\\ 01110011\\ 01111010\\ 11010111\end{array}\right]\oplus \left[\begin{array}{c}10001001\\ 00101000\\ 00000000\\ 00101000\\ 00110101\\ 01101011\\ 01110011\\ 01111010\end{array}\right]\oplus \left[\begin{array}{c}10101101\\ 00010000\\ 01010000\\ 01101000\\ 11010101\\ 11100101\\ 11110101\\ 10101101\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000010\\ 00000001\\ 00000010\\ 00000010\\ 00000011\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}11110010\\ 10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\\ 00000000\end{array}\right]=A.\end{array}$
Example 2 The Function of Block-Diffusion in 2D
• Supposes that
• $S_{5\times 5}=\left[\begin{array}{c}10011\\ 01101\\ 10111\\ 10010\\ 11101\end{array}\right],\stackrel{.}{S}=\left(1,1\right),B_{2\times 2}=\left[\begin{array}{cc}{b}_{11}& b_{12}\\ b_{21}& b_{22}\end{array}\right],\stackrel{.}{B}=\left(1,1\right);$
• reads
  every diffusion-center in order, if from 1 to 10 on encryption, then from 10 back to 1 on decryption; counts the diffusion-cycle T=2²⁺¹=8, since d_i/b_i=4=2², and if 1 time on encryption, then 7 times on decryption. In math, inputs the plaintext A, then runs ¹, Â₁ ¹, . . . Â₉ ¹, and outputs A₁, A₂, . . . A₁₀ during encryption; inputs the ciphertext A₁₀, then runs Â₁₀ ⁷, Â₉ ⁷, . . . Â₁ ⁷ and outputs A₉, . . . , A₁, A during decryption. The details on the order 1, 5, 10 are shown as below,
• ${\hat{A}}_{{\hat{d}}_i}\left(0\right)$
• marked in boldface.
Encryption at the 1^st Diffusion-Center (3,7):
• $\begin{array}{c}{\hat{A}}^1=\hat{A}F\left(2,4\right)=\\ =\hat{A}\oplus \hat{A}{\hat{x}}_2\oplus \hat{A}{\hat{y}}_4\oplus S(\because {\hat{p}}_x=\lceil \left(3-1\right)/2\rceil +1,{\hat{p}}_y\\ =\lceil \left(7-1\right)/2\rceil +1)\\ =\left[\begin{array}{c}11110010\\ 10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}01111010\\ 01110100\\ 00000000\\ 00000000\\ 01111010\\ 01110100\\ 10001001\\ 11111111\end{array}\right]\oplus \left[\begin{array}{c}11001000\\ 11000100\\ 11101000\\ 11010000\\ 00100100\\ 11111100\\ 11111100\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000010\\ 00000001\\ 00000010\\ 00000010\\ 00000011\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}01000000\\ 00000001\\ 10010000\\ 10100101\\ 11010101\\ 01110101\\ 10001001\\ 11111111\end{array}\right]={\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="US20110228927A1-20110922-D00003.png"\; state="\{\{state\}\}">A</figure-callout>}}_1.\end{array}$
Encryption at the 5^th Diffusion-Center (4,5):
• $\begin{array}{c}{\hat{A}}_4^1={\hat{A}}_4F\left(3,3\right)\\ ={\hat{A}}_4\oplus {\hat{A}}_4{\hat{x}}_3\oplus {\hat{A}}_4{\hat{y}}_3\oplus S\left(\because {\hat{p}}_x=\lceil \left(4-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(5-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}11000011\\ 10100110\\ 10001001\\ 01000110\\ 00110011\\ 01100010\\ 11011111\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}10001001\\ 01000110\\ 00110011\\ 00000000\\ 00000000\\ 01000110\\ 00110011\\ 01100010\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 10010001\\ 00100010\\ 00010001\\ 11000000\\ 10000000\\ 01110011\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00001001\\ 00000110\\ 00001011\\ 00001001\\ 00001110\end{array}\right]\\ =\left[\begin{array}{c}01001010\\ 01110001\\ 10011000\\ 01011110\\ 11110101\\ 10101111\\ 10010110\\ 01101100\end{array}\right]\\ =A_5.\end{array}$
• Encryption at the 10^th Diffusion-Center (1,8): (0, Zero in A_ŷ, (5), 2^nd Col.)
• $\begin{array}{c}{\hat{A}}_9^1={\hat{A}}_9F\left(1,5\right)\\ ={\hat{A}}_9\oplus {\hat{A}}_9{\hat{x}}_1\oplus {\hat{A}}_9{\hat{y}}_5\oplus S\left(\because {\hat{p}}_x=\lceil \left(1-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(8-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}10011001\\ 11110100\\ 10001001\\ 10001000\\ 11011000\\ 10000001\\ 01110101\\ 10011001\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 10011001\\ 11110100\\ 10001000\\ 00010011\\ 11011000\\ 10000001\end{array}\right]\oplus \left[\begin{array}{c}011001•0\\ 110100•0\\ 001000•0\\ 010011•0\\ 011000•0\\ 000001•0\\ 110101•0\\ 011001•0\end{array}\right]\oplus \left[\begin{array}{c}00000001\\ 00000000\\ 00000001\\ 00000001\\ 00000001\\ 00000000\\ 00000000\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}11111100\\ 00100100\\ 00110000\\ 10101010\\ 00110001\\ 10010110\\ 01111001\\ 01111100\end{array}\right]\\ =A_{10}.\end{array}$
Decryption at the 10^th Diffusion-Center (1,8):
• $\begin{array}{c}{\hat{A}}_{10}^7={\hat{A}}_{10}^6F\left(1,5\right)\\ ={\hat{A}}_{10}^6\oplus {\hat{A}}_{10}^6{\hat{x}}_1\oplus {\hat{A}}_{10}^6{\hat{y}}_5\oplus \\ S\left(\because {\hat{p}}_x=\lceil \left(1-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(8-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}01111000\\ 01100100\\ 01100101\\ 01001110\\ 10001100\\ 11000011\\ 11001101\\ 00010010\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 01111000\\ 01100100\\ 01100101\\ 01001110\\ 10001100\\ 11000011\end{array}\right]\oplus \left[\begin{array}{c}111000•0\\ 100100•0\\ 100101•0\\ 001110•0\\ 001100•0\\ 000011•0\\ 001101•0\\ 010010•0\end{array}\right]\oplus \left[\begin{array}{c}00000001\\ 00000000\\ 00000001\\ 00000001\\ 00000001\\ 00000000\\ 00000000\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}10011001\\ 11110100\\ 10001000\\ 00010011\\ 11011000\\ 10000001\\ 01110101\\ 10011001\end{array}\right]\\ =A_9.\end{array}$
• Decryption at the 5^th diffusion-center (4,5):
• $\begin{array}{c}{\hat{A}}_5^7={\hat{A}}_5^6F\left(3,3\right)\\ ={\hat{A}}_5^6\oplus {\hat{A}}_5^6{\hat{x}}_3\oplus {\hat{A}}_5^6{\hat{y}}_3\oplus S\left(\because {\hat{p}}_x=\lceil \left(4-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(5-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}00101110\\ 11111000\\ 01011110\\ 10111100\\ 10100100\\ 11000100\\ 10110010\\ 01101000\end{array}\right]\oplus \left[\begin{array}{c}01011110\\ 10111100\\ 10100100\\ 00000000\\ 00000000\\ 10111100\\ 10100100\\ 11000100\end{array}\right]\oplus \left[\begin{array}{c}10110011\\ 11100010\\ 01110011\\ 11110011\\ 10010001\\ 00010001\\ 11000000\\ 10100010\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00001001\\ 00000110\\ 00001011\\ 00001001\\ 00001110\end{array}\right]\\ =\left[\begin{array}{c}11000011\\ 10100110\\ 10001001\\ 01000110\\ 00110011\\ 01100010\\ 11011111\\ 00000000\end{array}\right]\\ =A_4.\end{array}$
Decryption at the 1^st Diffusion-Center (3,7):
• $\begin{array}{c}{\hat{A}}_1^7={\hat{A}}_1^6F\left(2,4\right)\\ ={\hat{A}}_1^6\oplus {\hat{A}}_1^6{\hat{x}}_2\oplus {\hat{A}}_1^6{\hat{y}}_4\oplus S\left(\because {\hat{p}}_x=\lceil \left(3-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(7-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}01100010\\ 00000000\\ 00011000\\ 10110001\\ 00101111\\ 10111100\\ 01101111\\ 10001100\end{array}\right]\oplus \left[\begin{array}{c}00011000\\ 10110001\\ 00000000\\ 00000000\\ 00011000\\ 10110001\\ 00101111\\ 10111100\end{array}\right]\oplus \left[\begin{array}{c}10001000\\ 00000000\\ 01100000\\ 11000100\\ 10111100\\ 11110000\\ 10111100\\ 00110000\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000010\\ 00000001\\ 00000010\\ 00000010\\ 00000011\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}11110010\\ 10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\\ 00000000\end{array}\right]\\ =A.\end{array}$
Example 3 The Functions of Point-Diffusion and Block-Diffusion in 2D
• Supposes
• $S_{5\times 5}=\left[\begin{array}{c}10011\\ 01101\\ 10111\\ 10010\\ 11101\end{array}\right],\stackrel{.}{S}=\left(1,1\right),B_{2\times 2}=\left[\begin{array}{cc}{b}_{11}& b_{12}\\ b_{21}& b_{22}\end{array}\right],\stackrel{.}{B}=\left(1,1\right);$
• selects a switch set Y=[1011011101]; reads every diffusion-center and Y element in order, if from 1 to 10 on encryption, then from 10 back to 1 on decryption; counts the diffusion-cycle, if Y element is 1, then T=2³⁺¹=16 with point-diffusion, otherwise, T=2²⁺¹=8 with block-diffusion, and if 1 time on encryption, then 15 or 7 times on decryption.
• In math, inputs the plaintext A, then runs A¹, Â₁ ¹, A₂ ¹, A₃ ¹, Â₄ ¹, A₅ ¹, A₆ ¹, A₇ ¹, Â₈ ¹, A₉ ¹ and outputs A₁, A₂, . . . , A₉, A₁₀ during encryption; inputs the ciphertext A₁₀, then runs A₁₀ ¹⁵, Â₉ ⁷, A₈ ¹⁵, A₇ ¹⁵, A₆ ¹⁵, Â₅ ⁷, A₄ ¹⁵, A₃ ¹⁵, Â₂ ⁷, A₁ ¹⁵ and outputs A₉, A₈, . . . , A₁, A during decryption. The details on the order 1, 5, 10 are shown as below, A_{d i} (0) and
• ${\hat{A}}_{{\hat{d}}_i}\left(0\right)$
• marked in boldface.
Encryption at the 1^st Diffusion-Center (3,7): Y(1)=1, Point-Diffusion.
• $\begin{array}{c}{A}^1=\mathrm{AF}\left(3,7\right)\\ =A\oplus {\mathrm{Ax}}_3\oplus {\mathrm{Ay}}_7\oplus S\\ =\left[\begin{array}{c}11110010\\ 10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}10110001\\ 01111010\\ 00000000\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\end{array}\right]\oplus \left[\begin{array}{c}11100101\\ 01100000\\ 11110101\\ 11101000\\ 00010000\\ 11111101\\ 11111101\\ 00000000\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000010\\ 00000001\\ 00000010\\ 00000010\\ 00000011\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}10100110\\ 10101011\\ 10001101\\ 11100111\\ 11101111\\ 10001001\\ 11111110\\ 11111111\end{array}\right]\\ ={\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="US20110228927A1-20110922-D00003.png"\; state="\{\{state\}\}">A</figure-callout>}}_1\end{array}$
Encryption at the 5^th Diffusion-Center (4,5): Y(5)=0, Block-Diffusion.
• $\begin{array}{c}{\hat{A}}_4^1={\hat{A}}_4F\left(3,3\right)\\ ={\hat{A}}_4\oplus A_4{\hat{x}}_3\oplus {\hat{A}}_4{\hat{y}}_3\oplus S\left(\because {\hat{p}}_x=\lceil \left(4-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(5-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}11001000\\ 00011010\\ 10000111\\ 11010010\\ 01000111\\ 11100010\\ 11010101\\ 00010110\end{array}\right]\oplus \left[\begin{array}{c}10000111\\ 11010010\\ 01000111\\ 00000000\\ 00000000\\ 11010010\\ 01000111\\ 11100010\end{array}\right]\oplus \left[\begin{array}{c}00100010\\ 01100010\\ 00010001\\ 01000000\\ 00010001\\ 10000000\\ 01010001\\ 01010001\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00001001\\ 00000110\\ 00001011\\ 00001001\\ 00001110\end{array}\right]\\ =\left[\begin{array}{c}01101101\\ 10101010\\ 11010001\\ 10011011\\ 01010000\\ 10111011\\ 11001010\\ 10101011\end{array}\right]\\ =A_5\end{array}$
Encryption at the 10^th Diffusion-Center (1,8): Y(10)=1, Point-Diffusion.
• $\begin{array}{c}{A}_9^1=A_9F\left(1,8\right)\\ =A_9\oplus A_9x_1\oplus A_9y_8\oplus S\\ =\left[\begin{array}{c}00110000\\ 11000111\\ 00001010\\ 10000100\\ 00101100\\ 11110100\\ 00000111\\ 10011011\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00110000\\ 11000111\\ 00001010\\ 10000100\\ 00101100\\ 11110100\\ 00000111\end{array}\right]\oplus \left[\begin{array}{c}01100000\\ 10001110\\ 00010100\\ 00001000\\ 01011000\\ 11101000\\ 00001110\\ 00110110\end{array}\right]\oplus \left[\begin{array}{c}00000001\\ 00000000\\ 00000001\\ 00000001\\ 00000001\\ 00000000\\ 00000000\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}01010001\\ 01111001\\ 11011000\\ 10000111\\ 11110001\\ 00110000\\ 11111101\\ 10101010\end{array}\right]\\ =A_{10}\end{array}$
Decryption at the 10^th Diffusion-Center (1,8): Y(10)=1, Point-Diffusion.
• $\begin{array}{c}{A}_{10}^{15}=A_{10}^{14}F\left(1,8\right)\\ =A_{10}^{14}\oplus A_{10}^{14}x_1\oplus A_{10}^{14}y_8\oplus S\\ =\left[\begin{array}{c}11101111\\ 00011000\\ 11110001\\ 00101100\\ 11111111\\ 11111001\\ 10101010\\ 11101111\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 11101111\\ 00011000\\ 11110001\\ 00101100\\ 11111111\\ 11111001\\ 10101010\end{array}\right]\oplus \left[\begin{array}{c}11011110\\ 00110000\\ 11100010\\ 01011000\\ 11111110\\ 11110010\\ 01010100\\ 11011110\end{array}\right]\oplus \left[\begin{array}{c}00000001\\ 00000000\\ 00000001\\ 00000001\\ 00000001\\ 00000000\\ 00000000\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}00110000\\ 11000111\\ 00001010\\ 10000100\\ 00101100\\ 11110100\\ 00000111\\ 10011011\end{array}\right]\\ =A_9\end{array}$
Decryption at the 5^th Diffusion-Center (4,5): Y(5)=0, Block-Diffusion.
• $\begin{array}{c}{\hat{A}}_5^7={\hat{A}}_5^6F\left(3,3\right)\\ ={\hat{A}}_5^6\oplus {\hat{A}}_5^6{\hat{x}}_3\oplus {\hat{A}}_5^6{\hat{y}}_3\oplus S\left(\because {\hat{p}}_x=\lceil \left(4-1\right)/2\rceil +1,{\hat{p}}_y=\lceil \left(5-1\right)/2\rceil +1\right)\\ =\left[\begin{array}{c}11101100\\ 10100011\\ 10010111\\ 00111001\\ 01000111\\ 10010000\\ 00101110\\ 00101010\end{array}\right]\oplus \left[\begin{array}{c}10010111\\ 00111001\\ 01000001\\ 00000000\\ 00000000\\ 00111001\\ 01000001\\ 10010000\end{array}\right]\oplus \left[\begin{array}{c}10110011\\ 10000000\\ 01010001\\ 11100010\\ 00000000\\ 01000000\\ 10110011\\ 10100010\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00001001\\ 00000110\\ 00001011\\ 00001001\\ 00001110\end{array}\right]\\ =\left[\begin{array}{c}11001000\\ 00011010\\ 10000111\\ 11010010\\ 01000111\\ 11100010\\ 11010101\\ 00010110\end{array}\right]\\ =A_4\end{array}$
Decryption at the 1^st Diffusion-Center (3,7): Y(1)=1, Point-Diffusion.
• $\begin{array}{c}{A}_1^{15}=A_1^{14}F\left(3,7\right)\\ =A_1^{14}\oplus A_1^{14}x_3\oplus A_1^{14}y_7\oplus S\\ =\left[\begin{array}{c}11010110\\ 10001001\\ 00101000\\ 00110101\\ 01101011\\ 01110011\\ 01111010\\ 11010111\end{array}\right]\oplus \left[\begin{array}{c}10001001\\ 00101000\\ 00000000\\ 00101000\\ 00110101\\ 01101011\\ 01110011\\ 01111010\end{array}\right]\oplus \left[\begin{array}{c}10101101\\ 00010000\\ 01010000\\ 01101000\\ 11010101\\ 11100101\\ 11110101\\ 10101101\end{array}\right]\oplus \left[\begin{array}{c}00000000\\ 00000000\\ 00000010\\ 00000001\\ 00000010\\ 00000010\\ 00000011\\ 00000000\end{array}\right]\\ =\left[\begin{array}{c}11110010\\ 10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 11111111\\ 00000000\end{array}\right]\\ =A\end{array}$
Example 4 The Function of Point-Diffusion in 3D
• Supposes a plaintext A: let Table 1-1 overlap for 8 times to shape a 8×8×8 binary matrix, shown as a 8×8 matrix in ASCII code format as in Table 2-1. To figure out the later 3D calculation clearly with Table 2-1, the row stands for a x-y plane, namely Table 1-1, and all rows resolve as the axis z.

• TABLE 2-1
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72
  73	6d	6f	6f	74	68	65	72

• Suppose a password: “YourlipsY”, its ASCII code is 59 6f 75 72 6c 69 70 73 59. For applying to the plaintext, the ASCII code: first, subtracts 8 if a digit >7 and leaves 51 67 75 72 64 61 70 73 51; second, every three-digit forms a division; third, adds 1 to each digit; Table 2-2 shows that the password includes 6 diffusion-centers.

• 	TABLE 2-2
  		ASCII

  		516	775	726	461	707	351
  	First Dimension	6	8	8	5	8	4
  	Second Dimension	2	8	3	7	1	6
  	Third Dimension	7	6	7	2	8	2

• Supposes S_1×1×1=1, {dot over (S)}=(1,1,1); reads every diffusion-center in order, if from 1 to 6 on encryption, then from 6 back to 1 on decryption; counts the diffusion-cycle T=2³⁺¹=16, if 1 time on encryption, then 15 times on decryption. In math, inputs the plaintext A, then runs A¹, A₁ ¹, . . . A₅ ¹ and outputs A₁, A₂, . . . A₆ during encryption; inputs the ciphertext A₆, then runs A₆ ¹⁵, A₅ ¹⁵, . . . A₁ ¹⁵ and outputs A₅, . . . , A₁, A during decryption. The details on the order 1, 6 are shown as below, A_{d i} (0) marked in boldface.
Encryption at the 1^st Diffusion-Center (6,2,7):
• 
  A ¹ =AF(6,2,7)=A⊕Ax ₆ ⊕Ay ₂ ⊕Az ₇ ⊕S=A ₁;
• Considering that the row of Table 2-1 means a x-y plane, it can be figured out by the 3D scheme through rearranging every plane then placing to the corresponding row of 2D table, as Ax₆ and Ay₂ as follows.
• $a\mathrm{plane}\mathrm{of}{\mathrm{Ax}}_6=\left[\begin{array}{c}10110001\\ 01111010\\ 01110100\\ 10001001\\ 11111111\\ 00000000\\ 11111111\\ 11111111\end{array}\right],{\mathrm{Ax}}_6=\left[\begin{array}{cccccccc}d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\\ d9& d6& d7& d7& \mathrm{da}& d4& d2& d9\end{array}\right];$ $a\mathrm{plane}\mathrm{of}{\mathrm{Ay}}_2=\left[\begin{array}{c}10111001\\ 00011000\\ 10111101\\ 10111010\\ 00000000\\ 10111111\\ 10111111\\ 00000000\end{array}\right],{\mathrm{Ay}}_2=\left[\begin{array}{cccccccc}6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\\ 6d& 00& 6d& 6f& 6f& 74& 68& 65\end{array}\right];$
• In addition, S is anchored to position (6,2,7), see below, value 1 found at p_x=6, p_y=2 on the 7^th plane (p_z=7).
• $\mathrm{the}7^{\mathrm{th}}\mathrm{plane}\mathrm{of}S=\left[\begin{array}{c}00000000\\ 00000000\\ 00000000\\ 00000000\\ 00000000\\ 01000000\\ 00000000\\ 00000000\end{array}\right],S=\left[\begin{array}{cccccccc}00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 20& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\end{array}\right].$
Encryption at the 6^th Diffusion-Center (4,6,2):
• $A_5F\left(4,6,2\right)=A_5\oplus A_5x_4\oplus A_5y_6\oplus A_5z_2\oplus S=A_6;$ $A_5=\left[\begin{array}{cccccccc}c4& 11& 3a& b7& 7a& 64& 01& \mathrm{ed}\\ 8f& c0& 8e& 8d& a1& b7& \mathrm{cb}& 00\\ 53& 9c& 48& 26& \mathrm{ee}& \mathrm{eb}& 8b& 23\\ 5b& 5b& 27& 47& 91& b1& 5c& \mathrm{cb}\\ b8& 34& 67& 4a& 9f& b3& 74& 4c\\ 92& 17& 5d& 5a& 7e& 7d& 84& 0f\\ a0& 19& 5d& e6& 48& 7a& 82& c3\\ \mathrm{bf}& \mathrm{ac}& 38& \mathrm{df}& 13& 2f& d8& 1a\end{array}\right];$ $A_5z_2=\left[\begin{array}{cccccccc}8f& c0& 8e& 8d& a1& b7& \mathrm{cb}& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 8f& c0& 8e& 8d& a1& b7& \mathrm{cb}& 00\\ 53& 9c& 48& 26& \mathrm{ee}& \mathrm{eb}& 8b& 23\\ 5b& 5b& 27& 47& 91& b1& 5c& \mathrm{cb}\\ b8& 34& 67& 4a& 9f& b3& 74& 4c\\ 92& 17& 5d& 5a& 7e& 7d& 84& 0f\\ a0& 19& 5d& e6& 48& 7a& 82& c3\end{array}\right];$ $A_5x_4=\left[\begin{array}{cccccccc}82& 20& 75& 63& f5& c2& 00& d6\\ 17& 80& 17& 16& 40& 63& 95& 00\\ a1& 36& 94& 43& d7& d5& 15& 41\\ b5& b5& 43& 83& 20& 60& b6& 95\\ 74& 62& c3& 95& 37& 61& e2& 96\\ 21& 23& b6& b5& f7& f6& 02& 17\\ 40& 34& b6& c3& 94& f5& 01& 81\\ 77& 56& 74& b7& 21& 57& b4& 35\end{array}\right];$ $S=\left[\begin{array}{cccccccc}00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 08& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 00& 00& 00& 00& 00& 00& 00& 00\end{array}\right];$ $A_5y_6=\left[\begin{array}{cccccccc}11& 3a& b7& 7a& 64& 00& 64& 01\\ c0& 8e& 8d& a1& b7& 00& b7& \mathrm{cb}\\ 9c& 48& 26& \mathrm{ee}& \mathrm{eb}& 00& \mathrm{eb}& 8b\\ 5b& 27& 47& 91& b1& 00& b1& 5c\\ 34& 67& 4a& 9f& b3& 00& b3& 74\\ 17& 5d& 5a& 7e& 7d& 00& 7d& 84\\ 19& 5d& e6& 48& 7a& 00& 7a& 82\\ \mathrm{ac}& 38& \mathrm{df}& 13& 2f& 00& 2f& d8\end{array}\right];$ $A_6=\left[\begin{array}{cccccccc}d8& \mathrm{cb}& 76& 23& 4a& 11& \mathrm{ae}& 3a\\ 58& \mathrm{ce}& 14& 3a& 56& \mathrm{dc}& e9& \mathrm{cb}\\ e1& 22& 74& 06& 73& 89& \mathrm{be}& e9\\ e6& 55& 6b& 73& \mathrm{ee}& 3a& d0& 21\\ a3& 6a& c9& 07& 8a& 63& 79& 65\\ 1c& 5d& d6& \mathrm{db}& 6b& 38& 8f& d0\\ 6b& 67& 50& 37& d8& f2& 7d& \mathrm{cf}\\ c4& \mathrm{db}& \mathrm{ce}& 9d& 55& 02& c1& 34\end{array}\right].$
Decryption at the 6^th Diffusion-Center (4,6,2):
• $A_6^{15}=A_6^{14}F\left(4,6,2\right)=A_6^{14}\oplus A_6^{14}x_4\oplus A_6^{14}y_6\oplus A_6^{14}z_2\oplus S=A_5;$ $A_6^{14}=\left[\begin{array}{cccccccc}24& 31& 7d& 3a& e8& \mathrm{fb}& 8d& c1\\ 93& 3d& 8b& 10& a1& 6a& 61& 21\\ a6& 25& c6& 86& \mathrm{ee}& 81& d0& 4a\\ 47& 39& 33& b3& 91& 10& 71& 50\\ 50& 0f& 15& 63& 9f& 62& 25& \mathrm{ee}\\ c6& 87& 9c& e2& 7e& 0a& 9d& 28\\ 9f& \mathrm{ce}& c7& 85& 48& d0& \mathrm{ba}& 31\\ 3c& 6a& \mathrm{dd}& 94& 13& \mathrm{aa}& \mathrm{bf}& 77\end{array}\right];$ $A_6^{14}x_4=\left[\begin{array}{cccccccc}42& 60& f6& 75& d4& f5& 16& 80\\ 21& 76& 15& 20& 76& d5& c0& 40\\ 43& 42& 83& 03& 61& 00& b6& 95\\ 83& 74& 61& 61& 21& 20& e0& a0\\ a0& 17& 22& c1& b5& c1& 42& d7\\ 83& 03& 36& c1& 35& 15& 36& 54\\ 37& 97& 83& 02& 01& a0& 75& 60\\ 76& d5& b6& 22& d6& 55& 77& e3\end{array}\right];$ $A_6^{14}y_6=\left[\begin{array}{cccccccc}31& 7d& 3a& e8& \mathrm{fb}& 00& \mathrm{fb}& 8d\\ 3d& 8b& 10& \mathrm{bd}& 6a& 00& 6a& 61\\ 25& c6& 86& b3& 81& 00& 81& \mathrm{dd}\\ 39& 33& b3& 13& 10& 00& 10& 71\\ 0f& 15& 63& 5b& 62& 00& 62& 25\\ 87& 9c& e2& 1a& 0a& 00& 0a& 9d\\ \mathrm{ce}& c7& 85& 83& d0& 00& d0& \mathrm{ba}\\ 6a& \mathrm{dd}& 94& \mathrm{ec}& \mathrm{aa}& 00& \mathrm{aa}& \mathrm{bf}\end{array}\right];$ $A_6^{14}z_2=\left[\begin{array}{cccccccc}93& 3d& 8b& 10& \mathrm{bd}& 6a& 61& 21\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 93& 3d& 8b& 10& \mathrm{bd}& 6a& 61& 21\\ a6& 25& c6& 86& b3& 81& \mathrm{dd}& 4a\\ 47& 39& 33& b3& 13& 10& 71& 50\\ 50& 0f& 15& 63& 5b& 62& 25& \mathrm{ee}\\ c6& 87& 9c& e2& 1a& 0a& 9d& 28\\ 9f& \mathrm{ce}& c7& 85& 83& d0& \mathrm{ba}& 31\end{array}\right];$
Decryption at the 1^st Diffusion-Center (6,2,7):
• $A_1^{15}=A_1^{14}F\left(6,2,7\right)=A_1^{14}\oplus A_1^{14}x_6\oplus A_1^{14}y_2\oplus A_1^{14}z_7\oplus S=A.{\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="US20110228927A1-20110922-D00003.png"\; state="\{\{state\}\}">A</figure-callout>}}_1^{14}=\left[\begin{array}{cccccccc}53& 1d& 4f& 6e& 77& 6e& e8& 28\\ b4& 7e& \mathrm{ba}& 99& b6& a6& 37& e6\\ e3& \mathrm{cc}& f6& 40& 00& 2b& \mathrm{af}& 70\\ 8d& 27& 8e& 59& 34& 16& b6& 75\\ \mathrm{df}& 19& c1& 34& 43& 41& 9e& 6b\\ 3a& 78& 37& c0& 82& \mathrm{ea}& b5& 52\\ 6c& c9& 7b& 18& 37& d5& 60& 1c\\ 3a& 78& 37& c0& 82& \mathrm{ea}& b5& 52\end{array}\right];$ $A_1^{14}x_6=\left[\begin{array}{cccccccc}89& 0e& 87& d7& \mathrm{db}& d7& d4& 54\\ 5a& \mathrm{df}& 5d& 0c& 5b& 53& 5b& d3\\ d1& 86& \mathrm{db}& 80& 00& 55& 57& d8\\ 06& 53& 07& 8c& 5a& 0b& 5b& \mathrm{da}\\ 8f& 0c& 80& 5a& 81& 80& 0f& d5\\ 5d& \mathrm{dc}& 5b& 80& 01& d5& 5a& 89\\ d6& 84& \mathrm{dd}& 0c& 5b& 8a& d0& 0e\\ 5d& \mathrm{dc}& 5b& 80& 01& d5& 5a& 89\end{array}\right];$ $A_1^{14}y_2=\left[\begin{array}{cccccccc}1d& 00& 1d& 4f& 6e& 77& 6e& e8\\ 7e& 00& 7e& \mathrm{ba}& 99& b6& a6& 37\\ \mathrm{cc}& 00& \mathrm{cc}& f6& 40& 00& 2b& \mathrm{af}\\ 27& 00& 27& 8e& 59& 34& 16& b6\\ 19& 00& 19& c1& 34& 43& 41& 9e\\ 78& 00& 78& 37& c0& 82& \mathrm{ea}& b5\\ c9& 00& c9& 7b& 18& 37& d5& 60\\ 78& 00& 78& 37& c0& 82& \mathrm{ea}& b5\end{array}\right];$ $A_1^{14}z_7=\left[\begin{array}{cccccccc}b4& 7e& \mathrm{ba}& 99& b6& a6& 37& e6\\ e3& \mathrm{cc}& f6& 40& 00& 2b& \mathrm{af}& 70\\ 8d& 27& 8e& 59& 34& 16& b6& 75\\ \mathrm{df}& 19& c1& 34& 43& 41& 9e& 6b\\ 3a& 78& 37& c0& 82& \mathrm{ea}& b5& 52\\ 6c& c9& 7b& 18& 37& d5& 60& 1c\\ 00& 00& 00& 00& 00& 00& 00& 00\\ 6c& c9& 7b& 18& 37& d5& 60& 1c\end{array}\right];$
• In summation of the above description, the present invention herein complies with the constitutional, statutory, regulatory and treaty, patent application requirements and is herewith submitted for patent application. However, the description and its accompanied drawings are used for describing preferred embodiments of the present invention, and it is to be understood that the invention is not limited thereto. To the contrary, it is intended to cover various modifications and similar arrangements and procedures, and the scope of the appended claims therefore should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements and procedures.

Claims (10)

1. A cryptographic method, including a plaintext M run by at least one variable module, each comprising of:

selecting dimensions of M, wherein M forms a d₁×d₂× . . . ×d_n n-dimension binary matrix;

selecting a diffusion-center P, wherein P expresses a (p₁, p₂, . . . p_n) n-dimension position;

selecting a medium S, wherein S is a s₁×s₂× . . . ×s_n n-dimension binary matrix which has an anchor-point {dot over (S)}, wherein {dot over (S)} expresses a ({dot over (s)}₁, {dot over (s)}₂, . . . {dot over (s)}_n) n-dimension position;

selecting a function of point-diffusion AF(p₁, p₂, . . . , p_n), wherein AF(p₁, p₂, . . . , p_n)=A⊕Ad_1p⊕Ad_2p⊕ . . . ⊕Ad_np⊕S;

setting a diffusion-cycle T, wherein T=2^U+1, U=┌log₂ u┐, and u=max(d₁, d₂, . . . , d_n); letting T=T_E+T_D;

further, comprising steps of:

(a) encrypting M, wherein A=M; a ciphertext C=AF(p₁, p₂ ^{T E} , . . . , p_n);

(b) decrypting C, wherein A=C; M=AF(p₁, p₂ ^{T D} , . . . , p_n).

2. The cryptographic method according to claim 1, wherein said function of point-diffusion comprises that:

S overlaps A, {dot over (S)} anchoring to P;

Ad_ip, 1≦i≦n, expresses a series of n−1 dimensional binary matrixes A_{d i} , Ad_ip=[A_{d i} (2), . . . , A_{d i} (p_i), A_{d i} (0), A_{d i} (p_i), . . . , A_{d i} (d_i−1)], on d_i axis in order, wherein A_{d i} (p_i) represents the original matrix at p_i position, and A_{d i} (0), expresses a zero matrix filling at p_i position.

3. The cryptographic method according to claim 1, further including a password, wherein said password has at least one variable data, said data read by said module, each including: (p₁, p₂, . . . , p_n) and/or d₁×d₂× . . . ×d_n and/or ({dot over (s)}₁, {dot over (s)}₂, . . . {dot over (s)}_n) and/or s₁×s₂× . . . ×s_n and/or S and/or T_E and/or T_D.

4. A cryptographic method, including a plaintext M run by at least one variable module, each comprising of:

selecting dimensions of M, wherein M forms a d₁×d₂× . . . ×d_n n-dimension binary matrix;

selecting a diffusion-center P, wherein P expresses a (p₁, p₂, . . . p_n) n-dimension position;

selecting a medium S, wherein S is a s₁×s₂× . . . ×s_n n-dimension binary matrix which has an anchor-point {dot over (S)}, wherein {dot over (S)} expresses a ({dot over (s)}₁, {dot over (s)}₂, . . . {dot over (s)}_n) n-dimension position;

selecting a block B, wherein B is a b₁×b₂× . . . ×b_n n-dimension binary matrix which has an anchor-point {circumflex over (B)}, wherein {dot over (B)} expresses a ({dot over (b)}₁, {dot over (b)}₂, . . . , {dot over (b)}_n) n-dimension position;

selecting a function of block-diffusion ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n), wherein ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n)=Â⊕Â{circumflex over (d)}_{1{circumflex over (p)}}⊕Â{circumflex over (d)}_{2{circumflex over (p)}}⊕ . . . ⊕A{circumflex over (d)}_{n{circumflex over (p)}}⊕S;

setting a diffusion-cycle T, wherein T=2^U+1, U=┌log₂ u┐, and u=max(┌d_i/b_i┐, 1≦i≦n); letting T=T_E+T_D;

further, comprising steps of:

(a) encrypting M, wherein Â=M; a ciphertext C=ÂF({circumflex over (p)}₁, {circumflex over (p)}₂ ^{T E} , . . . , {circumflex over (p)}_n);

(b) decrypting C, wherein Â=C; M=ÂF({circumflex over (p)}₁, {circumflex over (p)}₂ ^{T D} , . . . , {circumflex over (p)}_n).

5. The cryptographic method according to claim 4, wherein said function of block-diffusion comprises that:

S overlaps A based on {dot over (S)} anchoring to P;

 expresses A by B unit based on {dot over (B)} anchoring to P, wherein  is {circumflex over (d)}₁×{circumflex over (d)}₂× . . . ×{circumflex over (d)}_n n-dimension binary matrix which has a block diffusion-center {circumflex over (P)}, wherein {circumflex over (P)} expresses a ({circumflex over (p)}₁, {circumflex over (p)}₂, . . . {circumflex over (p)}_n) n-dimension position; lets {circumflex over (d)}_i=┌(p_i−{dot over (b)}_i)/b_i┐+┌(d_i−p_i+{dot over (b)}_i)/b_i┌, and {circumflex over (p)}_i=┌(p_i−{dot over (b)}_i)/b_i┐+1, 1≦i≦n;

Â{circumflex over (d)}_{i{circumflex over (p)}}, 1≦i≦n, expresses a series of n−1 dimensional binary matrixes

$\hat{A}{\hat{d}}_{i\hat{p}}=\left[{\hat{A}}_{{\hat{d}}_i}\left(2\right),\dots ,{\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right),{\hat{A}}_{{\hat{d}}_i}\left(0\right),{\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right),\dots ,{\hat{A}}_{{\hat{d}}_i}\left({\hat{d}}_i-1\right)\right],$

on {circumflex over (d)}_i axis in order, wherein

${\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right)$

represents the original matrix at {circumflex over (p)}_i position, and

${\hat{A}}_{{\hat{d}}_i}\left(0\right)$

expresses a zero matrix filling at {circumflex over (p)}_i position.

6. The cryptographic method according to claim 4, further including a password, wherein said password has at least one variable data, said data read by said module, each including: (p₁, p₂, . . . , p_n) and/or d₁×d₂× . . . ×d_n and/or ({dot over (s)}₁, {dot over (s)}₂, . . . {dot over (s)}_n) and/or s₁×s₂× . . . ×s_n and/or S and/or ({dot over (b)}₁, {dot over (b)}₂, . . . , {dot over (b)}_n) and/or b₁×b₂× . . . ×b_n and/or T_E and/or T_D.

7. A cryptographic method, including a plaintext M run by at least one variable module, each comprising of:

selecting dimensions of M, wherein M forms a d₁×d₂× . . . ×d_n n-dimension binary matrix;

selecting a diffusion-center P, wherein P expresses a (p₁, p₂, . . . p_n) n-dimension position;

selecting a medium S, wherein S is a s₁×s₂× . . . ×s_n n-dimension binary matrix which has an anchor-point {dot over (S)}, wherein {dot over (S)} expresses a ({dot over (s)}₁, {dot over (s)}₂, . . . {dot over (s)}_n) n-dimension position;

selecting a block B, wherein B is a b₁×b₂× . . . ×b_n n-dimension binary matrix which has an anchor-point {dot over (B)}, wherein {dot over (B)} expresses a ({dot over (b)}₁, {dot over (b)}₂, . . . , {dot over (b)}_n) n-dimension position;

selecting a switch Y, wherein Y represents a first value for a function of point-diffusion, a second value for a function of block-diffusion;

selecting said function of point-diffusion AF(p₁, p₂, . . . , p_n), wherein AF(p₁, p₂, . . . , p_n)=A⊕Ad_1p⊕Ad_2p⊕ . . . ⊕Ad_np⊕S;

selecting said function of block-diffusion ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {circumflex over (p)}_n), wherein ÂF({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {circumflex over (p)}_n)=Â⊕Â{circumflex over (d)}_{1{circumflex over (p)}}⊕Â{circumflex over (d)}_{2{circumflex over (p)}}⊕ . . . ⊕Â{circumflex over (d)}_{n{circumflex over (p)}}⊕S;

setting a diffusion-cycle T₁, wherein T₁=2^U+1, U=┌log₂ u┐, and u=max(d₁, d₂, . . . , d_n); letting T₁=T_E1 T_D1;

setting a diffusion-cycle T₂, wherein T₂=2^U+1, U=┌log₂ u┐, and u=max(┌d_i/b_i┐, 1=i≦n); letting T₂=T_E2 T_D2;

further, comprising steps of:

(a) encrypting M, wherein A=M; if Y equals to said first value, then a ciphertext C=AF(p₁, p₂ ^{T E1} , . . . , p_n); or if Y equals to said second value, then C=ÂF({circumflex over (p)}₁, {circumflex over (p)}₂ ^{T E2} , . . . , {circumflex over (p)}_n);

(b) decrypting C, wherein A=C; if Y equals to said first value, then M=AF(p₁, p₂ ^{T D1} , . . . , p_n); or if Y equals to said second value, then M=ÂF({circumflex over (p)}₁, {circumflex over (p)}₂ ^{T D2} , . . . , {circumflex over (p)}_n).

8. The cryptographic method according to claim 7, wherein said function of point-diffusion comprises that:

S overlaps A, {dot over (S)} anchoring to P;

Ad_ip, 1≦i≦n, expresses a series of n−1 dimensional binary matrixes A_{d i} , Ad_ip=[A_{d i} (2), . . . , A_{d i} (p_i), A_{d i} (0), A_{d i} (p_i), . . . , A_{d i} (d_i−1)], on d_i axis in order, wherein A_{d i} (p_i) represents the original matrix at p_i position, and A_{d i} (0) expresses a zero matrix filling at p_i position.

9. The cryptographic method according to claim 7, wherein said function of block-diffusion comprises that:

S overlaps A based on {dot over (S)} anchoring to P;

 expresses A by B unit based on {dot over (B)} anchoring to P, wherein  is {circumflex over (d)}₁×{circumflex over (d)}₂× . . . ×{circumflex over (d)}_n n-dimension binary matrix which has a block diffusion-center {circumflex over (P)}, wherein {circumflex over (P)} expresses a ({circumflex over (p)}₁, {circumflex over (p)}₂, . . . , {circumflex over (p)}_n) n-dimension position; lets {circumflex over (d)}_i=┌(p_i−{dot over (b)}_i)/b_i┐+┌(d_i−p_i+{dot over (b)}_i┐, and {circumflex over (p)}=|(p_i−{dot over (b)}_i)/b_i|+1, 1≦i≦n;

Â{circumflex over (d)}_ip, 1≦i≦n, expresses a series of n−1 dimensional binary matrixes

${\hat{A}}_{{\hat{d}}_i},\hat{A}{\hat{d}}_{i\hat{p}}=\left[{\hat{A}}_{{\hat{d}}_i}\left(2\right),\dots ,{\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right),{\hat{A}}_{{\hat{d}}_i}\left(0\right),{\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right),\dots ,{\hat{A}}_{{\hat{d}}_i}\left({\hat{d}}_i-1\right)\right],$

on {circumflex over (d)}_i axis in order, wherein

${\hat{A}}_{{\hat{d}}_i}\left({\hat{p}}_i\right)$

represents the original matrix at {circumflex over (p)}_i position, and

${\hat{A}}_{{\hat{d}}_i}\left(0\right)$

expresses a zero matrix filling at {circumflex over (p)}_i position.

10. The cryptographic method according to claim 7, further including a password, wherein said password has at least one variable data, said data read by said module, each including: (p₁, p₂, . . . p_n) and/or d₁×d₂× . . . ×d_n and/or ({dot over (s)}₁, {dot over (s)}₂, . . . {dot over (s)}_n) and/or s₁×s₂× . . . ×s_n and/or S and/or ({dot over (b)}₁, {dot over (b)}₂, . . . , {dot over (b)}_n) and/or b₁×b₂× . . . ×b_n and/or Y and/or T_E1 and/or T_D1 and/or T_E2 and/or T_D2.

Images