Python implementation of RSA multiplication homomorphic encryption and decryption

adopt rsa Multiplicative homomorphic encryption arbitrary （ Plus or minus ） Floating point data , And the encrypted ciphertext is multiplied , Decrypt the ciphertext after multiplication , By calling python What library functions can be implemented ？ I hope relevant professionals can help , I have realized some , Convert the encrypted byte type to integer type by encoding and encrypting the floating-point string , You can do multiplication , But it cannot be decrypted after the multiplication （ The number of ciphertext bits has changed ）, So I would like to ask the relevant professionals how to deal with the relevant problems

---

Take the answer ：

Still tossing about this problem .
Has this article been referred to ？

RSA Multiplicative homomorphic encryption python Realization _ Yue Xiangrong's blog -CSDN Blog _rsa Homomorphic encryption Simple homomorphic encryption includes additive homomorphism and multiplicative homomorphism ：        The most classic of additive homomorphism algorithm is Paillier Algorithm         The most classic of multiplicative homomorphism algorithm is RSA Algorithm ：              （ Basic equation ）                Encryption function e() Decryption function d() [enctrypt： encryption ;decrypt： Decrypt ]              ( Multiplicative homomorphism )                  ...https://blog.csdn.net/u014418725/article/details/82883220

---