Font Size: 
A note on a decomposition algorithm for cryptography
Vastimil Smetak, Jiri Chlebnicek, Vojtech Carbol

Last modified: 2023-05-15


This paper concerns some results of effectivenes of prime decomposition. Indeed, the algorithm is based on the matrix of arranged multiplied prime number structure. Raw model shows very high effectiveness for two high prime numbers given that the effeciency goes with $\sqrt n$-e when the highest effeciency (peak) is identified for each prime divisor at $P_2=\frac{1}{2} P_1$. The effectivity goes higher with higher values to analyse. Conversely, the lower values of effectiveness are given by the multiplication of two prime numbers with large gaps.