[Cryptography-dev] [Cryptography] yan-blockCipher (encryption base upon yan multiplication )

[valerio]

we develop new symmetric encryption algorithm

this algorithm base upon yan theorem

yan theorem
a * b = u | l
l/a = b

439 * 827 = 363 | 053
053 / 439 = 827

NOTE : yan block-cipher use yan 9

encryption algorithm
(M+K1)*K2=C
decryption algorithm
(C/K2)-K1 = M

we know that gcd(...) use to recover key in multiplication encryption
K = gcd(C!,C2,C3,..)

but gcd(...) don't work on yan division

brute force attack work when you know one of them M, K
otherwise you trap in yan cycle

python program for testing purpose
https://github.com/valerio7s/yan-crypto/blob/725e58ed5e907df6ae0901226f0409166463a87b/symmetricEncryption/yan-blockCipher_test.py

manual

cmd
k for key
e for encryption
d for decryption

default key 1

example
>k 4567878764321761
4567878764321761

>e 1235464674897411
7753210264056092

>d 7753210264056092
1235464674897411
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mail.python.org/pipermail/cryptography-dev/attachments/20220324/9e42146c/attachment.html>