Efficient Transciphering with Chacha21

• Gabriela M. Jacob UNICAMP
• Hilder V. L. Pereira UNICAMP

DOI: https://doi.org/10.5753/sbseg.2025.9840

Abstract

Transciphering is a powerful technique to reduce communication overhead of fully homomorphic encryption. We propose to use the standardized cipher Chacha20 to construct transciphering. We implement a full bitwise homomorphic version of Chacha20 and analyze different strategies and techniques to implement it with non-binary messages. We also propose a non-blackbox way of computing homomorphic XOR gates for free within Chacha20 round evaluation. This yields a significant reduction on the computation cost, with an estimate of 238.08 s to run the cipher in our best serial implementation, with our throughput being up to 2 times higher than the state of the art.

References

Bernstein, D. J. (2008). Chacha, a variant of salsa20. In Workshop Record of SASC, pages 3–5. Citeseer.

Bonte, C., Iliashenko, I., Park, J., Pereira, H. V. L., and Smart, N. P. (2022). FINAL: Faster FHE instantiated with NTRU and LWE. In Advances in Cryptology – ASIACRYPT 2022, Cham. Springer International Publishing.

Carpov, S., Izabachène, M., and Mollimard, V. (2019). New techniques for multi-value input homomorphic evaluation and applications. In Matsui, M., editor, Topics in Cryptology – CT-RSA 2019, pages 106–126, Cham. Springer International Publishing.

Chillotti, I., Gama, N., Georgieva, M., and Izabachène, M. (2020). TFHE: Fast Fully Homomorphic Encryption Over the Torus. Journal of Cryptology, 33(1):34–91.

Cosseron, O., Hoffmann, C., Méaux, P., and Standaert, F.-X. (2022). Towards case-optimized hybrid homomorphic encryption. In Agrawal, S. and Lin, D., editors, Advances in Cryptology – ASIACRYPT 2022, pages 32–67, Cham. Springer Nature Switzerland.

Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., and Walch, R. (2023). Pasta: A case for hybrid homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023(3):30–73.

Ducas, L. and Micciancio, D. (2015). Fhew: Bootstrapping homomorphic encryption in less than a second. In Oswald, E. and Fischlin, M., editors, Advances in Cryptology – EUROCRYPT 2015, pages 617–640, Berlin, Heidelberg. Springer Berlin Heidelberg.

Gentry, C. (2009). A fully homomorphic encryption scheme. PhD thesis, Stanford University. crypto.stanford.edu/craig.

Lyubashevsky, V., Peikert, C., and Regev, O. (2010). On ideal lattices and learning with errors over rings. In Gilbert, H., editor, Advances in Cryptology – EUROCRYPT 2010, pages 1–23, Berlin, Heidelberg. Springer Berlin Heidelberg.

Nir, Y. and Langley, A. (2018). ChaCha20 and Poly1305 for IETF Protocols. RFC 8439.

Pereira, H. V. L. (2021). Bootstrapping fully homomorphic encryption over the integers in less than one second. In IACR International Conference on Public-Key Cryptography, pages 331–359. Springer.

Thakur, I., Karmakar, A., Li, C., and Preneel, B. (2025). A survey on transciphering and symmetric ciphers for homomorphic encryption. Cryptology ePrint Archive, Paper 2025/093.

Trama, D., Clet, P.-E., Boudguiga, A., and Sirdey, R. (2023). A Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE. In Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC ’23, page 79–90, New York, NY, USA. Association for Computing Machinery.