See here a snippet of a real Post Quantum(resistant) based Encryption

The NaVeOl_Cript encryption algorithm is partially implemented in the software product.

Calculation of a multifactor key.

A set of input arrays, which are individual public keys, is transformed into a multifactor key after applying irreversible functions. The functions for forming the multifactor key utilize the avalanche effect. This is achieved by using

For example:

Formation of a multifactor key

Based on the file.

H[32] = HASH(File)   

a[512]=random(const1)

s, p, y=1

s = ∑ H_i

p = ∏ H_i

y = ∏ (H_i ·7·i)

L₀ = a₀ ·  s + p

L_i= (L_i-1 xor const4) · s · a_{(i % const2)} · i +(p+1+L_i-1) · I  + y)

HK_i = not(L_i) xor a_i

B_i =∑ File

HK_i = HK_i  xor B_i

Based on a random sequence. random(time)

SK[512]=random(HK)

Based on a password

s = const5 , p= const6, y= const7

s = ∑ H_i

p = ∏ H_i

y = ∏ (H_i ·7·i)

L₀ = pass₀ · s + p)

L_i = (L_i - 1 xor const7) ·  s ·  a_{[i % pass.lenght]} ·  i + (p + 1 + L_{i - 1}) ·  i + y;

L_i = L_i · Li _{+ 1} / (L_{i + 2} + 1)

Adding keys

Key5_i = (L_i ^ SK_i + (HK_i + 1))) xor L_i

Initial value of MAT calculation

Initial value of selection key:

X=Key5[Key5[const1]] + Key5[Key5[const2]] * Key5[Key5[const3]];

Initial value MAT[256]

MAT=random(X xor const8)

Change of keys in block coding:

function Dispatcher:

0: FreshQQKey(Key5, MAT)

1: MAT = FreshQMAT(MAT, Key5_{(i and const9)})

Refresh key:

Key5.Reverse();

Key5_i= Key5_i+ Key5_[i+127]+ MAT_[255-i])

Update MAT via function dispatcher.
function dispatcher (variable1 + MAT_{[Key5[counter & 511] and 15]})

0: MAT=function1 (MAT)

1: MAT=function2 (MAT)

………

14: MAT=function15 (MAT)

Fast functions are used:

xor, add, shift, not, Reverse, permutation

Encryption is performed by adding the data key

D_i=D_i xor Key5_i

Formulaic part:

1.   

2. q = CONCAT (x, random(∑ )

3. seed = x mod const

4. r = random(seed)

5. φ =FD₀(  (r xor q)  ,  ( (x >>const1)   and    const2)   )

6. φ=> = T   

a. provided that b  <> 8, 16, 32, 64, 128…

7. T'= permutation(T)

8. T'== φ'

9. Φ=Σ φ _i

10. K = f(Φ)

11. FD = config(FD,K)

12. X=

13. MAT_i=FD (MAT_i  , X)

14. Φ =FD(Φ, X, MAT)

15. Cipher = Data ^ Φ

16. Cipher _i =MAT[Cipher _i ]

See attach for more 

------------------------------
Coenraad smith
------------------------------