When students in the 2nd semester in year 1992 type on the laptop during the lecture or start talking, Professor Gerd Baron always repeated very loudly that's what's all about:
We have a universe here and
it's all about of the number of arrangements in a finite set.
Professor Gerd Baron of Mathematics modified math lecture for computer scientists, where he claimed graph theory and combinatorics and weighted models (for traveling salesmen or ip routing) to understand better things we will need later (like equal costs => multipath).
plain text ⟶ 3DES PBox → AES → 2blowfish ⟶ cipher text
cipher text ⟶ 2blowfish → AES → 3DES SBox ⟶ plain text
plain text ⟶ AES ⟶ 2blowfish ⟶ 3DES PBox (scrambled) ⟶ cipher text
cipher text ⟶ 3DES SBox(scrambled) → 2blowfish → AES ⟶ plain text
you also can remix it per good random numbers like
3DES = 0x1
AES = 0x2
2Fish = 0x4
Serpent = 0x8
So 0xBC for encryption would mean 0xCB for decryption
plain ⟶ (3DES→AES→Serpent) ⟶ (2Fish→Serpent) ⟶ encrypted
encrypted ⟶ (Serpent→2Fish) ⟶ (Serpent→AES→3DES) ⟶ plain
with 2 bytes strong keys (negoatiated randomized at handshake) you're quiet secure.
Github repository: github.com/heinrichelsigan/area23.at/
A simple matrix encryption algorithm by myself:
I found a simple matrix symmetric encryption algorithm, that works similiar to 3DES,
with NxN Matrix trans, after asking that question here on math.stackexchange.com/questions/4915786/
R3 ➝ R3: v(3) x M(3,3) = v(3) ⎡ 1 ⎤ ⎡ 0 1 0 ⎤ ⎡ 2 ⎤ ⎢ 2 ⎥ x ⎢ 0 0 1 ⎥ = ⎢ 3 ⎥ ⎣ 3 ⎦ ⎣ 1 0 0 ⎦ ⎣ 1 ⎦ The inverse matrix for reverse symmetric encryption would be: ⎡ 2 ⎤ ⎡ 0 0 1 ⎤ ⎡ 1 ⎤ ⎢ 3 ⎥ x ⎢ 1 0 0 ⎥ = ⎢ 2 ⎥ ⎣ 1 ⎦ ⎣ 0 1 0 ⎦ ⎣ 3 ⎦
Keine Kommentare:
Kommentar veröffentlichen