Ashur, T., Mahzoun, M., Toprakhisar, D.: Chaghri-a fhe-friendly block cipher. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7–11 November 2022, pp. 139–150. ACM (2022)
[ARS+15] Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology – EUROCRYPT 2015. EUROCRYPT 2015. LNCS, vol. 9056, pp. 430–454. Springer, Berlin, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46800-5 17
[BIP+18] Boneh, D., Ishai, Y., Passelegue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter:-new simple PRF candidates and their applications. In: Beimel, A., Dziembowski, S. (eds.) Theory of Cryptography. TCC 2018. LNCS, vol. 11240, pp. 699– 729. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03810-6 25
[BY03] Bellare, M., Yee, B.: Forward-security in private-key cryptography. In: Joye, M. (ed.) Topics in Cryptology – CT-RSA 2003. CT-RSA 2003. LNCS, vol. 2612, pp. 1– 18. Springer, Berlin, Heidelberg (2003). https://doi.org/10.1007/3-540-36563-X 1
Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)
[CCF+16] Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. In: Peyrin, T. (eds.) Fast Software Encryption. FSE 2016. LNCS, vol. 9783, pp. 313–333. Springer, Berlin, Heidelberg (2016). https://doi.org/10.1007/978-3-662-52993-5 16
Cong, K., Das, D., Park, J., Pereira, H.V.: Sortinghat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7–11 November 2022, pp. 563–577. ACM (2022)
[CGGI16] Chillotti, I., Gama, N., Georgieva, M., Izabachene, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J., Takagi, T. (eds.) Advances in Cryptology – ASIACRYPT 2016. ASIACRYPT 2016. LNCS, vol. 10031, pp. 3–33. Springer, Berlin, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53887-6 1
[CHK+21] Cho, J., et al.: Transciphering framework for approximate homomorphic encryption. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology – ASIACRYPT 2021. ASIACRYPT 2021. LNCS, vol. 13092, pp. 640–669. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-92078-4 22
[CHMS22] Cosseron, O., Hoffmann, C., Meaux, P., Standaert, F.X.: Towards case-optimized hybrid homomorphic encryption-featuring the elisabeth stream cipher. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology – ASIACRYPT 2022. ASI-ACRYPT 2022. LNCS, vol. 13793, pp. 32–67. Springer, Cham (2022). https://doi. org/10.1007/978-3-031-22969-5 2
[CM03] Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) Advances in Cryptology – EUROCRYPT 2003. EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Berlin, Heidelberg (2003). https://doi.org/10.1007/3-540-39200-9 21
Carlet, C., Merabet, B.: Asymptotic lower bound on the algebraic immunity of random balanced multi-output Boolean functions. Adv. Math. Commun. 7, 197–217 (2013)
Carlet, C., Méaux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Trans. Symmetric Cryptol. 3, 2017 (2017)
Coppersmith, D.: Solving homogeneous linear equations over gf(2) via block wiedemann algorithm. Math. Comput. 62(205), 333–350 (1994)
[Cou03] Courtois, N.T.: Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Boneh, D. (ed.) Advances in Cryptology – CRYPTO 2003. CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Berlin, Heidelberg (2003). https://doi. org/10.1007/978-3-540-45146-4 11
[CZB+22] Clet, P.E., Zuber, M., Boudguiga, A., Sirdey, R., Gouy-Pailler, C.: Putting up the swiss army knife of homomorphic calculations by means of TFHE functional bootstrapping. IACR Cryptol. ePrint Arch., p. 149 (2022)
[DEG+18] Dobraunig, C., et al.: Rasta: a cipher with low anddepth and few ANDs per bit. In: Shacham, H., Boldyreva, A. (ed.) Advances in Cryptology – CRYPTO 2018. CRYPTO 2018. LNCS, vol. 10991, pp. 662–692 . Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96884-1 22
[DGH+21] Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology – CRYPTO 2021. CRYPTO 2021. LNCS, vol. 12828, pp. 517–547. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-84259-8 18
[DGH+23] Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., Walch, R.: Pasta: a case for hybrid homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(3), 30–73 (2023)
Didier, F.: A new upper bound on the block error probability after decoding over the erasure channel. IEEE Trans. Inf. Theory 52(10), 4496–4503 (2006)
[DLR16] Duval, S., Lallemand, V., Rotella, Y.: Cryptanalysis of the FLIP family of stream ciphers. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology – CRYPTO 2016. CRYPTO 2016. LNCS, vol. 9814, pp. 457–475. Springer, Berlin, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53018-4 17
Duval, S., Méaux, P., Momin, C., Standaert, F.-X.: Exploring crypto-physical dark matter and learning with physical rounding towards secure and efficient fresh re-keying. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 373–401 (2021)
Dupin, A., Méaux, P., Rossi, M.: On the algebraic immunity-resiliency trade-off, implications for goldreich’s pseudorandom generator. Des. Codes Cryptogr. 91(9), 3035–3079 (2023)
Daemen, J., Rijmen, V.: The Design of Rijndael-The Advanced Encryption Standard (AES), 2nd edn. Springer, Information Security and Cryptography. Springer, Berlin, Heidelberg (2020). https://doi.org/10.1007/978-3-662-04722-4
Faugère, J.-C.: A new efficient algorithm for computing groebner bases. J. Pure Appl. Algebra 139, 61–88 (1999)
Faugère, J.-C.: A new efficient algorithm for computing Grobner bases without reduction to zero. In: Workshop on Application of Groebner Bases 2002, Catania, Spain (2002)
[FY53] Fisher, R.A., Yates, F.: Statistical Tables for Biological, Agricultural and Medical Research. Hafner Publishing Company, London (1953)
[GHBJR23] Gilbert, H., Heim Boissier, R., Jean, J., Reinhard, J.R.: Cryptanalysis of Elisabeth-4. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology – ASIACRYPT 2023. ASIACRYPT 2023. LNCS, vol. 14440, pp. 256–284. Springer, Singapore (2023). https://doi.org/10.1007/978-981-99-8727-6 9
[GIKV23] Geelen, R., Iliashenko, I., Kang, J., Vercauteren, F.: On polynomial functions mod-ulo pe and faster bootstrapping for homomorphic encryption. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology – EUROCRYPT 2023. EUROCRYPT 2023. LNCS, vol. 14006, pp. 257–286. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-30620-4 9
[Gol00] Goldreich, O.: Candidate one-way functions based on expander graphs. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 76–87. Springer, Berlin, Heidelberg (2000). https://doi.org/10.1007/978-3-642-22670-0 10
[HKL+22] Ha, J., Kim, S., Lee, B., Lee, J., Son, M.: Rubato: noisy ciphers for approximate homomorphic encryption. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology – EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13275, pp. 581–610. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-06944-4 20
[HMM+23] Hoffmann, C., Meaux, P., Momin, C., Rotella, Y., Standaert, F.X., Udvarhelyi, B.: Learning with physical rounding for linear and quadratic leakage functions. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology – CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14083, pp. 410–439. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-38548-3 14
[Knu97] Knuth, D.E.: Seminumerical Algorithms, volume 2 of The Art of Computer Programming, third edition. Addison-Wesley Professional, Boston, November 1997
Kluczniak, K., Schild, L.: FDFB: full domain functional bootstrapping towards practical fully homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1), 501–537 (2023)
[MCJS19] Meaux, P., Carlet, C., Journault, A., Standaert, F.X.: Improved filter permutators for efficient FHE: better instances and implementations. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) Progress in Cryptology – INDOCRYPT 2019. INDOCRYPT 2019. LNCS, vol. 11898, pp. 68–91. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35423-7 4
[Méa22] Méaux, P.: On the algebraic immunity of direct sum constructions. Discret. Appl. Math. 320, 223–234 (2022)
Ma, S., Huang, T., Wang, A., Wang, X.: Fast and accurate: efficient full-domain functional bootstrap and digit decomposition for homomorphic computation. IACR Cryptol. ePrint Arch., p. 645 (2023)
[MJSC16] Meaux, P., Journault, A., Standaert, FX., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology – EUROCRYPT 2016. EUROCRYPT 2016. LNCS, vol. 9665, pp. 311–343. Springer, Berlin, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49890-3 13
Specker, E., Hungerbühler, N., Wasem, M.: The ring of polyfunctions over z/nz. Commun. Algebra 51(1), 116–134 (2023)