There is a prime number x prime number cipher, but I tried to create a cipher that is prime number + prime number = prime number by Nada 20230925

Hello. It's tears. This time I will talk about a code that I devised.

I have been researching cryptography for a long time. N-queen problem, cracking RSA cryptography, quantum-resistant cryptography, etc. As Descartes pointed out in his ``Introduction to Method'', I think it would be best to start solving the N-queen problem by solving a 4x4 grid of N-queens, as Descartes said, ``Divide the difficulty into parts.'' There are two solutions for N queen in 4x4 squares. There are 92 solutions for N queen of 8x8 squares. I found solving codes to be as fun as solving puzzles, but at the same time I was also researching the weaknesses of codes, so I think I have a good idea of ​​what types of codes are difficult to crack. For example, RSA encryption is a prime factorization of prime number x prime number, but I don't think it's bad to use a code that says prime number x2 + prime number = prime number. Of course, you can easily find the solution by just adding this prototype. I would like to consider a cipher like (31)x2+(47)=(109). Since 109 is a public key encryption, it is made public in advance. The problem is to find 31 and 47 (31 and 47 are the so-called private keys or passwords), but 109 can also be found by (3)x2+(103)=(109). That's why I use mods. Mod is used to calculate the remainder; if 54=3mod17, the remainder when 54 is divided by 17 is 3. For example, (3mod14)x2+(13mod17)=109. Even if 3mod14 becomes a prime number, 13mod17 becomes a prime number at the same time, so you need to add the two together to get 109. By the way, 31=3mod14, 47=13mod17. The problem is the uniqueness of prime factorization, that is, whether it is possible to reduce the number of solutions to one. Furthermore, if we set prime number (mod) + prime number (mod) + prime number (mod) = prime number, the cipher becomes even more difficult to solve.